/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/cohendiv-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 23:07:48,044 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 23:07:48,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 23:07:48,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 23:07:48,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 23:07:48,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 23:07:48,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 23:07:48,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 23:07:48,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 23:07:48,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 23:07:48,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 23:07:48,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 23:07:48,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 23:07:48,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 23:07:48,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 23:07:48,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 23:07:48,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 23:07:48,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 23:07:48,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 23:07:48,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 23:07:48,084 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 23:07:48,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 23:07:48,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 23:07:48,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 23:07:48,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 23:07:48,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 23:07:48,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 23:07:48,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 23:07:48,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 23:07:48,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 23:07:48,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 23:07:48,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 23:07:48,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 23:07:48,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 23:07:48,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 23:07:48,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 23:07:48,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 23:07:48,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 23:07:48,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 23:07:48,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 23:07:48,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 23:07:48,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 23:07:48,095 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:07:48,109 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 23:07:48,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 23:07:48,110 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 23:07:48,110 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 23:07:48,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 23:07:48,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 23:07:48,110 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 23:07:48,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 23:07:48,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 23:07:48,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 23:07:48,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 23:07:48,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 23:07:48,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 23:07:48,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 23:07:48,111 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 23:07:48,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 23:07:48,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 23:07:48,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 23:07:48,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 23:07:48,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:07:48,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 23:07:48,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 23:07:48,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 23:07:48,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 23:07:48,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 23:07:48,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 23:07:48,112 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 23:07:48,112 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 23:07:48,113 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 23:07:48,113 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:07:48,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 23:07:48,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 23:07:48,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 23:07:48,292 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 23:07:48,293 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 23:07:48,294 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound50.c [2022-04-27 23:07:48,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ee48eaa1/f2b01c80a05e400597df9523b8bbcda3/FLAGace5fc809 [2022-04-27 23:07:48,672 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 23:07:48,672 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound50.c [2022-04-27 23:07:48,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ee48eaa1/f2b01c80a05e400597df9523b8bbcda3/FLAGace5fc809 [2022-04-27 23:07:49,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ee48eaa1/f2b01c80a05e400597df9523b8bbcda3 [2022-04-27 23:07:49,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 23:07:49,112 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 23:07:49,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 23:07:49,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 23:07:49,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 23:07:49,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:07:49" (1/1) ... [2022-04-27 23:07:49,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad86d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:49, skipping insertion in model container [2022-04-27 23:07:49,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:07:49" (1/1) ... [2022-04-27 23:07:49,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 23:07:49,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 23:07:49,257 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/cohendiv-ll_unwindbound50.c[576,589] [2022-04-27 23:07:49,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:07:49,276 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 23:07:49,283 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/cohendiv-ll_unwindbound50.c[576,589] [2022-04-27 23:07:49,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:07:49,297 INFO L208 MainTranslator]: Completed translation [2022-04-27 23:07:49,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:49 WrapperNode [2022-04-27 23:07:49,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 23:07:49,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 23:07:49,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 23:07:49,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 23:07:49,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:49" (1/1) ... [2022-04-27 23:07:49,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:49" (1/1) ... [2022-04-27 23:07:49,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:49" (1/1) ... [2022-04-27 23:07:49,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:49" (1/1) ... [2022-04-27 23:07:49,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:49" (1/1) ... [2022-04-27 23:07:49,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:49" (1/1) ... [2022-04-27 23:07:49,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:49" (1/1) ... [2022-04-27 23:07:49,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 23:07:49,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 23:07:49,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 23:07:49,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 23:07:49,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:49" (1/1) ... [2022-04-27 23:07:49,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:07:49,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:07:49,362 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:07:49,369 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:07:49,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 23:07:49,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 23:07:49,391 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 23:07:49,391 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 23:07:49,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 23:07:49,391 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 23:07:49,391 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 23:07:49,391 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 23:07:49,391 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 23:07:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 23:07:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 23:07:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 23:07:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 23:07:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 23:07:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 23:07:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 23:07:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 23:07:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 23:07:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 23:07:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 23:07:49,449 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 23:07:49,450 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 23:07:49,604 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 23:07:49,612 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 23:07:49,613 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 23:07:49,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:07:49 BoogieIcfgContainer [2022-04-27 23:07:49,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 23:07:49,617 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 23:07:49,617 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 23:07:49,618 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 23:07:49,620 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:07:49" (1/1) ... [2022-04-27 23:07:49,621 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 23:07:49,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:07:49 BasicIcfg [2022-04-27 23:07:49,641 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 23:07:49,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 23:07:49,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 23:07:49,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 23:07:49,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:07:49" (1/4) ... [2022-04-27 23:07:49,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194c022e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:07:49, skipping insertion in model container [2022-04-27 23:07:49,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:49" (2/4) ... [2022-04-27 23:07:49,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194c022e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:07:49, skipping insertion in model container [2022-04-27 23:07:49,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:07:49" (3/4) ... [2022-04-27 23:07:49,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194c022e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:07:49, skipping insertion in model container [2022-04-27 23:07:49,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:07:49" (4/4) ... [2022-04-27 23:07:49,657 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound50.cqvasr [2022-04-27 23:07:49,667 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 23:07:49,667 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 23:07:49,696 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 23:07:49,700 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@59a59eaf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@49f7c36b [2022-04-27 23:07:49,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 23:07:49,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:07:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 23:07:49,710 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:07:49,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:07:49,711 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:07:49,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:07:49,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1213541379, now seen corresponding path program 1 times [2022-04-27 23:07:49,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:07:49,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176144441] [2022-04-27 23:07:49,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:07:49,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:07:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:07:49,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:07:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:07:49,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {41#true} is VALID [2022-04-27 23:07:49,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 23:07:49,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 23:07:49,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:07:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:07:49,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [104] assume_abort_if_notENTRY-->L12: 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] {41#true} is VALID [2022-04-27 23:07:49,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [107] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:07:49,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:07:49,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 23:07:49,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:07:49,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {41#true} is VALID [2022-04-27 23:07:49,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 23:07:49,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 23:07:49,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 23:07:49,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} [100] mainENTRY-->L30: 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_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {41#true} is VALID [2022-04-27 23:07:49,876 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-27 23:07:49,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} [104] assume_abort_if_notENTRY-->L12: 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] {41#true} is VALID [2022-04-27 23:07:49,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} [107] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:07:49,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:07:49,877 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 23:07:49,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {42#false} is VALID [2022-04-27 23:07:49,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#false} [105] L37-3-->L37-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:07:49,877 INFO L272 TraceCheckUtils]: 13: Hoare triple {42#false} [109] L37-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {42#false} is VALID [2022-04-27 23:07:49,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {42#false} is VALID [2022-04-27 23:07:49,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} [117] L15-->L16: 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[] {42#false} is VALID [2022-04-27 23:07:49,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:07:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:07:49,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:07:49,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176144441] [2022-04-27 23:07:49,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176144441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:07:49,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:07:49,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 23:07:49,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737263232] [2022-04-27 23:07:49,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:07:49,884 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 23:07:49,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:07:49,887 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:07:49,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:07:49,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 23:07:49,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:07:49,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 23:07:49,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:07:49,920 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:07:50,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:50,078 INFO L93 Difference]: Finished difference Result 68 states and 101 transitions. [2022-04-27 23:07:50,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 23:07:50,078 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 23:07:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:07:50,079 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:07:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 23:07:50,086 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:07:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 23:07:50,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-27 23:07:50,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:07:50,184 INFO L225 Difference]: With dead ends: 68 [2022-04-27 23:07:50,184 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 23:07:50,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:07:50,190 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:07:50,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:07:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 23:07:50,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-27 23:07:50,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:07:50,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 23:07:50,220 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 23:07:50,220 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 23:07:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:50,223 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 23:07:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 23:07:50,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:07:50,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:07:50,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-27 23:07:50,225 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-27 23:07:50,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:50,228 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 23:07:50,228 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 23:07:50,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:07:50,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:07:50,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:07:50,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:07:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 23:07:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-04-27 23:07:50,232 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2022-04-27 23:07:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:07:50,232 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-04-27 23:07:50,232 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:07:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-04-27 23:07:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 23:07:50,233 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:07:50,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:07:50,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 23:07:50,233 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:07:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:07:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1202035559, now seen corresponding path program 1 times [2022-04-27 23:07:50,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:07:50,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985816535] [2022-04-27 23:07:50,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:07:50,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:07:50,247 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:07:50,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [843332528] [2022-04-27 23:07:50,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:07:50,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:07:50,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:07:50,258 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:07:50,260 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:07:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:07:50,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 23:07:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:07:50,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:07:50,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {265#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-27 23:07:50,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {265#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {273#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:50,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#(<= ~counter~0 0)} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:50,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#(<= ~counter~0 0)} {265#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:50,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#(<= ~counter~0 0)} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:50,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#(<= ~counter~0 0)} [100] mainENTRY-->L30: 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_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {273#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:50,430 INFO L272 TraceCheckUtils]: 6: Hoare triple {273#(<= ~counter~0 0)} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {273#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:50,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {273#(<= ~counter~0 0)} [104] assume_abort_if_notENTRY-->L12: 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] {273#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:50,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#(<= ~counter~0 0)} [108] L12-->L12-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[] {273#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:50,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#(<= ~counter~0 0)} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:50,432 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {273#(<= ~counter~0 0)} {273#(<= ~counter~0 0)} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {273#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:50,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#(<= ~counter~0 0)} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {273#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:50,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {273#(<= ~counter~0 0)} [106] L37-3-->L37-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] {307#(<= |main_#t~post6| 0)} is VALID [2022-04-27 23:07:50,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {307#(<= |main_#t~post6| 0)} [110] L37-1-->L37-4: Formula: (not (< |v_main_#t~post6_3| 50)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {266#false} is VALID [2022-04-27 23:07:50,434 INFO L272 TraceCheckUtils]: 14: Hoare triple {266#false} [109] L37-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {266#false} is VALID [2022-04-27 23:07:50,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {266#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {266#false} is VALID [2022-04-27 23:07:50,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {266#false} [117] L15-->L16: 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[] {266#false} is VALID [2022-04-27 23:07:50,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {266#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {266#false} is VALID [2022-04-27 23:07:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:07:50,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:07:50,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:07:50,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985816535] [2022-04-27 23:07:50,435 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:07:50,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843332528] [2022-04-27 23:07:50,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843332528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:07:50,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:07:50,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 23:07:50,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253559560] [2022-04-27 23:07:50,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:07:50,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 23:07:50,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:07:50,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:07:50,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:07:50,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 23:07:50,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:07:50,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 23:07:50,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 23:07:50,457 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:07:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:50,562 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 23:07:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 23:07:50,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 23:07:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:07:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:07:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-27 23:07:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:07:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-27 23:07:50,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-27 23:07:50,608 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:07:50,612 INFO L225 Difference]: With dead ends: 42 [2022-04-27 23:07:50,612 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 23:07:50,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 23:07:50,614 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:07:50,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:07:50,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 23:07:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 23:07:50,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:07:50,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 23:07:50,629 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 23:07:50,630 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 23:07:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:50,649 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 23:07:50,649 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 23:07:50,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:07:50,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:07:50,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-27 23:07:50,650 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-27 23:07:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:50,652 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 23:07:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 23:07:50,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:07:50,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:07:50,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:07:50,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:07:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 23:07:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-27 23:07:50,655 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2022-04-27 23:07:50,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:07:50,655 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-27 23:07:50,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:07:50,655 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 23:07:50,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 23:07:50,656 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:07:50,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:07:50,677 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:07:50,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:07:50,868 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:07:50,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:07:50,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1200933292, now seen corresponding path program 1 times [2022-04-27 23:07:50,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:07:50,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971331667] [2022-04-27 23:07:50,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:07:50,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:07:50,880 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:07:50,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1105694019] [2022-04-27 23:07:50,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:07:50,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:07:50,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:07:50,882 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:07:50,883 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:07:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:07:50,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:07:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:07:50,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:07:55,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {505#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#true} is VALID [2022-04-27 23:07:55,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {505#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {505#true} is VALID [2022-04-27 23:07:55,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {505#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#true} is VALID [2022-04-27 23:07:55,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {505#true} {505#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#true} is VALID [2022-04-27 23:07:55,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {505#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#true} is VALID [2022-04-27 23:07:55,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {505#true} [100] mainENTRY-->L30: 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_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {505#true} is VALID [2022-04-27 23:07:55,073 INFO L272 TraceCheckUtils]: 6: Hoare triple {505#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {505#true} is VALID [2022-04-27 23:07:55,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#true} [104] assume_abort_if_notENTRY-->L12: 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] {505#true} is VALID [2022-04-27 23:07:55,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {505#true} [108] L12-->L12-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[] {505#true} is VALID [2022-04-27 23:07:55,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#true} is VALID [2022-04-27 23:07:55,074 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {505#true} {505#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {505#true} is VALID [2022-04-27 23:07:55,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {505#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {543#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-27 23:07:55,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {543#(and (= main_~a~0 0) (= main_~b~0 0))} [106] L37-3-->L37-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] {543#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-27 23:07:55,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {543#(and (= main_~a~0 0) (= main_~b~0 0))} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {543#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-27 23:07:55,077 INFO L272 TraceCheckUtils]: 14: Hoare triple {543#(and (= main_~a~0 0) (= main_~b~0 0))} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {553#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:07:55,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {553#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {557#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:07:55,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {557#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: 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[] {506#false} is VALID [2022-04-27 23:07:55,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {506#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#false} is VALID [2022-04-27 23:07:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:07:55,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:07:55,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:07:55,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971331667] [2022-04-27 23:07:55,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:07:55,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105694019] [2022-04-27 23:07:55,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105694019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:07:55,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:07:55,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:07:55,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427168441] [2022-04-27 23:07:55,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:07:55,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 23:07:55,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:07:55,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:07:55,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:07:55,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:07:55,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:07:55,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:07:55,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:07:55,097 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:07:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:55,254 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 23:07:55,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:07:55,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 23:07:55,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:07:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:07:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-27 23:07:55,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:07:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-27 23:07:55,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-27 23:07:55,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:07:55,296 INFO L225 Difference]: With dead ends: 45 [2022-04-27 23:07:55,296 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 23:07:55,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:07:55,297 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:07:55,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:07:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 23:07:55,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-27 23:07:55,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:07:55,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 23:07:55,307 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 23:07:55,307 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 23:07:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:55,309 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-27 23:07:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-27 23:07:55,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:07:55,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:07:55,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-27 23:07:55,310 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-27 23:07:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:55,312 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-27 23:07:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-27 23:07:55,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:07:55,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:07:55,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:07:55,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:07:55,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 23:07:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-27 23:07:55,315 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 18 [2022-04-27 23:07:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:07:55,315 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-27 23:07:55,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:07:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-27 23:07:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 23:07:55,316 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:07:55,316 INFO L195 NwaCegarLoop]: trace histogram [2, 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:07:55,334 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:07:55,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 23:07:55,541 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:07:55,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:07:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash -944097291, now seen corresponding path program 1 times [2022-04-27 23:07:55,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:07:55,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50512417] [2022-04-27 23:07:55,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:07:55,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:07:55,555 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:07:55,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [234063174] [2022-04-27 23:07:55,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:07:55,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:07:55,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:07:55,557 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:07:55,560 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:07:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:07:55,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:07:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:07:55,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:07:58,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {776#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 23:07:58,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {776#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {776#true} is VALID [2022-04-27 23:07:58,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {776#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 23:07:58,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {776#true} {776#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 23:07:58,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {776#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 23:07:58,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {776#true} [100] mainENTRY-->L30: 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_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {776#true} is VALID [2022-04-27 23:07:58,138 INFO L272 TraceCheckUtils]: 6: Hoare triple {776#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {776#true} is VALID [2022-04-27 23:07:58,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {776#true} [104] assume_abort_if_notENTRY-->L12: 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] {776#true} is VALID [2022-04-27 23:07:58,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {776#true} [108] L12-->L12-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[] {776#true} is VALID [2022-04-27 23:07:58,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {776#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 23:07:58,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {776#true} {776#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {776#true} is VALID [2022-04-27 23:07:58,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {776#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:07:58,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [106] L37-3-->L37-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] {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:07:58,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:07:58,146 INFO L272 TraceCheckUtils]: 14: Hoare triple {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {776#true} is VALID [2022-04-27 23:07:58,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {776#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {776#true} is VALID [2022-04-27 23:07:58,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {776#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 23:07:58,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {776#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {776#true} is VALID [2022-04-27 23:07:58,148 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {776#true} {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:07:58,148 INFO L272 TraceCheckUtils]: 19: Hoare triple {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {839#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:07:58,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {839#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {843#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:07:58,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {843#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: 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[] {777#false} is VALID [2022-04-27 23:07:58,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {777#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {777#false} is VALID [2022-04-27 23:07:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:07:58,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:07:58,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:07:58,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50512417] [2022-04-27 23:07:58,150 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:07:58,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234063174] [2022-04-27 23:07:58,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234063174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:07:58,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:07:58,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:07:58,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185391659] [2022-04-27 23:07:58,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:07:58,151 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 23:07:58,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:07:58,151 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:07:58,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:07:58,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:07:58,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:07:58,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:07:58,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:07:58,168 INFO L87 Difference]: Start difference. First operand 40 states and 49 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:07:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:58,344 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-27 23:07:58,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:07:58,344 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 23:07:58,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:07:58,344 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:07:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 23:07:58,346 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:07:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 23:07:58,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-27 23:07:58,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:07:58,407 INFO L225 Difference]: With dead ends: 58 [2022-04-27 23:07:58,407 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 23:07:58,407 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:07:58,408 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:07:58,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:07:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 23:07:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-27 23:07:58,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:07:58,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 23:07:58,415 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 23:07:58,416 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 23:07:58,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:58,418 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 23:07:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 23:07:58,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:07:58,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:07:58,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-27 23:07:58,419 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-27 23:07:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:58,422 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 23:07:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 23:07:58,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:07:58,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:07:58,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:07:58,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:07:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 23:07:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-27 23:07:58,424 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 23 [2022-04-27 23:07:58,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:07:58,425 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-27 23:07:58,425 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:07:58,425 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-27 23:07:58,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 23:07:58,425 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:07:58,425 INFO L195 NwaCegarLoop]: trace histogram [3, 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:07:58,445 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:07:58,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:07:58,639 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:07:58,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:07:58,639 INFO L85 PathProgramCache]: Analyzing trace with hash -653220550, now seen corresponding path program 1 times [2022-04-27 23:07:58,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:07:58,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219561450] [2022-04-27 23:07:58,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:07:58,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:07:58,652 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:07:58,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612379930] [2022-04-27 23:07:58,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:07:58,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:07:58,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:07:58,655 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:07:58,657 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:07:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:07:58,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:07:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:07:58,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:07:58,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {1126#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1126#true} is VALID [2022-04-27 23:07:58,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {1126#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {1126#true} is VALID [2022-04-27 23:07:58,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {1126#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1126#true} is VALID [2022-04-27 23:07:58,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1126#true} {1126#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1126#true} is VALID [2022-04-27 23:07:58,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {1126#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1126#true} is VALID [2022-04-27 23:07:58,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {1126#true} [100] mainENTRY-->L30: 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_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1126#true} is VALID [2022-04-27 23:07:58,801 INFO L272 TraceCheckUtils]: 6: Hoare triple {1126#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1126#true} is VALID [2022-04-27 23:07:58,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {1126#true} [104] assume_abort_if_notENTRY-->L12: 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] {1126#true} is VALID [2022-04-27 23:07:58,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {1126#true} [108] L12-->L12-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[] {1126#true} is VALID [2022-04-27 23:07:58,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {1126#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1126#true} is VALID [2022-04-27 23:07:58,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1126#true} {1126#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1126#true} is VALID [2022-04-27 23:07:58,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {1126#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1126#true} is VALID [2022-04-27 23:07:58,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {1126#true} [106] L37-3-->L37-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] {1126#true} is VALID [2022-04-27 23:07:58,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {1126#true} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1126#true} is VALID [2022-04-27 23:07:58,802 INFO L272 TraceCheckUtils]: 14: Hoare triple {1126#true} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1126#true} is VALID [2022-04-27 23:07:58,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {1126#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1126#true} is VALID [2022-04-27 23:07:58,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {1126#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1126#true} is VALID [2022-04-27 23:07:58,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {1126#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1126#true} is VALID [2022-04-27 23:07:58,803 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1126#true} {1126#true} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1126#true} is VALID [2022-04-27 23:07:58,803 INFO L272 TraceCheckUtils]: 19: Hoare triple {1126#true} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1126#true} is VALID [2022-04-27 23:07:58,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {1126#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1126#true} is VALID [2022-04-27 23:07:58,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {1126#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1126#true} is VALID [2022-04-27 23:07:58,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {1126#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1126#true} is VALID [2022-04-27 23:07:58,804 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1126#true} {1126#true} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1126#true} is VALID [2022-04-27 23:07:58,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {1126#true} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1203#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-27 23:07:58,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {1203#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1203#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-27 23:07:58,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {1203#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 50) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1203#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-27 23:07:58,808 INFO L272 TraceCheckUtils]: 27: Hoare triple {1203#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1213#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:07:58,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {1213#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1217#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:07:58,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {1217#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: 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[] {1127#false} is VALID [2022-04-27 23:07:58,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {1127#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1127#false} is VALID [2022-04-27 23:07:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:07:58,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:07:58,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:07:58,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219561450] [2022-04-27 23:07:58,810 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:07:58,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612379930] [2022-04-27 23:07:58,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612379930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:07:58,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:07:58,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:07:58,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990036759] [2022-04-27 23:07:58,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:07:58,811 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-27 23:07:58,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:07:58,811 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 23:07:58,829 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:07:58,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:07:58,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:07:58,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:07:58,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:07:58,830 INFO L87 Difference]: Start difference. First operand 54 states and 69 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 23:07:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:59,046 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2022-04-27 23:07:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:07:59,046 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-27 23:07:59,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:07:59,048 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 23:07:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-27 23:07:59,050 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 23:07:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-27 23:07:59,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-27 23:07:59,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:07:59,111 INFO L225 Difference]: With dead ends: 83 [2022-04-27 23:07:59,112 INFO L226 Difference]: Without dead ends: 81 [2022-04-27 23:07:59,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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:07:59,113 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:07:59,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 145 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:07:59,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-27 23:07:59,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-04-27 23:07:59,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:07:59,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 23:07:59,123 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 23:07:59,124 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 23:07:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:59,127 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-27 23:07:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-27 23:07:59,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:07:59,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:07:59,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-27 23:07:59,128 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-27 23:07:59,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:59,131 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-27 23:07:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-27 23:07:59,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:07:59,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:07:59,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:07:59,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:07:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 23:07:59,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2022-04-27 23:07:59,135 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 31 [2022-04-27 23:07:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:07:59,135 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2022-04-27 23:07:59,135 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 23:07:59,135 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2022-04-27 23:07:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 23:07:59,136 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:07:59,136 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:07:59,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 23:07:59,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:07:59,349 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:07:59,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:07:59,350 INFO L85 PathProgramCache]: Analyzing trace with hash -830156892, now seen corresponding path program 1 times [2022-04-27 23:07:59,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:07:59,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398284356] [2022-04-27 23:07:59,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:07:59,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:07:59,361 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:07:59,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206748189] [2022-04-27 23:07:59,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:07:59,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:07:59,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:07:59,362 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:07:59,363 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:07:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:07:59,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:07:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:07:59,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:07:59,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1622#true} is VALID [2022-04-27 23:07:59,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {1630#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:59,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#(<= ~counter~0 0)} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1630#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:59,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1630#(<= ~counter~0 0)} {1622#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1630#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:59,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {1630#(<= ~counter~0 0)} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1630#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:59,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {1630#(<= ~counter~0 0)} [100] mainENTRY-->L30: 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_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1630#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:59,569 INFO L272 TraceCheckUtils]: 6: Hoare triple {1630#(<= ~counter~0 0)} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1630#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:59,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {1630#(<= ~counter~0 0)} [104] assume_abort_if_notENTRY-->L12: 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] {1630#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:59,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {1630#(<= ~counter~0 0)} [108] L12-->L12-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[] {1630#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:59,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {1630#(<= ~counter~0 0)} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1630#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:59,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1630#(<= ~counter~0 0)} {1630#(<= ~counter~0 0)} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1630#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:59,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {1630#(<= ~counter~0 0)} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1630#(<= ~counter~0 0)} is VALID [2022-04-27 23:07:59,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {1630#(<= ~counter~0 0)} [106] L37-3-->L37-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] {1664#(<= ~counter~0 1)} is VALID [2022-04-27 23:07:59,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {1664#(<= ~counter~0 1)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1664#(<= ~counter~0 1)} is VALID [2022-04-27 23:07:59,578 INFO L272 TraceCheckUtils]: 14: Hoare triple {1664#(<= ~counter~0 1)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1664#(<= ~counter~0 1)} is VALID [2022-04-27 23:07:59,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {1664#(<= ~counter~0 1)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1664#(<= ~counter~0 1)} is VALID [2022-04-27 23:07:59,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {1664#(<= ~counter~0 1)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1664#(<= ~counter~0 1)} is VALID [2022-04-27 23:07:59,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {1664#(<= ~counter~0 1)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1664#(<= ~counter~0 1)} is VALID [2022-04-27 23:07:59,579 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1664#(<= ~counter~0 1)} {1664#(<= ~counter~0 1)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1664#(<= ~counter~0 1)} is VALID [2022-04-27 23:07:59,579 INFO L272 TraceCheckUtils]: 19: Hoare triple {1664#(<= ~counter~0 1)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1664#(<= ~counter~0 1)} is VALID [2022-04-27 23:07:59,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {1664#(<= ~counter~0 1)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1664#(<= ~counter~0 1)} is VALID [2022-04-27 23:07:59,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {1664#(<= ~counter~0 1)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1664#(<= ~counter~0 1)} is VALID [2022-04-27 23:07:59,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {1664#(<= ~counter~0 1)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1664#(<= ~counter~0 1)} is VALID [2022-04-27 23:07:59,581 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1664#(<= ~counter~0 1)} {1664#(<= ~counter~0 1)} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1664#(<= ~counter~0 1)} is VALID [2022-04-27 23:07:59,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {1664#(<= ~counter~0 1)} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1664#(<= ~counter~0 1)} is VALID [2022-04-27 23:07:59,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {1664#(<= ~counter~0 1)} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1704#(<= |main_#t~post7| 1)} is VALID [2022-04-27 23:07:59,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {1704#(<= |main_#t~post7| 1)} [133] L46-1-->L46-4: Formula: (not (< |v_main_#t~post7_3| 50)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1623#false} is VALID [2022-04-27 23:07:59,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {1623#false} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {1623#false} is VALID [2022-04-27 23:07:59,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {1623#false} [106] L37-3-->L37-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] {1623#false} is VALID [2022-04-27 23:07:59,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {1623#false} [110] L37-1-->L37-4: Formula: (not (< |v_main_#t~post6_3| 50)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1623#false} is VALID [2022-04-27 23:07:59,582 INFO L272 TraceCheckUtils]: 30: Hoare triple {1623#false} [109] L37-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1623#false} is VALID [2022-04-27 23:07:59,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {1623#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1623#false} is VALID [2022-04-27 23:07:59,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {1623#false} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1623#false} is VALID [2022-04-27 23:07:59,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {1623#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1623#false} is VALID [2022-04-27 23:07:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:07:59,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:07:59,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:07:59,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398284356] [2022-04-27 23:07:59,583 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:07:59,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206748189] [2022-04-27 23:07:59,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206748189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:07:59,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:07:59,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:07:59,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931090942] [2022-04-27 23:07:59,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:07:59,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-27 23:07:59,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:07:59,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:07:59,604 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:07:59,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:07:59,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:07:59,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:07:59,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:07:59,605 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:07:59,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:59,709 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-04-27 23:07:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:07:59,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-27 23:07:59,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:07:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:07:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-27 23:07:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:07:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-27 23:07:59,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2022-04-27 23:07:59,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:07:59,771 INFO L225 Difference]: With dead ends: 113 [2022-04-27 23:07:59,771 INFO L226 Difference]: Without dead ends: 78 [2022-04-27 23:07:59,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:07:59,772 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:07:59,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 135 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:07:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-27 23:07:59,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-27 23:07:59,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:07:59,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 23:07:59,783 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 23:07:59,784 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 23:07:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:59,786 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-27 23:07:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-27 23:07:59,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:07:59,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:07:59,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-27 23:07:59,787 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-27 23:07:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:07:59,789 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-27 23:07:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-27 23:07:59,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:07:59,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:07:59,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:07:59,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:07:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 23:07:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2022-04-27 23:07:59,792 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 34 [2022-04-27 23:07:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:07:59,793 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2022-04-27 23:07:59,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:07:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-27 23:07:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 23:07:59,793 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:07:59,793 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:07:59,812 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:08:00,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:00,007 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:00,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:00,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1527688582, now seen corresponding path program 1 times [2022-04-27 23:08:00,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:00,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467400858] [2022-04-27 23:08:00,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:00,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:00,019 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:08:00,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2046161127] [2022-04-27 23:08:00,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:00,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:00,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:00,021 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:08:00,022 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:08:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:00,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:08:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:00,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:08:00,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {2168#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2168#true} is VALID [2022-04-27 23:08:00,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {2168#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {2168#true} is VALID [2022-04-27 23:08:00,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {2168#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2168#true} is VALID [2022-04-27 23:08:00,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2168#true} {2168#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2168#true} is VALID [2022-04-27 23:08:00,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {2168#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2168#true} is VALID [2022-04-27 23:08:00,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {2168#true} [100] mainENTRY-->L30: 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_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {2168#true} is VALID [2022-04-27 23:08:00,234 INFO L272 TraceCheckUtils]: 6: Hoare triple {2168#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2168#true} is VALID [2022-04-27 23:08:00,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {2168#true} [104] assume_abort_if_notENTRY-->L12: 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] {2194#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:08:00,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {2194#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [108] L12-->L12-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[] {2198#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:08:00,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {2198#(not (= |assume_abort_if_not_#in~cond| 0))} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2198#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:08:00,236 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2198#(not (= |assume_abort_if_not_#in~cond| 0))} {2168#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2205#(<= 1 main_~y~0)} is VALID [2022-04-27 23:08:00,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {2205#(<= 1 main_~y~0)} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {2205#(<= 1 main_~y~0)} is VALID [2022-04-27 23:08:00,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {2205#(<= 1 main_~y~0)} [106] L37-3-->L37-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] {2205#(<= 1 main_~y~0)} is VALID [2022-04-27 23:08:00,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {2205#(<= 1 main_~y~0)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2205#(<= 1 main_~y~0)} is VALID [2022-04-27 23:08:00,237 INFO L272 TraceCheckUtils]: 14: Hoare triple {2205#(<= 1 main_~y~0)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2168#true} is VALID [2022-04-27 23:08:00,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {2168#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2168#true} is VALID [2022-04-27 23:08:00,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {2168#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2168#true} is VALID [2022-04-27 23:08:00,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {2168#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2168#true} is VALID [2022-04-27 23:08:00,238 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2168#true} {2205#(<= 1 main_~y~0)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2205#(<= 1 main_~y~0)} is VALID [2022-04-27 23:08:00,238 INFO L272 TraceCheckUtils]: 19: Hoare triple {2205#(<= 1 main_~y~0)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2168#true} is VALID [2022-04-27 23:08:00,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {2168#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2168#true} is VALID [2022-04-27 23:08:00,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {2168#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2168#true} is VALID [2022-04-27 23:08:00,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {2168#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2168#true} is VALID [2022-04-27 23:08:00,252 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2168#true} {2205#(<= 1 main_~y~0)} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2205#(<= 1 main_~y~0)} is VALID [2022-04-27 23:08:00,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {2205#(<= 1 main_~y~0)} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2248#(<= 1 main_~r~0)} is VALID [2022-04-27 23:08:00,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {2248#(<= 1 main_~r~0)} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2248#(<= 1 main_~r~0)} is VALID [2022-04-27 23:08:00,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {2248#(<= 1 main_~r~0)} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 50) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2248#(<= 1 main_~r~0)} is VALID [2022-04-27 23:08:00,253 INFO L272 TraceCheckUtils]: 27: Hoare triple {2248#(<= 1 main_~r~0)} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2168#true} is VALID [2022-04-27 23:08:00,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {2168#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2168#true} is VALID [2022-04-27 23:08:00,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {2168#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2168#true} is VALID [2022-04-27 23:08:00,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {2168#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2168#true} is VALID [2022-04-27 23:08:00,254 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2168#true} {2248#(<= 1 main_~r~0)} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2248#(<= 1 main_~r~0)} is VALID [2022-04-27 23:08:00,254 INFO L272 TraceCheckUtils]: 32: Hoare triple {2248#(<= 1 main_~r~0)} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2168#true} is VALID [2022-04-27 23:08:00,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {2168#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2168#true} is VALID [2022-04-27 23:08:00,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {2168#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2168#true} is VALID [2022-04-27 23:08:00,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {2168#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2168#true} is VALID [2022-04-27 23:08:00,255 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2168#true} {2248#(<= 1 main_~r~0)} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2248#(<= 1 main_~r~0)} is VALID [2022-04-27 23:08:00,256 INFO L272 TraceCheckUtils]: 37: Hoare triple {2248#(<= 1 main_~r~0)} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2288#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:08:00,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {2288#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2292#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:08:00,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {2292#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: 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[] {2169#false} is VALID [2022-04-27 23:08:00,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {2169#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2169#false} is VALID [2022-04-27 23:08:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 23:08:00,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:08:00,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:00,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467400858] [2022-04-27 23:08:00,257 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:08:00,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046161127] [2022-04-27 23:08:00,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046161127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:00,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:00,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 23:08:00,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682963425] [2022-04-27 23:08:00,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:00,258 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-27 23:08:00,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:00,258 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), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 23:08:00,277 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:08:00,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 23:08:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:00,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 23:08:00,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-27 23:08:00,278 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 23:08:00,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:00,570 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2022-04-27 23:08:00,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 23:08:00,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-27 23:08:00,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 23:08:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 23:08:00,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 23:08:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 23:08:00,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-27 23:08:00,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:00,606 INFO L225 Difference]: With dead ends: 84 [2022-04-27 23:08:00,606 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 23:08:00,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:08:00,606 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:00,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:08:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 23:08:00,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-27 23:08:00,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:00,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 23:08:00,653 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 23:08:00,653 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 23:08:00,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:00,655 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-27 23:08:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-27 23:08:00,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:00,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:00,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-27 23:08:00,656 INFO L87 Difference]: Start difference. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-27 23:08:00,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:00,658 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-27 23:08:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-27 23:08:00,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:00,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:00,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:00,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:00,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 23:08:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2022-04-27 23:08:00,661 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 41 [2022-04-27 23:08:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:00,661 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2022-04-27 23:08:00,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 23:08:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-27 23:08:00,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 23:08:00,662 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:00,662 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:00,681 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:08:00,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:00,881 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:00,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:00,881 INFO L85 PathProgramCache]: Analyzing trace with hash 800232443, now seen corresponding path program 1 times [2022-04-27 23:08:00,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:00,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318812464] [2022-04-27 23:08:00,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:00,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:00,916 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:08:00,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265407511] [2022-04-27 23:08:00,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:00,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:00,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:00,919 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:08:00,920 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:08:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:00,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:08:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:00,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:08:01,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {2712#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:01,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {2712#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {2712#true} is VALID [2022-04-27 23:08:01,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {2712#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:01,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2712#true} {2712#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:01,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {2712#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:01,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {2712#true} [100] mainENTRY-->L30: 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_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {2712#true} is VALID [2022-04-27 23:08:01,159 INFO L272 TraceCheckUtils]: 6: Hoare triple {2712#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2712#true} is VALID [2022-04-27 23:08:01,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {2712#true} [104] assume_abort_if_notENTRY-->L12: 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] {2712#true} is VALID [2022-04-27 23:08:01,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {2712#true} [108] L12-->L12-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[] {2712#true} is VALID [2022-04-27 23:08:01,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {2712#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:01,160 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2712#true} {2712#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2712#true} is VALID [2022-04-27 23:08:01,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {2712#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {2712#true} is VALID [2022-04-27 23:08:01,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {2712#true} [106] L37-3-->L37-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] {2712#true} is VALID [2022-04-27 23:08:01,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {2712#true} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2712#true} is VALID [2022-04-27 23:08:01,160 INFO L272 TraceCheckUtils]: 14: Hoare triple {2712#true} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2712#true} is VALID [2022-04-27 23:08:01,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {2712#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2712#true} is VALID [2022-04-27 23:08:01,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {2712#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:01,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {2712#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:01,160 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2712#true} {2712#true} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2712#true} is VALID [2022-04-27 23:08:01,161 INFO L272 TraceCheckUtils]: 19: Hoare triple {2712#true} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2712#true} is VALID [2022-04-27 23:08:01,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {2712#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2712#true} is VALID [2022-04-27 23:08:01,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {2712#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:01,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {2712#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:01,161 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2712#true} {2712#true} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2712#true} is VALID [2022-04-27 23:08:01,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {2712#true} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2712#true} is VALID [2022-04-27 23:08:01,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {2712#true} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2712#true} is VALID [2022-04-27 23:08:01,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {2712#true} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 50) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2712#true} is VALID [2022-04-27 23:08:01,161 INFO L272 TraceCheckUtils]: 27: Hoare triple {2712#true} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2712#true} is VALID [2022-04-27 23:08:01,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {2712#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2801#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:08:01,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {2801#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2805#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:08:01,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {2805#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2805#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:08:01,175 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2805#(not (= |__VERIFIER_assert_#in~cond| 0))} {2712#true} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2812#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 23:08:01,175 INFO L272 TraceCheckUtils]: 32: Hoare triple {2812#(= main_~b~0 (* main_~a~0 main_~y~0))} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2712#true} is VALID [2022-04-27 23:08:01,175 INFO L290 TraceCheckUtils]: 33: Hoare triple {2712#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2712#true} is VALID [2022-04-27 23:08:01,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {2712#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:01,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {2712#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:01,177 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2712#true} {2812#(= main_~b~0 (* main_~a~0 main_~y~0))} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2812#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 23:08:01,177 INFO L272 TraceCheckUtils]: 37: Hoare triple {2812#(= main_~b~0 (* main_~a~0 main_~y~0))} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2712#true} is VALID [2022-04-27 23:08:01,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {2712#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2712#true} is VALID [2022-04-27 23:08:01,177 INFO L290 TraceCheckUtils]: 39: Hoare triple {2712#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:01,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {2712#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:01,178 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2712#true} {2812#(= main_~b~0 (* main_~a~0 main_~y~0))} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2812#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 23:08:01,179 INFO L290 TraceCheckUtils]: 42: Hoare triple {2812#(= main_~b~0 (* main_~a~0 main_~y~0))} [130] L49-->L54: Formula: (<= (* v_main_~b~0_7 2) v_main_~r~0_9) InVars {main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2846#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-27 23:08:01,180 INFO L272 TraceCheckUtils]: 43: Hoare triple {2846#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} [135] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {2850#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:08:01,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {2850#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2854#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:08:01,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {2854#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: 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[] {2713#false} is VALID [2022-04-27 23:08:01,181 INFO L290 TraceCheckUtils]: 46: Hoare triple {2713#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2713#false} is VALID [2022-04-27 23:08:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 23:08:01,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:08:05,608 INFO L290 TraceCheckUtils]: 46: Hoare triple {2713#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2713#false} is VALID [2022-04-27 23:08:05,609 INFO L290 TraceCheckUtils]: 45: Hoare triple {2854#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: 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[] {2713#false} is VALID [2022-04-27 23:08:05,609 INFO L290 TraceCheckUtils]: 44: Hoare triple {2850#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2854#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:08:05,610 INFO L272 TraceCheckUtils]: 43: Hoare triple {2846#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} [135] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {2850#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:08:05,610 INFO L290 TraceCheckUtils]: 42: Hoare triple {2873#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [130] L49-->L54: Formula: (<= (* v_main_~b~0_7 2) v_main_~r~0_9) InVars {main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2846#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-27 23:08:05,611 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2712#true} {2873#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2873#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-27 23:08:05,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {2712#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:05,611 INFO L290 TraceCheckUtils]: 39: Hoare triple {2712#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:05,611 INFO L290 TraceCheckUtils]: 38: Hoare triple {2712#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2712#true} is VALID [2022-04-27 23:08:05,611 INFO L272 TraceCheckUtils]: 37: Hoare triple {2873#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2712#true} is VALID [2022-04-27 23:08:05,612 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2712#true} {2873#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2873#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-27 23:08:05,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {2712#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:05,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {2712#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:05,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {2712#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2712#true} is VALID [2022-04-27 23:08:05,613 INFO L272 TraceCheckUtils]: 32: Hoare triple {2873#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2712#true} is VALID [2022-04-27 23:08:05,614 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2805#(not (= |__VERIFIER_assert_#in~cond| 0))} {2712#true} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2873#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-27 23:08:05,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {2805#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2805#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:08:05,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {2916#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2805#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:08:05,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {2712#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2916#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:08:05,615 INFO L272 TraceCheckUtils]: 27: Hoare triple {2712#true} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2712#true} is VALID [2022-04-27 23:08:05,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {2712#true} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 50) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2712#true} is VALID [2022-04-27 23:08:05,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {2712#true} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2712#true} is VALID [2022-04-27 23:08:05,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {2712#true} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2712#true} is VALID [2022-04-27 23:08:05,615 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2712#true} {2712#true} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2712#true} is VALID [2022-04-27 23:08:05,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {2712#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:05,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {2712#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:05,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {2712#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2712#true} is VALID [2022-04-27 23:08:05,616 INFO L272 TraceCheckUtils]: 19: Hoare triple {2712#true} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2712#true} is VALID [2022-04-27 23:08:05,616 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2712#true} {2712#true} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2712#true} is VALID [2022-04-27 23:08:05,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {2712#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:05,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {2712#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:05,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {2712#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2712#true} is VALID [2022-04-27 23:08:05,616 INFO L272 TraceCheckUtils]: 14: Hoare triple {2712#true} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2712#true} is VALID [2022-04-27 23:08:05,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {2712#true} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2712#true} is VALID [2022-04-27 23:08:05,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {2712#true} [106] L37-3-->L37-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] {2712#true} is VALID [2022-04-27 23:08:05,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {2712#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {2712#true} is VALID [2022-04-27 23:08:05,617 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2712#true} {2712#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2712#true} is VALID [2022-04-27 23:08:05,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {2712#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:05,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {2712#true} [108] L12-->L12-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[] {2712#true} is VALID [2022-04-27 23:08:05,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {2712#true} [104] assume_abort_if_notENTRY-->L12: 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] {2712#true} is VALID [2022-04-27 23:08:05,617 INFO L272 TraceCheckUtils]: 6: Hoare triple {2712#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2712#true} is VALID [2022-04-27 23:08:05,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {2712#true} [100] mainENTRY-->L30: 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_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {2712#true} is VALID [2022-04-27 23:08:05,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {2712#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:05,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2712#true} {2712#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:05,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {2712#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:05,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {2712#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {2712#true} is VALID [2022-04-27 23:08:05,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {2712#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#true} is VALID [2022-04-27 23:08:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 23:08:05,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:05,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318812464] [2022-04-27 23:08:05,618 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:08:05,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265407511] [2022-04-27 23:08:05,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265407511] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:08:05,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:08:05,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 23:08:05,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027646687] [2022-04-27 23:08:05,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:08:05,619 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 47 [2022-04-27 23:08:05,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:05,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 23:08:05,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:05,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 23:08:05,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:05,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 23:08:05,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 23:08:05,650 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 23:08:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:05,988 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2022-04-27 23:08:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 23:08:06,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 47 [2022-04-27 23:08:06,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:06,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 23:08:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 23:08:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 23:08:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 23:08:06,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-27 23:08:06,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:06,043 INFO L225 Difference]: With dead ends: 88 [2022-04-27 23:08:06,043 INFO L226 Difference]: Without dead ends: 86 [2022-04-27 23:08:06,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-27 23:08:06,043 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:06,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 133 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:08:06,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-27 23:08:06,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-27 23:08:06,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:06,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 23:08:06,076 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 23:08:06,076 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 23:08:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:06,079 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-27 23:08:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-27 23:08:06,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:06,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:06,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-27 23:08:06,080 INFO L87 Difference]: Start difference. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-27 23:08:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:06,082 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-27 23:08:06,082 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-27 23:08:06,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:06,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:06,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:06,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 23:08:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2022-04-27 23:08:06,084 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 47 [2022-04-27 23:08:06,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:06,085 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2022-04-27 23:08:06,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 23:08:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-27 23:08:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 23:08:06,086 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:06,086 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:06,110 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:08:06,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:06,287 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:06,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:06,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1984817020, now seen corresponding path program 1 times [2022-04-27 23:08:06,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:06,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756265456] [2022-04-27 23:08:06,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:06,297 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:08:06,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980517316] [2022-04-27 23:08:06,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:06,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:06,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:06,298 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:08:06,299 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:08:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:06,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:08:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:06,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:08:06,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {3435#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3435#true} is VALID [2022-04-27 23:08:06,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {3435#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {3443#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:06,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {3443#(<= ~counter~0 0)} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3443#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:06,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3443#(<= ~counter~0 0)} {3435#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3443#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:06,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {3443#(<= ~counter~0 0)} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3443#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:06,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {3443#(<= ~counter~0 0)} [100] mainENTRY-->L30: 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_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {3443#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:06,592 INFO L272 TraceCheckUtils]: 6: Hoare triple {3443#(<= ~counter~0 0)} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3443#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:06,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {3443#(<= ~counter~0 0)} [104] assume_abort_if_notENTRY-->L12: 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] {3443#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:06,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {3443#(<= ~counter~0 0)} [108] L12-->L12-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[] {3443#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:06,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {3443#(<= ~counter~0 0)} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3443#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:06,594 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3443#(<= ~counter~0 0)} {3443#(<= ~counter~0 0)} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3443#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:06,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {3443#(<= ~counter~0 0)} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {3443#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:06,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {3443#(<= ~counter~0 0)} [106] L37-3-->L37-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] {3477#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:06,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {3477#(<= ~counter~0 1)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3477#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:06,596 INFO L272 TraceCheckUtils]: 14: Hoare triple {3477#(<= ~counter~0 1)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3477#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:06,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {3477#(<= ~counter~0 1)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3477#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:06,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {3477#(<= ~counter~0 1)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3477#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:06,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {3477#(<= ~counter~0 1)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3477#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:06,598 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3477#(<= ~counter~0 1)} {3477#(<= ~counter~0 1)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3477#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:06,598 INFO L272 TraceCheckUtils]: 19: Hoare triple {3477#(<= ~counter~0 1)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3477#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:06,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {3477#(<= ~counter~0 1)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3477#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:06,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {3477#(<= ~counter~0 1)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3477#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:06,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {3477#(<= ~counter~0 1)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3477#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:06,599 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3477#(<= ~counter~0 1)} {3477#(<= ~counter~0 1)} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3477#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:06,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {3477#(<= ~counter~0 1)} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {3477#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:06,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {3477#(<= ~counter~0 1)} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {3517#(<= ~counter~0 2)} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 50) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,601 INFO L272 TraceCheckUtils]: 27: Hoare triple {3517#(<= ~counter~0 2)} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {3517#(<= ~counter~0 2)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {3517#(<= ~counter~0 2)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {3517#(<= ~counter~0 2)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,602 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3517#(<= ~counter~0 2)} {3517#(<= ~counter~0 2)} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,603 INFO L272 TraceCheckUtils]: 32: Hoare triple {3517#(<= ~counter~0 2)} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {3517#(<= ~counter~0 2)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {3517#(<= ~counter~0 2)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {3517#(<= ~counter~0 2)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,604 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3517#(<= ~counter~0 2)} {3517#(<= ~counter~0 2)} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,604 INFO L272 TraceCheckUtils]: 37: Hoare triple {3517#(<= ~counter~0 2)} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,605 INFO L290 TraceCheckUtils]: 38: Hoare triple {3517#(<= ~counter~0 2)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,605 INFO L290 TraceCheckUtils]: 39: Hoare triple {3517#(<= ~counter~0 2)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {3517#(<= ~counter~0 2)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,606 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3517#(<= ~counter~0 2)} {3517#(<= ~counter~0 2)} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {3517#(<= ~counter~0 2)} [129] L49-->L46-4: Formula: (not (<= (* v_main_~b~0_6 2) v_main_~r~0_8)) InVars {main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {3517#(<= ~counter~0 2)} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {3517#(<= ~counter~0 2)} is VALID [2022-04-27 23:08:06,607 INFO L290 TraceCheckUtils]: 44: Hoare triple {3517#(<= ~counter~0 2)} [106] L37-3-->L37-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] {3575#(<= |main_#t~post6| 2)} is VALID [2022-04-27 23:08:06,607 INFO L290 TraceCheckUtils]: 45: Hoare triple {3575#(<= |main_#t~post6| 2)} [110] L37-1-->L37-4: Formula: (not (< |v_main_#t~post6_3| 50)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3436#false} is VALID [2022-04-27 23:08:06,607 INFO L272 TraceCheckUtils]: 46: Hoare triple {3436#false} [109] L37-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3436#false} is VALID [2022-04-27 23:08:06,607 INFO L290 TraceCheckUtils]: 47: Hoare triple {3436#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3436#false} is VALID [2022-04-27 23:08:06,607 INFO L290 TraceCheckUtils]: 48: Hoare triple {3436#false} [117] L15-->L16: 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[] {3436#false} is VALID [2022-04-27 23:08:06,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {3436#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3436#false} is VALID [2022-04-27 23:08:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 23:08:06,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:08:06,835 INFO L290 TraceCheckUtils]: 49: Hoare triple {3436#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3436#false} is VALID [2022-04-27 23:08:06,836 INFO L290 TraceCheckUtils]: 48: Hoare triple {3436#false} [117] L15-->L16: 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[] {3436#false} is VALID [2022-04-27 23:08:06,836 INFO L290 TraceCheckUtils]: 47: Hoare triple {3436#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3436#false} is VALID [2022-04-27 23:08:06,836 INFO L272 TraceCheckUtils]: 46: Hoare triple {3436#false} [109] L37-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3436#false} is VALID [2022-04-27 23:08:06,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {3603#(< |main_#t~post6| 50)} [110] L37-1-->L37-4: Formula: (not (< |v_main_#t~post6_3| 50)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3436#false} is VALID [2022-04-27 23:08:06,844 INFO L290 TraceCheckUtils]: 44: Hoare triple {3607#(< ~counter~0 50)} [106] L37-3-->L37-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] {3603#(< |main_#t~post6| 50)} is VALID [2022-04-27 23:08:06,844 INFO L290 TraceCheckUtils]: 43: Hoare triple {3607#(< ~counter~0 50)} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {3607#(< ~counter~0 50)} is VALID [2022-04-27 23:08:06,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {3607#(< ~counter~0 50)} [129] L49-->L46-4: Formula: (not (<= (* v_main_~b~0_6 2) v_main_~r~0_8)) InVars {main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {3607#(< ~counter~0 50)} is VALID [2022-04-27 23:08:06,845 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3435#true} {3607#(< ~counter~0 50)} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {3607#(< ~counter~0 50)} is VALID [2022-04-27 23:08:06,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {3435#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3435#true} is VALID [2022-04-27 23:08:06,845 INFO L290 TraceCheckUtils]: 39: Hoare triple {3435#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3435#true} is VALID [2022-04-27 23:08:06,845 INFO L290 TraceCheckUtils]: 38: Hoare triple {3435#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3435#true} is VALID [2022-04-27 23:08:06,845 INFO L272 TraceCheckUtils]: 37: Hoare triple {3607#(< ~counter~0 50)} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {3435#true} is VALID [2022-04-27 23:08:06,849 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3435#true} {3607#(< ~counter~0 50)} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3607#(< ~counter~0 50)} is VALID [2022-04-27 23:08:06,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {3435#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3435#true} is VALID [2022-04-27 23:08:06,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {3435#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3435#true} is VALID [2022-04-27 23:08:06,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {3435#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3435#true} is VALID [2022-04-27 23:08:06,850 INFO L272 TraceCheckUtils]: 32: Hoare triple {3607#(< ~counter~0 50)} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3435#true} is VALID [2022-04-27 23:08:06,850 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3435#true} {3607#(< ~counter~0 50)} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3607#(< ~counter~0 50)} is VALID [2022-04-27 23:08:06,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {3435#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3435#true} is VALID [2022-04-27 23:08:06,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {3435#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3435#true} is VALID [2022-04-27 23:08:06,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {3435#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3435#true} is VALID [2022-04-27 23:08:06,851 INFO L272 TraceCheckUtils]: 27: Hoare triple {3607#(< ~counter~0 50)} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3435#true} is VALID [2022-04-27 23:08:06,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {3607#(< ~counter~0 50)} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 50) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3607#(< ~counter~0 50)} is VALID [2022-04-27 23:08:06,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {3665#(< ~counter~0 49)} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {3607#(< ~counter~0 50)} is VALID [2022-04-27 23:08:06,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {3665#(< ~counter~0 49)} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {3665#(< ~counter~0 49)} is VALID [2022-04-27 23:08:06,852 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3435#true} {3665#(< ~counter~0 49)} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3665#(< ~counter~0 49)} is VALID [2022-04-27 23:08:06,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {3435#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3435#true} is VALID [2022-04-27 23:08:06,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {3435#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3435#true} is VALID [2022-04-27 23:08:06,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {3435#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3435#true} is VALID [2022-04-27 23:08:06,853 INFO L272 TraceCheckUtils]: 19: Hoare triple {3665#(< ~counter~0 49)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3435#true} is VALID [2022-04-27 23:08:06,853 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3435#true} {3665#(< ~counter~0 49)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3665#(< ~counter~0 49)} is VALID [2022-04-27 23:08:06,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {3435#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3435#true} is VALID [2022-04-27 23:08:06,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {3435#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3435#true} is VALID [2022-04-27 23:08:06,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {3435#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3435#true} is VALID [2022-04-27 23:08:06,854 INFO L272 TraceCheckUtils]: 14: Hoare triple {3665#(< ~counter~0 49)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3435#true} is VALID [2022-04-27 23:08:06,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {3665#(< ~counter~0 49)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3665#(< ~counter~0 49)} is VALID [2022-04-27 23:08:06,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {3705#(< ~counter~0 48)} [106] L37-3-->L37-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] {3665#(< ~counter~0 49)} is VALID [2022-04-27 23:08:06,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {3705#(< ~counter~0 48)} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {3705#(< ~counter~0 48)} is VALID [2022-04-27 23:08:06,855 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3435#true} {3705#(< ~counter~0 48)} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3705#(< ~counter~0 48)} is VALID [2022-04-27 23:08:06,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {3435#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3435#true} is VALID [2022-04-27 23:08:06,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {3435#true} [108] L12-->L12-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[] {3435#true} is VALID [2022-04-27 23:08:06,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {3435#true} [104] assume_abort_if_notENTRY-->L12: 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] {3435#true} is VALID [2022-04-27 23:08:06,855 INFO L272 TraceCheckUtils]: 6: Hoare triple {3705#(< ~counter~0 48)} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3435#true} is VALID [2022-04-27 23:08:06,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {3705#(< ~counter~0 48)} [100] mainENTRY-->L30: 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_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {3705#(< ~counter~0 48)} is VALID [2022-04-27 23:08:06,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {3705#(< ~counter~0 48)} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3705#(< ~counter~0 48)} is VALID [2022-04-27 23:08:06,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3705#(< ~counter~0 48)} {3435#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3705#(< ~counter~0 48)} is VALID [2022-04-27 23:08:06,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {3705#(< ~counter~0 48)} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3705#(< ~counter~0 48)} is VALID [2022-04-27 23:08:06,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {3435#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {3705#(< ~counter~0 48)} is VALID [2022-04-27 23:08:06,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {3435#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3435#true} is VALID [2022-04-27 23:08:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 23:08:06,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:06,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756265456] [2022-04-27 23:08:06,862 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:08:06,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980517316] [2022-04-27 23:08:06,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980517316] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:08:06,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:08:06,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 23:08:06,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450460035] [2022-04-27 23:08:06,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:08:06,863 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 50 [2022-04-27 23:08:06,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:06,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 23:08:06,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:06,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 23:08:06,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:06,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 23:08:06,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 23:08:06,911 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 23:08:07,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:07,469 INFO L93 Difference]: Finished difference Result 257 states and 311 transitions. [2022-04-27 23:08:07,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 23:08:07,470 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 50 [2022-04-27 23:08:07,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 23:08:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 169 transitions. [2022-04-27 23:08:07,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 23:08:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 169 transitions. [2022-04-27 23:08:07,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 169 transitions. [2022-04-27 23:08:07,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:07,597 INFO L225 Difference]: With dead ends: 257 [2022-04-27 23:08:07,597 INFO L226 Difference]: Without dead ends: 250 [2022-04-27 23:08:07,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-04-27 23:08:07,598 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 96 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:07,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 233 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:08:07,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-04-27 23:08:07,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 239. [2022-04-27 23:08:07,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:07,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand has 239 states, 153 states have (on average 1.1895424836601307) internal successors, (182), 161 states have internal predecessors, (182), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 23:08:07,705 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand has 239 states, 153 states have (on average 1.1895424836601307) internal successors, (182), 161 states have internal predecessors, (182), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 23:08:07,706 INFO L87 Difference]: Start difference. First operand 250 states. Second operand has 239 states, 153 states have (on average 1.1895424836601307) internal successors, (182), 161 states have internal predecessors, (182), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 23:08:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:07,711 INFO L93 Difference]: Finished difference Result 250 states and 299 transitions. [2022-04-27 23:08:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 299 transitions. [2022-04-27 23:08:07,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:07,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:07,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 153 states have (on average 1.1895424836601307) internal successors, (182), 161 states have internal predecessors, (182), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) Second operand 250 states. [2022-04-27 23:08:07,712 INFO L87 Difference]: Start difference. First operand has 239 states, 153 states have (on average 1.1895424836601307) internal successors, (182), 161 states have internal predecessors, (182), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) Second operand 250 states. [2022-04-27 23:08:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:07,717 INFO L93 Difference]: Finished difference Result 250 states and 299 transitions. [2022-04-27 23:08:07,717 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 299 transitions. [2022-04-27 23:08:07,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:07,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:07,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:07,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 153 states have (on average 1.1895424836601307) internal successors, (182), 161 states have internal predecessors, (182), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 23:08:07,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 291 transitions. [2022-04-27 23:08:07,723 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 291 transitions. Word has length 50 [2022-04-27 23:08:07,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:07,723 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 291 transitions. [2022-04-27 23:08:07,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 23:08:07,723 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 291 transitions. [2022-04-27 23:08:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 23:08:07,724 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:07,724 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:07,743 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:08:07,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 23:08:07,944 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:07,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:07,944 INFO L85 PathProgramCache]: Analyzing trace with hash 960315114, now seen corresponding path program 1 times [2022-04-27 23:08:07,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:07,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344695627] [2022-04-27 23:08:07,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:07,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:07,953 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:08:07,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1051589192] [2022-04-27 23:08:07,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:07,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:07,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:07,954 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:08:07,955 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:08:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:07,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 23:08:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:08,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:08:08,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {4963#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4963#true} is VALID [2022-04-27 23:08:08,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {4963#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {4963#true} is VALID [2022-04-27 23:08:08,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {4963#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4963#true} is VALID [2022-04-27 23:08:08,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4963#true} {4963#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4963#true} is VALID [2022-04-27 23:08:08,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {4963#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4963#true} is VALID [2022-04-27 23:08:08,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {4963#true} [100] mainENTRY-->L30: 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_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {4963#true} is VALID [2022-04-27 23:08:08,435 INFO L272 TraceCheckUtils]: 6: Hoare triple {4963#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4963#true} is VALID [2022-04-27 23:08:08,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {4963#true} [104] assume_abort_if_notENTRY-->L12: 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] {4963#true} is VALID [2022-04-27 23:08:08,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {4963#true} [108] L12-->L12-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[] {4963#true} is VALID [2022-04-27 23:08:08,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {4963#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4963#true} is VALID [2022-04-27 23:08:08,436 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4963#true} {4963#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4963#true} is VALID [2022-04-27 23:08:08,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {4963#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {5001#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:08,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {5001#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [106] L37-3-->L37-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] {5001#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:08,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {5001#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5001#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:08,437 INFO L272 TraceCheckUtils]: 14: Hoare triple {5001#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {4963#true} is VALID [2022-04-27 23:08:08,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {4963#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4963#true} is VALID [2022-04-27 23:08:08,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {4963#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4963#true} is VALID [2022-04-27 23:08:08,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {4963#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4963#true} is VALID [2022-04-27 23:08:08,437 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4963#true} {5001#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {5001#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:08,438 INFO L272 TraceCheckUtils]: 19: Hoare triple {5001#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {4963#true} is VALID [2022-04-27 23:08:08,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {4963#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4963#true} is VALID [2022-04-27 23:08:08,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {4963#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4963#true} is VALID [2022-04-27 23:08:08,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {4963#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4963#true} is VALID [2022-04-27 23:08:08,438 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4963#true} {5001#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {5001#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:08,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {5001#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {5041#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:08,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {5041#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {5041#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:08,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {5041#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 50) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {5041#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:08,439 INFO L272 TraceCheckUtils]: 27: Hoare triple {5041#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {4963#true} is VALID [2022-04-27 23:08:08,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {4963#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4963#true} is VALID [2022-04-27 23:08:08,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {4963#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4963#true} is VALID [2022-04-27 23:08:08,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {4963#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4963#true} is VALID [2022-04-27 23:08:08,440 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4963#true} {5041#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {5041#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:08,440 INFO L272 TraceCheckUtils]: 32: Hoare triple {5041#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {4963#true} is VALID [2022-04-27 23:08:08,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {4963#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4963#true} is VALID [2022-04-27 23:08:08,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {4963#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4963#true} is VALID [2022-04-27 23:08:08,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {4963#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4963#true} is VALID [2022-04-27 23:08:08,441 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4963#true} {5041#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {5041#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:08,441 INFO L272 TraceCheckUtils]: 37: Hoare triple {5041#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {4963#true} is VALID [2022-04-27 23:08:08,441 INFO L290 TraceCheckUtils]: 38: Hoare triple {4963#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4963#true} is VALID [2022-04-27 23:08:08,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {4963#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4963#true} is VALID [2022-04-27 23:08:08,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {4963#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4963#true} is VALID [2022-04-27 23:08:08,442 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4963#true} {5041#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {5041#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:08,442 INFO L290 TraceCheckUtils]: 42: Hoare triple {5041#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [129] L49-->L46-4: Formula: (not (<= (* v_main_~b~0_6 2) v_main_~r~0_8)) InVars {main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {5096#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:08,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {5096#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {5100#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (not (<= (* main_~b~0 2) main_~x~0)) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-27 23:08:08,443 INFO L290 TraceCheckUtils]: 44: Hoare triple {5100#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (not (<= (* main_~b~0 2) main_~x~0)) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0) (<= main_~y~0 main_~x~0))} [106] L37-3-->L37-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] {5100#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (not (<= (* main_~b~0 2) main_~x~0)) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-27 23:08:08,444 INFO L290 TraceCheckUtils]: 45: Hoare triple {5100#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (not (<= (* main_~b~0 2) main_~x~0)) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0) (<= main_~y~0 main_~x~0))} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5100#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (not (<= (* main_~b~0 2) main_~x~0)) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-27 23:08:08,444 INFO L272 TraceCheckUtils]: 46: Hoare triple {5100#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (not (<= (* main_~b~0 2) main_~x~0)) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0) (<= main_~y~0 main_~x~0))} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {4963#true} is VALID [2022-04-27 23:08:08,444 INFO L290 TraceCheckUtils]: 47: Hoare triple {4963#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5113#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:08:08,444 INFO L290 TraceCheckUtils]: 48: Hoare triple {5113#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5117#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:08:08,445 INFO L290 TraceCheckUtils]: 49: Hoare triple {5117#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5117#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:08:08,445 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5117#(not (= |__VERIFIER_assert_#in~cond| 0))} {5100#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (not (<= (* main_~b~0 2) main_~x~0)) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0) (<= main_~y~0 main_~x~0))} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {5124#(and (< main_~x~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} is VALID [2022-04-27 23:08:08,446 INFO L272 TraceCheckUtils]: 51: Hoare triple {5124#(and (< main_~x~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {5128#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:08:08,446 INFO L290 TraceCheckUtils]: 52: Hoare triple {5128#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5132#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:08:08,446 INFO L290 TraceCheckUtils]: 53: Hoare triple {5132#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: 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[] {4964#false} is VALID [2022-04-27 23:08:08,447 INFO L290 TraceCheckUtils]: 54: Hoare triple {4964#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4964#false} is VALID [2022-04-27 23:08:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 23:08:08,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:09:00,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:09:00,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344695627] [2022-04-27 23:09:00,002 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:09:00,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051589192] [2022-04-27 23:09:00,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051589192] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 23:09:00,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 23:09:00,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 23:09:00,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896142398] [2022-04-27 23:09:00,002 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 23:09:00,003 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-27 23:09:00,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:09:00,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 23:09:00,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:00,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 23:09:00,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:09:00,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 23:09:00,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-27 23:09:00,034 INFO L87 Difference]: Start difference. First operand 239 states and 291 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 23:09:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:00,814 INFO L93 Difference]: Finished difference Result 318 states and 381 transitions. [2022-04-27 23:09:00,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 23:09:00,814 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-27 23:09:00,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:09:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 23:09:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2022-04-27 23:09:00,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 23:09:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2022-04-27 23:09:00,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 121 transitions. [2022-04-27 23:09:00,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:00,928 INFO L225 Difference]: With dead ends: 318 [2022-04-27 23:09:00,928 INFO L226 Difference]: Without dead ends: 203 [2022-04-27 23:09:00,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-27 23:09:00,929 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 24 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 23:09:00,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 183 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 23:09:00,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-27 23:09:01,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2022-04-27 23:09:01,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:09:01,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 202 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 136 states have internal predecessors, (152), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 23:09:01,015 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 202 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 136 states have internal predecessors, (152), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 23:09:01,015 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 202 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 136 states have internal predecessors, (152), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 23:09:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:01,019 INFO L93 Difference]: Finished difference Result 203 states and 241 transitions. [2022-04-27 23:09:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 241 transitions. [2022-04-27 23:09:01,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:01,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:01,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 202 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 136 states have internal predecessors, (152), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) Second operand 203 states. [2022-04-27 23:09:01,020 INFO L87 Difference]: Start difference. First operand has 202 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 136 states have internal predecessors, (152), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) Second operand 203 states. [2022-04-27 23:09:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:01,024 INFO L93 Difference]: Finished difference Result 203 states and 241 transitions. [2022-04-27 23:09:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 241 transitions. [2022-04-27 23:09:01,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:01,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:01,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:09:01,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:09:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 136 states have internal predecessors, (152), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 23:09:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 240 transitions. [2022-04-27 23:09:01,029 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 240 transitions. Word has length 55 [2022-04-27 23:09:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:09:01,029 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 240 transitions. [2022-04-27 23:09:01,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 23:09:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 240 transitions. [2022-04-27 23:09:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 23:09:01,030 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:09:01,030 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:09:01,047 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:09:01,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 23:09:01,239 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:09:01,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:09:01,240 INFO L85 PathProgramCache]: Analyzing trace with hash 136506131, now seen corresponding path program 1 times [2022-04-27 23:09:01,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:09:01,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279524448] [2022-04-27 23:09:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:01,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:09:01,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:09:01,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790440532] [2022-04-27 23:09:01,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:01,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:09:01,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:09:01,251 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:09:01,262 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:09:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:01,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:09:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:01,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:09:01,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {6391#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {6391#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {6399#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:01,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {6399#(<= ~counter~0 0)} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6399#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:01,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6399#(<= ~counter~0 0)} {6391#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6399#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:01,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {6399#(<= ~counter~0 0)} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6399#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:01,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {6399#(<= ~counter~0 0)} [100] mainENTRY-->L30: 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_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {6399#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:01,563 INFO L272 TraceCheckUtils]: 6: Hoare triple {6399#(<= ~counter~0 0)} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6399#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:01,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {6399#(<= ~counter~0 0)} [104] assume_abort_if_notENTRY-->L12: 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] {6399#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:01,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {6399#(<= ~counter~0 0)} [108] L12-->L12-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[] {6399#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:01,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {6399#(<= ~counter~0 0)} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6399#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:01,564 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6399#(<= ~counter~0 0)} {6399#(<= ~counter~0 0)} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6399#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:01,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {6399#(<= ~counter~0 0)} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {6399#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:01,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {6399#(<= ~counter~0 0)} [106] L37-3-->L37-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] {6433#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:01,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {6433#(<= ~counter~0 1)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6433#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:01,566 INFO L272 TraceCheckUtils]: 14: Hoare triple {6433#(<= ~counter~0 1)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6433#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:01,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {6433#(<= ~counter~0 1)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6433#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:01,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {6433#(<= ~counter~0 1)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6433#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:01,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {6433#(<= ~counter~0 1)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6433#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:01,567 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6433#(<= ~counter~0 1)} {6433#(<= ~counter~0 1)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6433#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:01,568 INFO L272 TraceCheckUtils]: 19: Hoare triple {6433#(<= ~counter~0 1)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6433#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:01,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {6433#(<= ~counter~0 1)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6433#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:01,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {6433#(<= ~counter~0 1)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6433#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:01,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {6433#(<= ~counter~0 1)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6433#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:01,569 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6433#(<= ~counter~0 1)} {6433#(<= ~counter~0 1)} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6433#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:01,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {6433#(<= ~counter~0 1)} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {6433#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:01,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {6433#(<= ~counter~0 1)} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {6473#(<= ~counter~0 2)} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 50) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,571 INFO L272 TraceCheckUtils]: 27: Hoare triple {6473#(<= ~counter~0 2)} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {6473#(<= ~counter~0 2)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {6473#(<= ~counter~0 2)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {6473#(<= ~counter~0 2)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,577 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6473#(<= ~counter~0 2)} {6473#(<= ~counter~0 2)} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,577 INFO L272 TraceCheckUtils]: 32: Hoare triple {6473#(<= ~counter~0 2)} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {6473#(<= ~counter~0 2)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {6473#(<= ~counter~0 2)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {6473#(<= ~counter~0 2)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,579 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6473#(<= ~counter~0 2)} {6473#(<= ~counter~0 2)} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,579 INFO L272 TraceCheckUtils]: 37: Hoare triple {6473#(<= ~counter~0 2)} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,579 INFO L290 TraceCheckUtils]: 38: Hoare triple {6473#(<= ~counter~0 2)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,580 INFO L290 TraceCheckUtils]: 39: Hoare triple {6473#(<= ~counter~0 2)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,580 INFO L290 TraceCheckUtils]: 40: Hoare triple {6473#(<= ~counter~0 2)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,580 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6473#(<= ~counter~0 2)} {6473#(<= ~counter~0 2)} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,580 INFO L290 TraceCheckUtils]: 42: Hoare triple {6473#(<= ~counter~0 2)} [130] L49-->L54: Formula: (<= (* v_main_~b~0_7 2) v_main_~r~0_9) InVars {main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,581 INFO L272 TraceCheckUtils]: 43: Hoare triple {6473#(<= ~counter~0 2)} [135] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,581 INFO L290 TraceCheckUtils]: 44: Hoare triple {6473#(<= ~counter~0 2)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,581 INFO L290 TraceCheckUtils]: 45: Hoare triple {6473#(<= ~counter~0 2)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,582 INFO L290 TraceCheckUtils]: 46: Hoare triple {6473#(<= ~counter~0 2)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,582 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6473#(<= ~counter~0 2)} {6473#(<= ~counter~0 2)} [145] __VERIFIER_assertEXIT-->L54-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,582 INFO L290 TraceCheckUtils]: 48: Hoare triple {6473#(<= ~counter~0 2)} [131] L54-1-->L46-3: Formula: (and (= v_main_~a~0_7 (* v_main_~a~0_8 2)) (= v_main_~b~0_8 (* v_main_~b~0_9 2))) InVars {main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {6473#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:01,583 INFO L290 TraceCheckUtils]: 49: Hoare triple {6473#(<= ~counter~0 2)} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {6546#(<= |main_#t~post7| 2)} is VALID [2022-04-27 23:09:01,583 INFO L290 TraceCheckUtils]: 50: Hoare triple {6546#(<= |main_#t~post7| 2)} [133] L46-1-->L46-4: Formula: (not (< |v_main_#t~post7_3| 50)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6392#false} is VALID [2022-04-27 23:09:01,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {6392#false} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {6392#false} is VALID [2022-04-27 23:09:01,584 INFO L290 TraceCheckUtils]: 52: Hoare triple {6392#false} [106] L37-3-->L37-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] {6392#false} is VALID [2022-04-27 23:09:01,584 INFO L290 TraceCheckUtils]: 53: Hoare triple {6392#false} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6392#false} is VALID [2022-04-27 23:09:01,584 INFO L272 TraceCheckUtils]: 54: Hoare triple {6392#false} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6392#false} is VALID [2022-04-27 23:09:01,584 INFO L290 TraceCheckUtils]: 55: Hoare triple {6392#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6392#false} is VALID [2022-04-27 23:09:01,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {6392#false} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6392#false} is VALID [2022-04-27 23:09:01,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {6392#false} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6392#false} is VALID [2022-04-27 23:09:01,584 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6392#false} {6392#false} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6392#false} is VALID [2022-04-27 23:09:01,584 INFO L272 TraceCheckUtils]: 59: Hoare triple {6392#false} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6392#false} is VALID [2022-04-27 23:09:01,584 INFO L290 TraceCheckUtils]: 60: Hoare triple {6392#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6392#false} is VALID [2022-04-27 23:09:01,584 INFO L290 TraceCheckUtils]: 61: Hoare triple {6392#false} [117] L15-->L16: 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[] {6392#false} is VALID [2022-04-27 23:09:01,584 INFO L290 TraceCheckUtils]: 62: Hoare triple {6392#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6392#false} is VALID [2022-04-27 23:09:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 40 proven. 34 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 23:09:01,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:09:01,838 INFO L290 TraceCheckUtils]: 62: Hoare triple {6392#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6392#false} is VALID [2022-04-27 23:09:01,839 INFO L290 TraceCheckUtils]: 61: Hoare triple {6392#false} [117] L15-->L16: 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[] {6392#false} is VALID [2022-04-27 23:09:01,839 INFO L290 TraceCheckUtils]: 60: Hoare triple {6392#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6392#false} is VALID [2022-04-27 23:09:01,839 INFO L272 TraceCheckUtils]: 59: Hoare triple {6392#false} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6392#false} is VALID [2022-04-27 23:09:01,839 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6391#true} {6392#false} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6392#false} is VALID [2022-04-27 23:09:01,839 INFO L290 TraceCheckUtils]: 57: Hoare triple {6391#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {6391#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,839 INFO L290 TraceCheckUtils]: 55: Hoare triple {6391#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6391#true} is VALID [2022-04-27 23:09:01,839 INFO L272 TraceCheckUtils]: 54: Hoare triple {6392#false} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6391#true} is VALID [2022-04-27 23:09:01,840 INFO L290 TraceCheckUtils]: 53: Hoare triple {6392#false} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6392#false} is VALID [2022-04-27 23:09:01,840 INFO L290 TraceCheckUtils]: 52: Hoare triple {6392#false} [106] L37-3-->L37-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] {6392#false} is VALID [2022-04-27 23:09:01,840 INFO L290 TraceCheckUtils]: 51: Hoare triple {6392#false} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {6392#false} is VALID [2022-04-27 23:09:01,846 INFO L290 TraceCheckUtils]: 50: Hoare triple {6622#(< |main_#t~post7| 50)} [133] L46-1-->L46-4: Formula: (not (< |v_main_#t~post7_3| 50)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6392#false} is VALID [2022-04-27 23:09:01,846 INFO L290 TraceCheckUtils]: 49: Hoare triple {6626#(< ~counter~0 50)} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {6622#(< |main_#t~post7| 50)} is VALID [2022-04-27 23:09:01,846 INFO L290 TraceCheckUtils]: 48: Hoare triple {6626#(< ~counter~0 50)} [131] L54-1-->L46-3: Formula: (and (= v_main_~a~0_7 (* v_main_~a~0_8 2)) (= v_main_~b~0_8 (* v_main_~b~0_9 2))) InVars {main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {6626#(< ~counter~0 50)} is VALID [2022-04-27 23:09:01,847 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6391#true} {6626#(< ~counter~0 50)} [145] __VERIFIER_assertEXIT-->L54-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {6626#(< ~counter~0 50)} is VALID [2022-04-27 23:09:01,847 INFO L290 TraceCheckUtils]: 46: Hoare triple {6391#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {6391#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,847 INFO L290 TraceCheckUtils]: 44: Hoare triple {6391#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6391#true} is VALID [2022-04-27 23:09:01,847 INFO L272 TraceCheckUtils]: 43: Hoare triple {6626#(< ~counter~0 50)} [135] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {6391#true} is VALID [2022-04-27 23:09:01,848 INFO L290 TraceCheckUtils]: 42: Hoare triple {6626#(< ~counter~0 50)} [130] L49-->L54: Formula: (<= (* v_main_~b~0_7 2) v_main_~r~0_9) InVars {main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {6626#(< ~counter~0 50)} is VALID [2022-04-27 23:09:01,848 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6391#true} {6626#(< ~counter~0 50)} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {6626#(< ~counter~0 50)} is VALID [2022-04-27 23:09:01,848 INFO L290 TraceCheckUtils]: 40: Hoare triple {6391#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,848 INFO L290 TraceCheckUtils]: 39: Hoare triple {6391#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,848 INFO L290 TraceCheckUtils]: 38: Hoare triple {6391#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6391#true} is VALID [2022-04-27 23:09:01,848 INFO L272 TraceCheckUtils]: 37: Hoare triple {6626#(< ~counter~0 50)} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {6391#true} is VALID [2022-04-27 23:09:01,849 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6391#true} {6626#(< ~counter~0 50)} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6626#(< ~counter~0 50)} is VALID [2022-04-27 23:09:01,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {6391#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {6391#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {6391#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6391#true} is VALID [2022-04-27 23:09:01,849 INFO L272 TraceCheckUtils]: 32: Hoare triple {6626#(< ~counter~0 50)} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6391#true} is VALID [2022-04-27 23:09:01,850 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6391#true} {6626#(< ~counter~0 50)} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6626#(< ~counter~0 50)} is VALID [2022-04-27 23:09:01,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {6391#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {6391#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {6391#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6391#true} is VALID [2022-04-27 23:09:01,850 INFO L272 TraceCheckUtils]: 27: Hoare triple {6626#(< ~counter~0 50)} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6391#true} is VALID [2022-04-27 23:09:01,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {6626#(< ~counter~0 50)} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 50) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6626#(< ~counter~0 50)} is VALID [2022-04-27 23:09:01,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {6699#(< ~counter~0 49)} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {6626#(< ~counter~0 50)} is VALID [2022-04-27 23:09:01,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {6699#(< ~counter~0 49)} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {6699#(< ~counter~0 49)} is VALID [2022-04-27 23:09:01,852 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6391#true} {6699#(< ~counter~0 49)} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6699#(< ~counter~0 49)} is VALID [2022-04-27 23:09:01,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {6391#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {6391#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {6391#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6391#true} is VALID [2022-04-27 23:09:01,852 INFO L272 TraceCheckUtils]: 19: Hoare triple {6699#(< ~counter~0 49)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6391#true} is VALID [2022-04-27 23:09:01,852 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6391#true} {6699#(< ~counter~0 49)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6699#(< ~counter~0 49)} is VALID [2022-04-27 23:09:01,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {6391#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {6391#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {6391#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6391#true} is VALID [2022-04-27 23:09:01,853 INFO L272 TraceCheckUtils]: 14: Hoare triple {6699#(< ~counter~0 49)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6391#true} is VALID [2022-04-27 23:09:01,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {6699#(< ~counter~0 49)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6699#(< ~counter~0 49)} is VALID [2022-04-27 23:09:01,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {6739#(< ~counter~0 48)} [106] L37-3-->L37-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] {6699#(< ~counter~0 49)} is VALID [2022-04-27 23:09:01,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {6739#(< ~counter~0 48)} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {6739#(< ~counter~0 48)} is VALID [2022-04-27 23:09:01,854 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6391#true} {6739#(< ~counter~0 48)} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6739#(< ~counter~0 48)} is VALID [2022-04-27 23:09:01,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {6391#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {6391#true} [108] L12-->L12-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[] {6391#true} is VALID [2022-04-27 23:09:01,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {6391#true} [104] assume_abort_if_notENTRY-->L12: 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] {6391#true} is VALID [2022-04-27 23:09:01,855 INFO L272 TraceCheckUtils]: 6: Hoare triple {6739#(< ~counter~0 48)} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6391#true} is VALID [2022-04-27 23:09:01,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {6739#(< ~counter~0 48)} [100] mainENTRY-->L30: 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_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {6739#(< ~counter~0 48)} is VALID [2022-04-27 23:09:01,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {6739#(< ~counter~0 48)} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6739#(< ~counter~0 48)} is VALID [2022-04-27 23:09:01,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6739#(< ~counter~0 48)} {6391#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6739#(< ~counter~0 48)} is VALID [2022-04-27 23:09:01,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {6739#(< ~counter~0 48)} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6739#(< ~counter~0 48)} is VALID [2022-04-27 23:09:01,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {6391#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {6739#(< ~counter~0 48)} is VALID [2022-04-27 23:09:01,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {6391#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6391#true} is VALID [2022-04-27 23:09:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 23:09:01,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:09:01,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279524448] [2022-04-27 23:09:01,857 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:09:01,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790440532] [2022-04-27 23:09:01,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790440532] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:09:01,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:09:01,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 23:09:01,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739637563] [2022-04-27 23:09:01,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:09:01,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) Word has length 63 [2022-04-27 23:09:01,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:09:01,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-27 23:09:01,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:01,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 23:09:01,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:09:01,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 23:09:01,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 23:09:01,932 INFO L87 Difference]: Start difference. First operand 202 states and 240 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-27 23:09:02,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:02,450 INFO L93 Difference]: Finished difference Result 308 states and 368 transitions. [2022-04-27 23:09:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 23:09:02,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) Word has length 63 [2022-04-27 23:09:02,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:09:02,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-27 23:09:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2022-04-27 23:09:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-27 23:09:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2022-04-27 23:09:02,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 177 transitions. [2022-04-27 23:09:02,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:02,578 INFO L225 Difference]: With dead ends: 308 [2022-04-27 23:09:02,579 INFO L226 Difference]: Without dead ends: 214 [2022-04-27 23:09:02,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 23:09:02,580 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 85 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:09:02,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 280 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:09:02,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-04-27 23:09:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2022-04-27 23:09:02,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:09:02,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 210 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 142 states have internal predecessors, (156), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 23:09:02,671 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 210 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 142 states have internal predecessors, (156), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 23:09:02,672 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 210 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 142 states have internal predecessors, (156), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 23:09:02,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:02,676 INFO L93 Difference]: Finished difference Result 214 states and 246 transitions. [2022-04-27 23:09:02,676 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 246 transitions. [2022-04-27 23:09:02,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:02,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:02,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 210 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 142 states have internal predecessors, (156), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) Second operand 214 states. [2022-04-27 23:09:02,677 INFO L87 Difference]: Start difference. First operand has 210 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 142 states have internal predecessors, (156), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) Second operand 214 states. [2022-04-27 23:09:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:02,681 INFO L93 Difference]: Finished difference Result 214 states and 246 transitions. [2022-04-27 23:09:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 246 transitions. [2022-04-27 23:09:02,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:02,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:02,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:09:02,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:09:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 142 states have internal predecessors, (156), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 23:09:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 244 transitions. [2022-04-27 23:09:02,686 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 244 transitions. Word has length 63 [2022-04-27 23:09:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:09:02,687 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 244 transitions. [2022-04-27 23:09:02,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-27 23:09:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 244 transitions. [2022-04-27 23:09:02,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-27 23:09:02,688 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:09:02,688 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:09:02,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 23:09:02,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 23:09:02,905 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:09:02,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:09:02,906 INFO L85 PathProgramCache]: Analyzing trace with hash -286098381, now seen corresponding path program 1 times [2022-04-27 23:09:02,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:09:02,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734883343] [2022-04-27 23:09:02,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:02,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:09:02,917 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:09:02,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [919158484] [2022-04-27 23:09:02,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:02,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:09:02,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:09:02,918 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:09:02,919 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:09:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:02,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 23:09:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:02,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:09:03,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {7952#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {7952#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {7952#true} is VALID [2022-04-27 23:09:03,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {7952#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7952#true} {7952#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {7952#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {7952#true} [100] mainENTRY-->L30: 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_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {7952#true} is VALID [2022-04-27 23:09:03,380 INFO L272 TraceCheckUtils]: 6: Hoare triple {7952#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {7952#true} is VALID [2022-04-27 23:09:03,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {7952#true} [104] assume_abort_if_notENTRY-->L12: 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] {7952#true} is VALID [2022-04-27 23:09:03,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {7952#true} [108] L12-->L12-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[] {7952#true} is VALID [2022-04-27 23:09:03,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {7952#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,390 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7952#true} {7952#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {7952#true} is VALID [2022-04-27 23:09:03,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {7952#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {7990#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:09:03,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {7990#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [106] L37-3-->L37-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] {7990#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:09:03,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {7990#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {7990#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:09:03,392 INFO L272 TraceCheckUtils]: 14: Hoare triple {7990#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {7952#true} is VALID [2022-04-27 23:09:03,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,392 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7952#true} {7990#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {7990#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:09:03,392 INFO L272 TraceCheckUtils]: 19: Hoare triple {7990#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {7952#true} is VALID [2022-04-27 23:09:03,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,393 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7952#true} {7990#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {7990#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:09:03,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {7990#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:09:03,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:09:03,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 50) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:09:03,394 INFO L272 TraceCheckUtils]: 27: Hoare triple {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {7952#true} is VALID [2022-04-27 23:09:03,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,395 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7952#true} {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:09:03,395 INFO L272 TraceCheckUtils]: 32: Hoare triple {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {7952#true} is VALID [2022-04-27 23:09:03,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,396 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7952#true} {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:09:03,396 INFO L272 TraceCheckUtils]: 37: Hoare triple {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {7952#true} is VALID [2022-04-27 23:09:03,396 INFO L290 TraceCheckUtils]: 38: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,396 INFO L290 TraceCheckUtils]: 39: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,396 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7952#true} {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:09:03,397 INFO L290 TraceCheckUtils]: 42: Hoare triple {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [130] L49-->L54: Formula: (<= (* v_main_~b~0_7 2) v_main_~r~0_9) InVars {main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:09:03,397 INFO L272 TraceCheckUtils]: 43: Hoare triple {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [135] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {7952#true} is VALID [2022-04-27 23:09:03,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,398 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7952#true} {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [145] __VERIFIER_assertEXIT-->L54-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:09:03,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {8030#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [131] L54-1-->L46-3: Formula: (and (= v_main_~a~0_7 (* v_main_~a~0_8 2)) (= v_main_~b~0_8 (* v_main_~b~0_9 2))) InVars {main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 23:09:03,398 INFO L290 TraceCheckUtils]: 49: Hoare triple {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 23:09:03,399 INFO L290 TraceCheckUtils]: 50: Hoare triple {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 50) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 23:09:03,399 INFO L272 TraceCheckUtils]: 51: Hoare triple {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {7952#true} is VALID [2022-04-27 23:09:03,399 INFO L290 TraceCheckUtils]: 52: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,400 INFO L290 TraceCheckUtils]: 53: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,400 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7952#true} {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 23:09:03,400 INFO L272 TraceCheckUtils]: 56: Hoare triple {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {7952#true} is VALID [2022-04-27 23:09:03,400 INFO L290 TraceCheckUtils]: 57: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,400 INFO L290 TraceCheckUtils]: 58: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,400 INFO L290 TraceCheckUtils]: 59: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,401 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7952#true} {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 23:09:03,401 INFO L272 TraceCheckUtils]: 61: Hoare triple {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {7952#true} is VALID [2022-04-27 23:09:03,401 INFO L290 TraceCheckUtils]: 62: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,401 INFO L290 TraceCheckUtils]: 63: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,401 INFO L290 TraceCheckUtils]: 64: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,402 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {7952#true} {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 23:09:03,407 INFO L290 TraceCheckUtils]: 66: Hoare triple {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [129] L49-->L46-4: Formula: (not (<= (* v_main_~b~0_6 2) v_main_~r~0_8)) InVars {main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 23:09:03,407 INFO L290 TraceCheckUtils]: 67: Hoare triple {8103#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {8161#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-27 23:09:03,408 INFO L290 TraceCheckUtils]: 68: Hoare triple {8161#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [106] L37-3-->L37-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] {8161#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-27 23:09:03,408 INFO L290 TraceCheckUtils]: 69: Hoare triple {8161#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {8161#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-27 23:09:03,408 INFO L272 TraceCheckUtils]: 70: Hoare triple {8161#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {7952#true} is VALID [2022-04-27 23:09:03,409 INFO L290 TraceCheckUtils]: 71: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,409 INFO L290 TraceCheckUtils]: 72: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,409 INFO L290 TraceCheckUtils]: 73: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,409 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {7952#true} {8161#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {8161#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-27 23:09:03,410 INFO L272 TraceCheckUtils]: 75: Hoare triple {8161#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {8186#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:09:03,418 INFO L290 TraceCheckUtils]: 76: Hoare triple {8186#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {8190#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:09:03,419 INFO L290 TraceCheckUtils]: 77: Hoare triple {8190#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: 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[] {7953#false} is VALID [2022-04-27 23:09:03,419 INFO L290 TraceCheckUtils]: 78: Hoare triple {7953#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7953#false} is VALID [2022-04-27 23:09:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 23:09:03,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:09:03,731 INFO L290 TraceCheckUtils]: 78: Hoare triple {7953#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7953#false} is VALID [2022-04-27 23:09:03,731 INFO L290 TraceCheckUtils]: 77: Hoare triple {8190#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: 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[] {7953#false} is VALID [2022-04-27 23:09:03,732 INFO L290 TraceCheckUtils]: 76: Hoare triple {8186#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {8190#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:09:03,732 INFO L272 TraceCheckUtils]: 75: Hoare triple {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {8186#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:09:03,733 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {7952#true} {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,733 INFO L290 TraceCheckUtils]: 73: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,733 INFO L290 TraceCheckUtils]: 72: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,733 INFO L290 TraceCheckUtils]: 71: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,733 INFO L272 TraceCheckUtils]: 70: Hoare triple {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {7952#true} is VALID [2022-04-27 23:09:03,733 INFO L290 TraceCheckUtils]: 69: Hoare triple {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,734 INFO L290 TraceCheckUtils]: 68: Hoare triple {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [106] L37-3-->L37-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] {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,741 INFO L290 TraceCheckUtils]: 67: Hoare triple {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,741 INFO L290 TraceCheckUtils]: 66: Hoare triple {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [129] L49-->L46-4: Formula: (not (<= (* v_main_~b~0_6 2) v_main_~r~0_8)) InVars {main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 23:09:03,742 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {7952#true} {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 23:09:03,742 INFO L290 TraceCheckUtils]: 64: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,742 INFO L290 TraceCheckUtils]: 63: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,742 INFO L290 TraceCheckUtils]: 62: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,742 INFO L272 TraceCheckUtils]: 61: Hoare triple {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {7952#true} is VALID [2022-04-27 23:09:03,743 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7952#true} {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 23:09:03,743 INFO L290 TraceCheckUtils]: 59: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,743 INFO L272 TraceCheckUtils]: 56: Hoare triple {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {7952#true} is VALID [2022-04-27 23:09:03,743 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7952#true} {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 23:09:03,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,744 INFO L290 TraceCheckUtils]: 53: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,744 INFO L290 TraceCheckUtils]: 52: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,744 INFO L272 TraceCheckUtils]: 51: Hoare triple {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {7952#true} is VALID [2022-04-27 23:09:03,744 INFO L290 TraceCheckUtils]: 50: Hoare triple {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 50) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 23:09:03,751 INFO L290 TraceCheckUtils]: 49: Hoare triple {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 23:09:03,754 INFO L290 TraceCheckUtils]: 48: Hoare triple {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [131] L54-1-->L46-3: Formula: (and (= v_main_~a~0_7 (* v_main_~a~0_8 2)) (= v_main_~b~0_8 (* v_main_~b~0_9 2))) InVars {main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {8231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 23:09:03,755 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7952#true} {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [145] __VERIFIER_assertEXIT-->L54-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,755 INFO L290 TraceCheckUtils]: 46: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,755 INFO L290 TraceCheckUtils]: 45: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,755 INFO L272 TraceCheckUtils]: 43: Hoare triple {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [135] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {7952#true} is VALID [2022-04-27 23:09:03,756 INFO L290 TraceCheckUtils]: 42: Hoare triple {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [130] L49-->L54: Formula: (<= (* v_main_~b~0_7 2) v_main_~r~0_9) InVars {main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,756 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7952#true} {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,757 INFO L272 TraceCheckUtils]: 37: Hoare triple {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {7952#true} is VALID [2022-04-27 23:09:03,757 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7952#true} {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,757 INFO L272 TraceCheckUtils]: 32: Hoare triple {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {7952#true} is VALID [2022-04-27 23:09:03,758 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7952#true} {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,758 INFO L272 TraceCheckUtils]: 27: Hoare triple {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {7952#true} is VALID [2022-04-27 23:09:03,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 50) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {8289#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,760 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7952#true} {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,761 INFO L272 TraceCheckUtils]: 19: Hoare triple {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {7952#true} is VALID [2022-04-27 23:09:03,761 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7952#true} {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {7952#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {7952#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {7952#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7952#true} is VALID [2022-04-27 23:09:03,761 INFO L272 TraceCheckUtils]: 14: Hoare triple {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {7952#true} is VALID [2022-04-27 23:09:03,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [106] L37-3-->L37-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] {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {7952#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {8206#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:09:03,763 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7952#true} {7952#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {7952#true} is VALID [2022-04-27 23:09:03,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {7952#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {7952#true} [108] L12-->L12-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[] {7952#true} is VALID [2022-04-27 23:09:03,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {7952#true} [104] assume_abort_if_notENTRY-->L12: 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] {7952#true} is VALID [2022-04-27 23:09:03,763 INFO L272 TraceCheckUtils]: 6: Hoare triple {7952#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {7952#true} is VALID [2022-04-27 23:09:03,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {7952#true} [100] mainENTRY-->L30: 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_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {7952#true} is VALID [2022-04-27 23:09:03,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {7952#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7952#true} {7952#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {7952#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {7952#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {7952#true} is VALID [2022-04-27 23:09:03,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {7952#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7952#true} is VALID [2022-04-27 23:09:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-27 23:09:03,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:09:03,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734883343] [2022-04-27 23:09:03,764 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:09:03,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919158484] [2022-04-27 23:09:03,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919158484] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:09:03,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:09:03,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-04-27 23:09:03,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025616785] [2022-04-27 23:09:03,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:09:03,765 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 8 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) Word has length 79 [2022-04-27 23:09:03,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:09:03,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 8 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-27 23:09:03,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:03,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 23:09:03,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:09:03,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 23:09:03,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:09:03,842 INFO L87 Difference]: Start difference. First operand 210 states and 244 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 8 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-27 23:09:05,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:05,237 INFO L93 Difference]: Finished difference Result 236 states and 272 transitions. [2022-04-27 23:09:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 23:09:05,237 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 8 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) Word has length 79 [2022-04-27 23:09:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:09:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 8 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-27 23:09:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2022-04-27 23:09:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 8 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-27 23:09:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2022-04-27 23:09:05,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 117 transitions. [2022-04-27 23:09:05,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:05,380 INFO L225 Difference]: With dead ends: 236 [2022-04-27 23:09:05,380 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 23:09:05,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-04-27 23:09:05,381 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 59 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 23:09:05,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 206 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 23:09:05,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 23:09:05,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 23:09:05,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:09:05,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 23:09:05,382 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 23:09:05,382 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 23:09:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:05,382 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 23:09:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 23:09:05,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:05,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:05,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 23:09:05,383 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 23:09:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:05,383 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 23:09:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 23:09:05,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:05,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:05,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:09:05,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:09:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 23:09:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 23:09:05,383 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2022-04-27 23:09:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:09:05,383 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 23:09:05,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 8 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-27 23:09:05,384 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 23:09:05,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:05,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 23:09:05,405 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:09:05,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 23:09:05,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 23:09:06,407 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 23:09:06,407 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 23:09:06,407 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 23:09:06,407 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 23:09:06,407 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-27 23:09:06,407 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 23:09:06,407 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 23:09:06,407 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-27 23:09:06,407 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-27 23:09:06,407 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-27 23:09:06,407 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-27 23:09:06,407 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 23 65) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-27 23:09:06,407 INFO L895 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-27 23:09:06,408 INFO L899 garLoopResultBuilder]: For program point L30-1(line 30) no Hoare annotation was computed. [2022-04-27 23:09:06,408 INFO L895 garLoopResultBuilder]: At program point L37-3(lines 37 61) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0)))) [2022-04-27 23:09:06,408 INFO L895 garLoopResultBuilder]: At program point L37-4(lines 37 61) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0)) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0)))) [2022-04-27 23:09:06,408 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 37 61) no Hoare annotation was computed. [2022-04-27 23:09:06,408 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2022-04-27 23:09:06,408 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0)))) [2022-04-27 23:09:06,408 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 23 65) no Hoare annotation was computed. [2022-04-27 23:09:06,408 INFO L895 garLoopResultBuilder]: At program point L38-1(line 38) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0)))) [2022-04-27 23:09:06,408 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 23 65) no Hoare annotation was computed. [2022-04-27 23:09:06,408 INFO L899 garLoopResultBuilder]: For program point L39(lines 37 61) no Hoare annotation was computed. [2022-04-27 23:09:06,408 INFO L895 garLoopResultBuilder]: At program point L46-3(lines 46 58) the Hoare annotation is: (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) (not (<= |old(~counter~0)| 0))) [2022-04-27 23:09:06,408 INFO L895 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) (not (<= |old(~counter~0)| 0))) [2022-04-27 23:09:06,408 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) (not (<= |old(~counter~0)| 0))) [2022-04-27 23:09:06,408 INFO L899 garLoopResultBuilder]: For program point L49(lines 46 58) no Hoare annotation was computed. [2022-04-27 23:09:06,408 INFO L899 garLoopResultBuilder]: For program point L54-1(line 54) no Hoare annotation was computed. [2022-04-27 23:09:06,408 INFO L899 garLoopResultBuilder]: For program point L46-4(lines 46 58) no Hoare annotation was computed. [2022-04-27 23:09:06,408 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 46 58) no Hoare annotation was computed. [2022-04-27 23:09:06,409 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (or (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= (* 2 .cse0) main_~r~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 .cse0))) (not (<= |old(~counter~0)| 0))) [2022-04-27 23:09:06,409 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) (not (<= |old(~counter~0)| 0))) [2022-04-27 23:09:06,409 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-27 23:09:06,409 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-27 23:09:06,409 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-27 23:09:06,409 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-27 23:09:06,409 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-27 23:09:06,409 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-27 23:09:06,411 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:09:06,412 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 23:09:06,415 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 23:09:06,416 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 23:09:06,416 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 23:09:06,416 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 23:09:06,416 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 23:09:06,416 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 23:09:06,416 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 23:09:06,416 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 23:09:06,416 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 23:09:06,416 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 23:09:06,416 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 23:09:06,416 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 23:09:06,416 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 23:09:06,417 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 23:09:06,417 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:09:06,417 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:09:06,417 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:09:06,417 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:09:06,417 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:09:06,417 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:09:06,417 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:09:06,417 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 23:09:06,417 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 23:09:06,417 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 23:09:06,417 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 23:09:06,417 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 23:09:06,417 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-04-27 23:09:06,417 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-04-27 23:09:06,418 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 23:09:06,418 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-04-27 23:09:06,418 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 23:09:06,418 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-04-27 23:09:06,418 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 23:09:06,418 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 23:09:06,418 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 23:09:06,418 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 23:09:06,418 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 23:09:06,418 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 23:09:06,418 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 23:09:06,418 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 23:09:06,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:09:06 BasicIcfg [2022-04-27 23:09:06,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 23:09:06,429 INFO L158 Benchmark]: Toolchain (without parser) took 77316.02ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 117.0MB in the beginning and 77.2MB in the end (delta: 39.8MB). Peak memory consumption was 74.8MB. Max. memory is 8.0GB. [2022-04-27 23:09:06,432 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 169.9MB. Free memory was 133.3MB in the beginning and 133.1MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 23:09:06,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.37ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 116.8MB in the beginning and 180.2MB in the end (delta: -63.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-27 23:09:06,433 INFO L158 Benchmark]: Boogie Preprocessor took 37.53ms. Allocated memory is still 204.5MB. Free memory was 180.2MB in the beginning and 178.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 23:09:06,433 INFO L158 Benchmark]: RCFGBuilder took 275.53ms. Allocated memory is still 204.5MB. Free memory was 178.6MB in the beginning and 165.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 23:09:06,434 INFO L158 Benchmark]: IcfgTransformer took 24.19ms. Allocated memory is still 204.5MB. Free memory was 165.5MB in the beginning and 163.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 23:09:06,434 INFO L158 Benchmark]: TraceAbstraction took 76784.93ms. Allocated memory is still 204.5MB. Free memory was 162.9MB in the beginning and 77.2MB in the end (delta: 85.7MB). Peak memory consumption was 87.2MB. Max. memory is 8.0GB. [2022-04-27 23:09:06,435 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.10ms. Allocated memory is still 169.9MB. Free memory was 133.3MB in the beginning and 133.1MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.37ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 116.8MB in the beginning and 180.2MB in the end (delta: -63.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.53ms. Allocated memory is still 204.5MB. Free memory was 180.2MB in the beginning and 178.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 275.53ms. Allocated memory is still 204.5MB. Free memory was 178.6MB in the beginning and 165.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 24.19ms. Allocated memory is still 204.5MB. Free memory was 165.5MB in the beginning and 163.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 76784.93ms. Allocated memory is still 204.5MB. Free memory was 162.9MB in the beginning and 77.2MB in the end (delta: 85.7MB). Peak memory consumption was 87.2MB. 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 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.7s, OverallIterations: 12, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 388 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 1922 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1394 mSDsCounter, 199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1198 IncrementalHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 199 mSolverCounterUnsat, 528 mSDtfsCounter, 1198 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 749 GetRequests, 653 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=9, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 28 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 129 PreInvPairs, 200 NumberOfFragments, 250 HoareAnnotationTreeSize, 129 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 2803 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 66.0s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 699 ConstructedInterpolants, 0 QuantifiedInterpolants, 1996 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1473 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 861/960 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((q * y + r == x && 1 <= r) && 1 <= y) && b == a * y) || !(\old(counter) <= 0) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: !(\old(counter) <= 0) || ((q * y + r == x && 1 <= y) && b == a * y) RESULT: Ultimate proved your program to be correct! [2022-04-27 23:09:06,453 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...