/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 19:13:57,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 19:13:57,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 19:13:57,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 19:13:57,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 19:13:57,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 19:13:57,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 19:13:57,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 19:13:57,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 19:13:57,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 19:13:57,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 19:13:57,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 19:13:57,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 19:13:57,785 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 19:13:57,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 19:13:57,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 19:13:57,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 19:13:57,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 19:13:57,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 19:13:57,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 19:13:57,792 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 19:13:57,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 19:13:57,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 19:13:57,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 19:13:57,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 19:13:57,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 19:13:57,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 19:13:57,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 19:13:57,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 19:13:57,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 19:13:57,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 19:13:57,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 19:13:57,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 19:13:57,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 19:13:57,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 19:13:57,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 19:13:57,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 19:13:57,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 19:13:57,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 19:13:57,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 19:13:57,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 19:13:57,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 19:13:57,806 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 19:13:57,814 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 19:13:57,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 19:13:57,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 19:13:57,815 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 19:13:57,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 19:13:57,815 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 19:13:57,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 19:13:57,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 19:13:57,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 19:13:57,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 19:13:57,816 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 19:13:57,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 19:13:57,816 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 19:13:57,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 19:13:57,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 19:13:57,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 19:13:57,817 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 19:13:57,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 19:13:57,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 19:13:57,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 19:13:57,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 19:13:57,818 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 19:13:57,819 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 19:13:58,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 19:13:58,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 19:13:58,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 19:13:58,059 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 19:13:58,060 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 19:13:58,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_valuebound1.c [2022-04-27 19:13:58,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc2b4618/496af843d6514c46a18f75c19d7c84b1/FLAG9cba02f3a [2022-04-27 19:13:58,476 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 19:13:58,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_valuebound1.c [2022-04-27 19:13:58,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc2b4618/496af843d6514c46a18f75c19d7c84b1/FLAG9cba02f3a [2022-04-27 19:13:58,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc2b4618/496af843d6514c46a18f75c19d7c84b1 [2022-04-27 19:13:58,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 19:13:58,900 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 19:13:58,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 19:13:58,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 19:13:58,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 19:13:58,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 07:13:58" (1/1) ... [2022-04-27 19:13:58,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b0bd99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:13:58, skipping insertion in model container [2022-04-27 19:13:58,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 07:13:58" (1/1) ... [2022-04-27 19:13:58,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 19:13:58,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 19:13:59,086 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/hard2_valuebound1.c[526,539] [2022-04-27 19:13:59,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 19:13:59,120 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 19:13:59,130 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/hard2_valuebound1.c[526,539] [2022-04-27 19:13:59,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 19:13:59,157 INFO L208 MainTranslator]: Completed translation [2022-04-27 19:13:59,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:13:59 WrapperNode [2022-04-27 19:13:59,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 19:13:59,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 19:13:59,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 19:13:59,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 19:13:59,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:13:59" (1/1) ... [2022-04-27 19:13:59,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:13:59" (1/1) ... [2022-04-27 19:13:59,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:13:59" (1/1) ... [2022-04-27 19:13:59,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:13:59" (1/1) ... [2022-04-27 19:13:59,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:13:59" (1/1) ... [2022-04-27 19:13:59,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:13:59" (1/1) ... [2022-04-27 19:13:59,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:13:59" (1/1) ... [2022-04-27 19:13:59,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 19:13:59,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 19:13:59,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 19:13:59,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 19:13:59,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:13:59" (1/1) ... [2022-04-27 19:13:59,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 19:13:59,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:13:59,220 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 19:13:59,221 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 19:13:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 19:13:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 19:13:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 19:13:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 19:13:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 19:13:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 19:13:59,254 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 19:13:59,254 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 19:13:59,254 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 19:13:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 19:13:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 19:13:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 19:13:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 19:13:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 19:13:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 19:13:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 19:13:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 19:13:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 19:13:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 19:13:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 19:13:59,309 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 19:13:59,310 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 19:13:59,437 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 19:13:59,443 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 19:13:59,443 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 19:13:59,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 07:13:59 BoogieIcfgContainer [2022-04-27 19:13:59,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 19:13:59,446 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 19:13:59,446 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 19:13:59,447 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 19:13:59,449 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 07:13:59" (1/1) ... [2022-04-27 19:13:59,451 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 19:13:59,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 07:13:59 BasicIcfg [2022-04-27 19:13:59,489 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 19:13:59,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 19:13:59,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 19:13:59,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 19:13:59,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 07:13:58" (1/4) ... [2022-04-27 19:13:59,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3378bc71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 07:13:59, skipping insertion in model container [2022-04-27 19:13:59,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:13:59" (2/4) ... [2022-04-27 19:13:59,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3378bc71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 07:13:59, skipping insertion in model container [2022-04-27 19:13:59,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 07:13:59" (3/4) ... [2022-04-27 19:13:59,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3378bc71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 07:13:59, skipping insertion in model container [2022-04-27 19:13:59,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 07:13:59" (4/4) ... [2022-04-27 19:13:59,495 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_valuebound1.cJordan [2022-04-27 19:13:59,523 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 19:13:59,523 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 19:13:59,570 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 19:13:59,575 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@612a1346, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@333f8842 [2022-04-27 19:13:59,576 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 19:13:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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 19:13:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 19:13:59,590 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:13:59,590 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 19:13:59,591 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:13:59,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:13:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1625753047, now seen corresponding path program 1 times [2022-04-27 19:13:59,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:13:59,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274186748] [2022-04-27 19:13:59,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:13:59,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:13:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:13:59,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 19:13:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:13:59,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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 .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {38#true} is VALID [2022-04-27 19:13:59,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 19:13:59,753 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 19:13:59,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 19:13:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:13:59,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} [105] 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] {38#true} is VALID [2022-04-27 19:13:59,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} [109] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 19:13:59,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 19:13:59,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {39#false} is VALID [2022-04-27 19:13:59,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 19:13:59,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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 .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {38#true} is VALID [2022-04-27 19:13:59,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 19:13:59,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 19:13:59,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 19:13:59,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {38#true} is VALID [2022-04-27 19:13:59,767 INFO L272 TraceCheckUtils]: 6: Hoare triple {38#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {38#true} is VALID [2022-04-27 19:13:59,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#true} [105] 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] {38#true} is VALID [2022-04-27 19:13:59,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} [109] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 19:13:59,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 19:13:59,769 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39#false} {38#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {39#false} is VALID [2022-04-27 19:13:59,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {39#false} is VALID [2022-04-27 19:13:59,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 19:13:59,769 INFO L272 TraceCheckUtils]: 13: Hoare triple {39#false} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {39#false} is VALID [2022-04-27 19:13:59,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} [119] __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] {39#false} is VALID [2022-04-27 19:13:59,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} [123] 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[] {39#false} is VALID [2022-04-27 19:13:59,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 19:13:59,771 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 19:13:59,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:13:59,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274186748] [2022-04-27 19:13:59,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274186748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:13:59,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:13:59,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 19:13:59,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559048646] [2022-04-27 19:13:59,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:13:59,779 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 19:13:59,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:13:59,788 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 19:13:59,820 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 19:13:59,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 19:13:59,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:13:59,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 19:13:59,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 19:13:59,846 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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 19:14:00,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:00,040 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-27 19:14:00,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 19:14:00,040 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 19:14:00,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:14:00,042 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 19:14:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-04-27 19:14:00,054 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 19:14:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-04-27 19:14:00,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2022-04-27 19:14:00,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:14:00,147 INFO L225 Difference]: With dead ends: 35 [2022-04-27 19:14:00,147 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 19:14:00,150 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 19:14:00,154 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:14:00,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:14:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 19:14:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 19:14:00,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:14:00,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 19:14:00,184 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 19:14:00,185 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 19:14:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:00,192 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-27 19:14:00,192 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-27 19:14:00,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:00,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:00,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 30 states. [2022-04-27 19:14:00,195 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 30 states. [2022-04-27 19:14:00,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:00,201 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-27 19:14:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-27 19:14:00,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:00,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:00,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:14:00,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:14:00,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 19:14:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-04-27 19:14:00,224 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2022-04-27 19:14:00,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:14:00,224 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-04-27 19:14:00,225 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 19:14:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-27 19:14:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 19:14:00,225 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:14:00,226 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 19:14:00,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 19:14:00,226 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:14:00,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:14:00,227 INFO L85 PathProgramCache]: Analyzing trace with hash 861759786, now seen corresponding path program 1 times [2022-04-27 19:14:00,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:14:00,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175259119] [2022-04-27 19:14:00,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:14:00,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:14:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:00,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 19:14:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:00,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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 .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {175#true} is VALID [2022-04-27 19:14:00,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 19:14:00,313 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {175#true} {175#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 19:14:00,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 19:14:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:00,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#true} [105] 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] {175#true} is VALID [2022-04-27 19:14:00,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#true} [110] 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[] {175#true} is VALID [2022-04-27 19:14:00,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {175#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 19:14:00,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {175#true} {175#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {175#true} is VALID [2022-04-27 19:14:00,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {175#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 19:14:00,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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 .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {175#true} is VALID [2022-04-27 19:14:00,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {175#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 19:14:00,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {175#true} {175#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 19:14:00,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {175#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 19:14:00,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {175#true} is VALID [2022-04-27 19:14:00,323 INFO L272 TraceCheckUtils]: 6: Hoare triple {175#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {175#true} is VALID [2022-04-27 19:14:00,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#true} [105] 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] {175#true} is VALID [2022-04-27 19:14:00,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#true} [110] 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[] {175#true} is VALID [2022-04-27 19:14:00,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 19:14:00,324 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {175#true} {175#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {175#true} is VALID [2022-04-27 19:14:00,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {175#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {184#(= main_~q~0 0)} is VALID [2022-04-27 19:14:00,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#(= main_~q~0 0)} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {184#(= main_~q~0 0)} is VALID [2022-04-27 19:14:00,326 INFO L272 TraceCheckUtils]: 13: Hoare triple {184#(= main_~q~0 0)} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {185#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 19:14:00,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {185#(not (= |__VERIFIER_assert_#in~cond| 0))} [119] __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] {186#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 19:14:00,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#(not (= __VERIFIER_assert_~cond 0))} [123] 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[] {176#false} is VALID [2022-04-27 19:14:00,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {176#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#false} is VALID [2022-04-27 19:14:00,328 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 19:14:00,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:14:00,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175259119] [2022-04-27 19:14:00,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175259119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:14:00,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:14:00,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 19:14:00,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330985219] [2022-04-27 19:14:00,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:14:00,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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 17 [2022-04-27 19:14:00,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:14:00,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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 19:14:00,345 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 19:14:00,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 19:14:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:14:00,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 19:14:00,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 19:14:00,346 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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 19:14:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:00,741 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-27 19:14:00,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 19:14:00,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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 17 [2022-04-27 19:14:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:14:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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 19:14:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-27 19:14:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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 19:14:00,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-27 19:14:00,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-27 19:14:00,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:14:00,818 INFO L225 Difference]: With dead ends: 41 [2022-04-27 19:14:00,818 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 19:14:00,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 19:14:00,820 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 19:14:00,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 45 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 19:14:00,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 19:14:00,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-27 19:14:00,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:14:00,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:14:00,826 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:14:00,826 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:14:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:00,829 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-27 19:14:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-27 19:14:00,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:00,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:00,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-27 19:14:00,831 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-27 19:14:00,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:00,834 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-27 19:14:00,834 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-27 19:14:00,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:00,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:00,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:14:00,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:14:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:14:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-27 19:14:00,838 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2022-04-27 19:14:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:14:00,838 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-27 19:14:00,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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 19:14:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-27 19:14:00,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 19:14:00,839 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:14:00,839 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] [2022-04-27 19:14:00,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 19:14:00,840 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:14:00,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:14:00,841 INFO L85 PathProgramCache]: Analyzing trace with hash 325569287, now seen corresponding path program 1 times [2022-04-27 19:14:00,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:14:00,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786230229] [2022-04-27 19:14:00,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:14:00,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:14:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:00,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 19:14:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:00,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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 .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {355#true} is VALID [2022-04-27 19:14:00,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {355#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 19:14:00,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {355#true} {355#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 19:14:00,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 19:14:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:00,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {355#true} [105] 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] {355#true} is VALID [2022-04-27 19:14:00,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {355#true} [110] 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[] {355#true} is VALID [2022-04-27 19:14:00,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 19:14:00,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {355#true} is VALID [2022-04-27 19:14:00,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 19:14:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:00,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {355#true} [119] __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] {355#true} is VALID [2022-04-27 19:14:00,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {355#true} [124] 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[] {355#true} is VALID [2022-04-27 19:14:00,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 19:14:00,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {355#true} {364#(= main_~A~0 main_~r~0)} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {364#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 19:14:00,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {355#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 19:14:00,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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 .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {355#true} is VALID [2022-04-27 19:14:00,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 19:14:00,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 19:14:00,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {355#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 19:14:00,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {355#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {355#true} is VALID [2022-04-27 19:14:00,945 INFO L272 TraceCheckUtils]: 6: Hoare triple {355#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {355#true} is VALID [2022-04-27 19:14:00,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {355#true} [105] 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] {355#true} is VALID [2022-04-27 19:14:00,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {355#true} [110] 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[] {355#true} is VALID [2022-04-27 19:14:00,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {355#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 19:14:00,946 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {355#true} {355#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {355#true} is VALID [2022-04-27 19:14:00,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {355#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {364#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 19:14:00,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {364#(= main_~A~0 main_~r~0)} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {364#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 19:14:00,951 INFO L272 TraceCheckUtils]: 13: Hoare triple {364#(= main_~A~0 main_~r~0)} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {355#true} is VALID [2022-04-27 19:14:00,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {355#true} [119] __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] {355#true} is VALID [2022-04-27 19:14:00,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {355#true} [124] 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[] {355#true} is VALID [2022-04-27 19:14:00,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {355#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 19:14:00,953 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {355#true} {364#(= main_~A~0 main_~r~0)} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {364#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 19:14:00,954 INFO L272 TraceCheckUtils]: 18: Hoare triple {364#(= main_~A~0 main_~r~0)} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {369#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 19:14:00,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {369#(not (= |__VERIFIER_assert_#in~cond| 0))} [119] __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] {370#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 19:14:00,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#(not (= __VERIFIER_assert_~cond 0))} [123] 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[] {356#false} is VALID [2022-04-27 19:14:00,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {356#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {356#false} is VALID [2022-04-27 19:14:00,957 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 19:14:00,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:14:00,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786230229] [2022-04-27 19:14:00,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786230229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:14:00,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:14:00,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 19:14:00,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594009931] [2022-04-27 19:14:00,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:14:00,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 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 22 [2022-04-27 19:14:00,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:14:00,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 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 19:14:00,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:14:00,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 19:14:00,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:14:00,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 19:14:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 19:14:00,985 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 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 19:14:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:01,344 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 19:14:01,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 19:14:01,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 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 22 [2022-04-27 19:14:01,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:14:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 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 19:14:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-27 19:14:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 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 19:14:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-27 19:14:01,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-27 19:14:01,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:14:01,410 INFO L225 Difference]: With dead ends: 45 [2022-04-27 19:14:01,410 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 19:14:01,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 19:14:01,416 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 19:14:01,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 45 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 19:14:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 19:14:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-04-27 19:14:01,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:14:01,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:14:01,427 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:14:01,429 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:14:01,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:01,438 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 19:14:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-27 19:14:01,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:01,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:01,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-27 19:14:01,440 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-27 19:14:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:01,447 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 19:14:01,448 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-27 19:14:01,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:01,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:01,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:14:01,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:14:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:14:01,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-27 19:14:01,455 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 22 [2022-04-27 19:14:01,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:14:01,455 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-27 19:14:01,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 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 19:14:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-27 19:14:01,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 19:14:01,456 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:14:01,456 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] [2022-04-27 19:14:01,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 19:14:01,457 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:14:01,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:14:01,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1461652409, now seen corresponding path program 1 times [2022-04-27 19:14:01,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:14:01,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555913831] [2022-04-27 19:14:01,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:14:01,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:14:01,480 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:14:01,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1375946927] [2022-04-27 19:14:01,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:14:01,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:14:01,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:14:01,482 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 19:14:01,487 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 19:14:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:01,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 19:14:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:01,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:14:01,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {555#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#true} is VALID [2022-04-27 19:14:01,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {555#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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 .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {555#true} is VALID [2022-04-27 19:14:01,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {555#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#true} is VALID [2022-04-27 19:14:01,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {555#true} {555#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#true} is VALID [2022-04-27 19:14:01,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {555#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#true} is VALID [2022-04-27 19:14:01,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {555#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {555#true} is VALID [2022-04-27 19:14:01,845 INFO L272 TraceCheckUtils]: 6: Hoare triple {555#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {555#true} is VALID [2022-04-27 19:14:01,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {555#true} [105] 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] {555#true} is VALID [2022-04-27 19:14:01,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {555#true} [110] 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[] {555#true} is VALID [2022-04-27 19:14:01,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {555#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#true} is VALID [2022-04-27 19:14:01,845 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {555#true} {555#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {555#true} is VALID [2022-04-27 19:14:01,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {555#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {593#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:01,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {593#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:01,850 INFO L272 TraceCheckUtils]: 13: Hoare triple {593#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {555#true} is VALID [2022-04-27 19:14:01,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {555#true} [119] __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] {555#true} is VALID [2022-04-27 19:14:01,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {555#true} [124] 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[] {555#true} is VALID [2022-04-27 19:14:01,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {555#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#true} is VALID [2022-04-27 19:14:01,851 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {555#true} {593#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {593#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:01,852 INFO L272 TraceCheckUtils]: 18: Hoare triple {593#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {555#true} is VALID [2022-04-27 19:14:01,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {555#true} [119] __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] {555#true} is VALID [2022-04-27 19:14:01,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {555#true} [124] 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[] {555#true} is VALID [2022-04-27 19:14:01,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {555#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#true} is VALID [2022-04-27 19:14:01,858 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {555#true} {593#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {593#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:01,860 INFO L272 TraceCheckUtils]: 23: Hoare triple {593#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:14:01,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {630#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:14:01,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {634#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {556#false} is VALID [2022-04-27 19:14:01,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {556#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#false} is VALID [2022-04-27 19:14:01,862 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 19:14:01,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 19:14:01,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:14:01,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555913831] [2022-04-27 19:14:01,862 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:14:01,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375946927] [2022-04-27 19:14:01,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375946927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:14:01,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:14:01,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 19:14:01,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470972539] [2022-04-27 19:14:01,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:14:01,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 19:14:01,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:14:01,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 19:14:01,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:14:01,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 19:14:01,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:14:01,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 19:14:01,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 19:14:01,890 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 19:14:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:02,071 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-04-27 19:14:02,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 19:14:02,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 19:14:02,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:14:02,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 19:14:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-27 19:14:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 19:14:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-27 19:14:02,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-04-27 19:14:02,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:14:02,134 INFO L225 Difference]: With dead ends: 53 [2022-04-27 19:14:02,134 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 19:14:02,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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 19:14:02,141 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:14:02,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 128 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:14:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 19:14:02,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 19:14:02,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:14:02,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 19:14:02,155 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 19:14:02,155 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 19:14:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:02,159 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-04-27 19:14:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-27 19:14:02,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:02,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:02,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-27 19:14:02,163 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-27 19:14:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:02,169 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-04-27 19:14:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-27 19:14:02,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:02,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:02,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:14:02,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:14:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 19:14:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-04-27 19:14:02,174 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 27 [2022-04-27 19:14:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:14:02,174 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-04-27 19:14:02,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 19:14:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-27 19:14:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 19:14:02,176 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:14:02,176 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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 19:14:02,204 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 19:14:02,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:14:02,397 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:14:02,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:14:02,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1008917278, now seen corresponding path program 1 times [2022-04-27 19:14:02,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:14:02,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81955244] [2022-04-27 19:14:02,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:14:02,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:14:02,418 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:14:02,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1006008651] [2022-04-27 19:14:02,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:14:02,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:14:02,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:14:02,429 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 19:14:02,430 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 19:14:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:02,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 19:14:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:02,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:14:02,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {851#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {851#true} is VALID [2022-04-27 19:14:02,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {851#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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 .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {851#true} is VALID [2022-04-27 19:14:02,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {851#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {851#true} is VALID [2022-04-27 19:14:02,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {851#true} {851#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {851#true} is VALID [2022-04-27 19:14:02,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {851#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {851#true} is VALID [2022-04-27 19:14:02,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {851#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {851#true} is VALID [2022-04-27 19:14:02,670 INFO L272 TraceCheckUtils]: 6: Hoare triple {851#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {851#true} is VALID [2022-04-27 19:14:02,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {851#true} [105] 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] {851#true} is VALID [2022-04-27 19:14:02,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {851#true} [110] 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[] {851#true} is VALID [2022-04-27 19:14:02,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {851#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {851#true} is VALID [2022-04-27 19:14:02,671 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {851#true} {851#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {851#true} is VALID [2022-04-27 19:14:02,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {851#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:02,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:02,672 INFO L272 TraceCheckUtils]: 13: Hoare triple {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {851#true} is VALID [2022-04-27 19:14:02,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {851#true} [119] __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] {851#true} is VALID [2022-04-27 19:14:02,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {851#true} [124] 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[] {851#true} is VALID [2022-04-27 19:14:02,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {851#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {851#true} is VALID [2022-04-27 19:14:02,673 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {851#true} {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:02,673 INFO L272 TraceCheckUtils]: 18: Hoare triple {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {851#true} is VALID [2022-04-27 19:14:02,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {851#true} [119] __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] {851#true} is VALID [2022-04-27 19:14:02,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {851#true} [124] 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[] {851#true} is VALID [2022-04-27 19:14:02,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {851#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {851#true} is VALID [2022-04-27 19:14:02,674 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {851#true} {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:02,674 INFO L272 TraceCheckUtils]: 23: Hoare triple {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {851#true} is VALID [2022-04-27 19:14:02,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {851#true} [119] __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] {851#true} is VALID [2022-04-27 19:14:02,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {851#true} [124] 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[] {851#true} is VALID [2022-04-27 19:14:02,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {851#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {851#true} is VALID [2022-04-27 19:14:02,676 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {851#true} {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:02,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [128] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_9)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:02,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:02,678 INFO L272 TraceCheckUtils]: 30: Hoare triple {889#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {947#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:14:02,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {947#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {951#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:14:02,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {951#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {852#false} is VALID [2022-04-27 19:14:02,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {852#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {852#false} is VALID [2022-04-27 19:14:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 19:14:02,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 19:14:02,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:14:02,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81955244] [2022-04-27 19:14:02,679 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:14:02,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006008651] [2022-04-27 19:14:02,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006008651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:14:02,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:14:02,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 19:14:02,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172007790] [2022-04-27 19:14:02,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:14:02,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 19:14:02,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:14:02,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 19:14:02,702 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 19:14:02,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 19:14:02,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:14:02,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 19:14:02,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 19:14:02,703 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 19:14:02,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:02,885 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2022-04-27 19:14:02,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 19:14:02,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 19:14:02,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:14:02,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 19:14:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-27 19:14:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 19:14:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-27 19:14:02,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2022-04-27 19:14:02,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:14:02,942 INFO L225 Difference]: With dead ends: 63 [2022-04-27 19:14:02,943 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 19:14:02,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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 19:14:02,944 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 19:14:02,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 97 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 19:14:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 19:14:02,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2022-04-27 19:14:02,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:14:02,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 19:14:02,951 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 19:14:02,953 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 19:14:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:02,955 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-27 19:14:02,955 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-27 19:14:02,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:02,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:02,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 58 states. [2022-04-27 19:14:02,957 INFO L87 Difference]: Start difference. First operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 58 states. [2022-04-27 19:14:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:02,961 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-27 19:14:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-27 19:14:02,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:02,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:02,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:14:02,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:14:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 19:14:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2022-04-27 19:14:02,965 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 34 [2022-04-27 19:14:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:14:02,965 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2022-04-27 19:14:02,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 19:14:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-04-27 19:14:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 19:14:02,966 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:14:02,966 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:14:02,994 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 19:14:03,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:14:03,184 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:14:03,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:14:03,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1762200840, now seen corresponding path program 1 times [2022-04-27 19:14:03,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:14:03,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261663823] [2022-04-27 19:14:03,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:14:03,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:14:03,199 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:14:03,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152957880] [2022-04-27 19:14:03,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:14:03,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:14:03,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:14:03,203 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 19:14:03,209 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 19:14:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:03,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 19:14:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:03,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:14:03,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {1195#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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 .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {1195#true} is VALID [2022-04-27 19:14:03,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {1195#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1195#true} {1195#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {1195#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {1195#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1195#true} is VALID [2022-04-27 19:14:03,488 INFO L272 TraceCheckUtils]: 6: Hoare triple {1195#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1195#true} is VALID [2022-04-27 19:14:03,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {1195#true} [105] 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] {1195#true} is VALID [2022-04-27 19:14:03,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {1195#true} [110] 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[] {1195#true} is VALID [2022-04-27 19:14:03,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {1195#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,488 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1195#true} {1195#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1195#true} is VALID [2022-04-27 19:14:03,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {1195#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {1233#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:03,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {1233#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1233#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:03,490 INFO L272 TraceCheckUtils]: 13: Hoare triple {1233#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1195#true} is VALID [2022-04-27 19:14:03,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {1195#true} [119] __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] {1195#true} is VALID [2022-04-27 19:14:03,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {1195#true} [124] 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[] {1195#true} is VALID [2022-04-27 19:14:03,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {1195#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,491 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1195#true} {1233#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1233#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:03,491 INFO L272 TraceCheckUtils]: 18: Hoare triple {1233#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1195#true} is VALID [2022-04-27 19:14:03,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {1195#true} [119] __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] {1195#true} is VALID [2022-04-27 19:14:03,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {1195#true} [124] 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[] {1195#true} is VALID [2022-04-27 19:14:03,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {1195#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,492 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1195#true} {1233#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1233#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:03,492 INFO L272 TraceCheckUtils]: 23: Hoare triple {1233#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1195#true} is VALID [2022-04-27 19:14:03,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {1195#true} [119] __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] {1195#true} is VALID [2022-04-27 19:14:03,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {1195#true} [124] 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[] {1195#true} is VALID [2022-04-27 19:14:03,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {1195#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,494 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1195#true} {1233#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1233#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:03,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {1233#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1285#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 19:14:03,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {1285#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1285#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 19:14:03,497 INFO L272 TraceCheckUtils]: 30: Hoare triple {1285#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1195#true} is VALID [2022-04-27 19:14:03,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {1195#true} [119] __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] {1195#true} is VALID [2022-04-27 19:14:03,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {1195#true} [124] 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[] {1195#true} is VALID [2022-04-27 19:14:03,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {1195#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,504 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1195#true} {1285#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1285#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 19:14:03,504 INFO L272 TraceCheckUtils]: 35: Hoare triple {1285#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1195#true} is VALID [2022-04-27 19:14:03,504 INFO L290 TraceCheckUtils]: 36: Hoare triple {1195#true} [119] __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] {1195#true} is VALID [2022-04-27 19:14:03,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {1195#true} [124] 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[] {1195#true} is VALID [2022-04-27 19:14:03,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {1195#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,505 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1195#true} {1285#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1285#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 19:14:03,506 INFO L272 TraceCheckUtils]: 40: Hoare triple {1285#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:14:03,506 INFO L290 TraceCheckUtils]: 41: Hoare triple {1322#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {1326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:14:03,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {1326#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {1196#false} is VALID [2022-04-27 19:14:03,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {1196#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1196#false} is VALID [2022-04-27 19:14:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 19:14:03,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:14:03,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {1196#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1196#false} is VALID [2022-04-27 19:14:03,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {1326#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {1196#false} is VALID [2022-04-27 19:14:03,777 INFO L290 TraceCheckUtils]: 41: Hoare triple {1322#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {1326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:14:03,778 INFO L272 TraceCheckUtils]: 40: Hoare triple {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:14:03,779 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1195#true} {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 19:14:03,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {1195#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {1195#true} [124] 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[] {1195#true} is VALID [2022-04-27 19:14:03,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {1195#true} [119] __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] {1195#true} is VALID [2022-04-27 19:14:03,779 INFO L272 TraceCheckUtils]: 35: Hoare triple {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1195#true} is VALID [2022-04-27 19:14:03,780 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1195#true} {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 19:14:03,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {1195#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {1195#true} [124] 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[] {1195#true} is VALID [2022-04-27 19:14:03,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {1195#true} [119] __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] {1195#true} is VALID [2022-04-27 19:14:03,780 INFO L272 TraceCheckUtils]: 30: Hoare triple {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1195#true} is VALID [2022-04-27 19:14:03,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 19:14:03,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 19:14:03,783 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1195#true} {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 19:14:03,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {1195#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {1195#true} [124] 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[] {1195#true} is VALID [2022-04-27 19:14:03,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {1195#true} [119] __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] {1195#true} is VALID [2022-04-27 19:14:03,784 INFO L272 TraceCheckUtils]: 23: Hoare triple {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1195#true} is VALID [2022-04-27 19:14:03,785 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1195#true} {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 19:14:03,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {1195#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {1195#true} [124] 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[] {1195#true} is VALID [2022-04-27 19:14:03,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {1195#true} [119] __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] {1195#true} is VALID [2022-04-27 19:14:03,785 INFO L272 TraceCheckUtils]: 18: Hoare triple {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1195#true} is VALID [2022-04-27 19:14:03,786 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1195#true} {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 19:14:03,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {1195#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {1195#true} [124] 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[] {1195#true} is VALID [2022-04-27 19:14:03,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {1195#true} [119] __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] {1195#true} is VALID [2022-04-27 19:14:03,786 INFO L272 TraceCheckUtils]: 13: Hoare triple {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1195#true} is VALID [2022-04-27 19:14:03,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 19:14:03,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {1195#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {1342#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 19:14:03,787 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1195#true} {1195#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1195#true} is VALID [2022-04-27 19:14:03,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {1195#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {1195#true} [110] 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[] {1195#true} is VALID [2022-04-27 19:14:03,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {1195#true} [105] 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] {1195#true} is VALID [2022-04-27 19:14:03,788 INFO L272 TraceCheckUtils]: 6: Hoare triple {1195#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1195#true} is VALID [2022-04-27 19:14:03,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {1195#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1195#true} is VALID [2022-04-27 19:14:03,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {1195#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1195#true} {1195#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {1195#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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 .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {1195#true} is VALID [2022-04-27 19:14:03,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {1195#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 19:14:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-27 19:14:03,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:14:03,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261663823] [2022-04-27 19:14:03,790 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:14:03,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152957880] [2022-04-27 19:14:03,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152957880] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 19:14:03,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:14:03,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 19:14:03,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474976627] [2022-04-27 19:14:03,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:14:03,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-27 19:14:03,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:14:03,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 19:14:03,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:14:03,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 19:14:03,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:14:03,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 19:14:03,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 19:14:03,814 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 19:14:06,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:06,204 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2022-04-27 19:14:06,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 19:14:06,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-27 19:14:06,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:14:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 19:14:06,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-04-27 19:14:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 19:14:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-04-27 19:14:06,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 52 transitions. [2022-04-27 19:14:06,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:14:06,274 INFO L225 Difference]: With dead ends: 67 [2022-04-27 19:14:06,274 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 19:14:06,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 19:14:06,275 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 19:14:06,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 19:14:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 19:14:06,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-04-27 19:14:06,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:14:06,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 19:14:06,280 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 19:14:06,281 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 19:14:06,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:06,286 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2022-04-27 19:14:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2022-04-27 19:14:06,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:06,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:06,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-27 19:14:06,287 INFO L87 Difference]: Start difference. First operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-27 19:14:06,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:06,289 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2022-04-27 19:14:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2022-04-27 19:14:06,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:06,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:06,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:14:06,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:14:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 19:14:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2022-04-27 19:14:06,292 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 44 [2022-04-27 19:14:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:14:06,292 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2022-04-27 19:14:06,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 19:14:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 19:14:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 19:14:06,293 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:14:06,293 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:14:06,319 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 19:14:06,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:14:06,508 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:14:06,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:14:06,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1382136022, now seen corresponding path program 1 times [2022-04-27 19:14:06,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:14:06,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571940866] [2022-04-27 19:14:06,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:14:06,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:14:06,522 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:14:06,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1955473933] [2022-04-27 19:14:06,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:14:06,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:14:06,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:14:06,524 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 19:14:06,538 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 19:14:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:06,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 19:14:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:06,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:14:07,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {1732#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:07,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {1732#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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 .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {1732#true} is VALID [2022-04-27 19:14:07,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {1732#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:07,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1732#true} {1732#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:07,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {1732#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:07,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {1732#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1732#true} is VALID [2022-04-27 19:14:07,121 INFO L272 TraceCheckUtils]: 6: Hoare triple {1732#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1732#true} is VALID [2022-04-27 19:14:07,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {1732#true} [105] 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] {1732#true} is VALID [2022-04-27 19:14:07,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {1732#true} [110] 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[] {1732#true} is VALID [2022-04-27 19:14:07,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {1732#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:07,121 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1732#true} {1732#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1732#true} is VALID [2022-04-27 19:14:07,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {1732#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {1770#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:07,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {1770#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1770#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:07,122 INFO L272 TraceCheckUtils]: 13: Hoare triple {1770#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1732#true} is VALID [2022-04-27 19:14:07,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {1732#true} [119] __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] {1732#true} is VALID [2022-04-27 19:14:07,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {1732#true} [124] 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[] {1732#true} is VALID [2022-04-27 19:14:07,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {1732#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:07,125 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1732#true} {1770#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1770#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:07,125 INFO L272 TraceCheckUtils]: 18: Hoare triple {1770#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1732#true} is VALID [2022-04-27 19:14:07,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {1732#true} [119] __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] {1732#true} is VALID [2022-04-27 19:14:07,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {1732#true} [124] 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[] {1732#true} is VALID [2022-04-27 19:14:07,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {1732#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:07,126 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1732#true} {1770#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1770#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:07,126 INFO L272 TraceCheckUtils]: 23: Hoare triple {1770#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1732#true} is VALID [2022-04-27 19:14:07,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {1732#true} [119] __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] {1732#true} is VALID [2022-04-27 19:14:07,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {1732#true} [124] 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[] {1732#true} is VALID [2022-04-27 19:14:07,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {1732#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:07,128 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1732#true} {1770#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1770#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:07,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {1770#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:07,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:07,129 INFO L272 TraceCheckUtils]: 30: Hoare triple {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1732#true} is VALID [2022-04-27 19:14:07,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {1732#true} [119] __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] {1732#true} is VALID [2022-04-27 19:14:07,129 INFO L290 TraceCheckUtils]: 32: Hoare triple {1732#true} [124] 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[] {1732#true} is VALID [2022-04-27 19:14:07,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {1732#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:07,130 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1732#true} {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:07,130 INFO L272 TraceCheckUtils]: 35: Hoare triple {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1732#true} is VALID [2022-04-27 19:14:07,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {1732#true} [119] __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] {1732#true} is VALID [2022-04-27 19:14:07,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {1732#true} [124] 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[] {1732#true} is VALID [2022-04-27 19:14:07,131 INFO L290 TraceCheckUtils]: 38: Hoare triple {1732#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:07,131 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1732#true} {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:07,131 INFO L272 TraceCheckUtils]: 40: Hoare triple {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1732#true} is VALID [2022-04-27 19:14:07,131 INFO L290 TraceCheckUtils]: 41: Hoare triple {1732#true} [119] __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] {1732#true} is VALID [2022-04-27 19:14:07,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {1732#true} [124] 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[] {1732#true} is VALID [2022-04-27 19:14:07,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {1732#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:07,132 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1732#true} {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:07,133 INFO L290 TraceCheckUtils]: 45: Hoare triple {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [128] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_9)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:07,133 INFO L290 TraceCheckUtils]: 46: Hoare triple {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:07,133 INFO L272 TraceCheckUtils]: 47: Hoare triple {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {1732#true} is VALID [2022-04-27 19:14:07,134 INFO L290 TraceCheckUtils]: 48: Hoare triple {1732#true} [119] __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] {1732#true} is VALID [2022-04-27 19:14:07,134 INFO L290 TraceCheckUtils]: 49: Hoare triple {1732#true} [124] 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[] {1732#true} is VALID [2022-04-27 19:14:07,134 INFO L290 TraceCheckUtils]: 50: Hoare triple {1732#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:07,134 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {1732#true} {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:07,135 INFO L272 TraceCheckUtils]: 52: Hoare triple {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1732#true} is VALID [2022-04-27 19:14:07,135 INFO L290 TraceCheckUtils]: 53: Hoare triple {1732#true} [119] __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] {1732#true} is VALID [2022-04-27 19:14:07,135 INFO L290 TraceCheckUtils]: 54: Hoare triple {1732#true} [124] 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[] {1732#true} is VALID [2022-04-27 19:14:07,135 INFO L290 TraceCheckUtils]: 55: Hoare triple {1732#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:07,136 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {1732#true} {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:07,136 INFO L290 TraceCheckUtils]: 57: Hoare triple {1822#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [127] L46-->L52: Formula: (and (= v_main_~p~0_5 (let ((.cse0 (div v_main_~p~0_6 2))) (ite (and (< v_main_~p~0_6 0) (not (= (mod v_main_~p~0_6 2) 0))) (+ .cse0 1) .cse0))) (= v_main_~d~0_4 (let ((.cse1 (div v_main_~d~0_5 2))) (ite (and (< v_main_~d~0_5 0) (not (= (mod v_main_~d~0_5 2) 0))) (+ .cse1 1) .cse1))) (not (= v_main_~p~0_6 1))) InVars {main_~p~0=v_main_~p~0_6, main_~d~0=v_main_~d~0_5} OutVars{main_~p~0=v_main_~p~0_5, main_~d~0=v_main_~d~0_4} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1770#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:07,137 INFO L290 TraceCheckUtils]: 58: Hoare triple {1770#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [134] L52-->L52-2: Formula: (and (<= v_main_~d~0_6 v_main_~r~0_5) (= (+ v_main_~p~0_7 v_main_~q~0_5) v_main_~q~0_4) (= v_main_~r~0_4 (+ v_main_~r~0_5 (* (- 1) v_main_~d~0_6)))) InVars {main_~q~0=v_main_~q~0_5, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_4, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {1913#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-27 19:14:07,137 INFO L290 TraceCheckUtils]: 59: Hoare triple {1913#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1913#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-27 19:14:07,138 INFO L272 TraceCheckUtils]: 60: Hoare triple {1913#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {1920#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:14:07,138 INFO L290 TraceCheckUtils]: 61: Hoare triple {1920#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {1924#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:14:07,139 INFO L290 TraceCheckUtils]: 62: Hoare triple {1924#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {1733#false} is VALID [2022-04-27 19:14:07,139 INFO L290 TraceCheckUtils]: 63: Hoare triple {1733#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1733#false} is VALID [2022-04-27 19:14:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 19:14:07,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:14:08,465 INFO L290 TraceCheckUtils]: 63: Hoare triple {1733#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1733#false} is VALID [2022-04-27 19:14:08,465 INFO L290 TraceCheckUtils]: 62: Hoare triple {1924#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {1733#false} is VALID [2022-04-27 19:14:08,466 INFO L290 TraceCheckUtils]: 61: Hoare triple {1920#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {1924#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:14:08,467 INFO L272 TraceCheckUtils]: 60: Hoare triple {1940#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {1920#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:14:08,467 INFO L290 TraceCheckUtils]: 59: Hoare triple {1940#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1940#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 19:14:08,491 INFO L290 TraceCheckUtils]: 58: Hoare triple {1947#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [134] L52-->L52-2: Formula: (and (<= v_main_~d~0_6 v_main_~r~0_5) (= (+ v_main_~p~0_7 v_main_~q~0_5) v_main_~q~0_4) (= v_main_~r~0_4 (+ v_main_~r~0_5 (* (- 1) v_main_~d~0_6)))) InVars {main_~q~0=v_main_~q~0_5, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_4, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {1940#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 19:14:08,520 INFO L290 TraceCheckUtils]: 57: Hoare triple {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [127] L46-->L52: Formula: (and (= v_main_~p~0_5 (let ((.cse0 (div v_main_~p~0_6 2))) (ite (and (< v_main_~p~0_6 0) (not (= (mod v_main_~p~0_6 2) 0))) (+ .cse0 1) .cse0))) (= v_main_~d~0_4 (let ((.cse1 (div v_main_~d~0_5 2))) (ite (and (< v_main_~d~0_5 0) (not (= (mod v_main_~d~0_5 2) 0))) (+ .cse1 1) .cse1))) (not (= v_main_~p~0_6 1))) InVars {main_~p~0=v_main_~p~0_6, main_~d~0=v_main_~d~0_5} OutVars{main_~p~0=v_main_~p~0_5, main_~d~0=v_main_~d~0_4} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1947#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 19:14:08,521 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {1732#true} {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 19:14:08,522 INFO L290 TraceCheckUtils]: 55: Hoare triple {1732#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:08,522 INFO L290 TraceCheckUtils]: 54: Hoare triple {1732#true} [124] 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[] {1732#true} is VALID [2022-04-27 19:14:08,522 INFO L290 TraceCheckUtils]: 53: Hoare triple {1732#true} [119] __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] {1732#true} is VALID [2022-04-27 19:14:08,522 INFO L272 TraceCheckUtils]: 52: Hoare triple {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1732#true} is VALID [2022-04-27 19:14:08,524 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {1732#true} {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 19:14:08,524 INFO L290 TraceCheckUtils]: 50: Hoare triple {1732#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:08,524 INFO L290 TraceCheckUtils]: 49: Hoare triple {1732#true} [124] 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[] {1732#true} is VALID [2022-04-27 19:14:08,524 INFO L290 TraceCheckUtils]: 48: Hoare triple {1732#true} [119] __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] {1732#true} is VALID [2022-04-27 19:14:08,525 INFO L272 TraceCheckUtils]: 47: Hoare triple {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {1732#true} is VALID [2022-04-27 19:14:08,526 INFO L290 TraceCheckUtils]: 46: Hoare triple {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 19:14:08,527 INFO L290 TraceCheckUtils]: 45: Hoare triple {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [128] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_9)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 19:14:08,528 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1732#true} {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 19:14:08,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {1732#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:08,528 INFO L290 TraceCheckUtils]: 42: Hoare triple {1732#true} [124] 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[] {1732#true} is VALID [2022-04-27 19:14:08,529 INFO L290 TraceCheckUtils]: 41: Hoare triple {1732#true} [119] __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] {1732#true} is VALID [2022-04-27 19:14:08,529 INFO L272 TraceCheckUtils]: 40: Hoare triple {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1732#true} is VALID [2022-04-27 19:14:08,529 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1732#true} {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 19:14:08,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {1732#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:08,530 INFO L290 TraceCheckUtils]: 37: Hoare triple {1732#true} [124] 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[] {1732#true} is VALID [2022-04-27 19:14:08,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {1732#true} [119] __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] {1732#true} is VALID [2022-04-27 19:14:08,530 INFO L272 TraceCheckUtils]: 35: Hoare triple {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1732#true} is VALID [2022-04-27 19:14:08,531 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1732#true} {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 19:14:08,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {1732#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:08,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {1732#true} [124] 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[] {1732#true} is VALID [2022-04-27 19:14:08,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {1732#true} [119] __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] {1732#true} is VALID [2022-04-27 19:14:08,531 INFO L272 TraceCheckUtils]: 30: Hoare triple {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1732#true} is VALID [2022-04-27 19:14:08,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 19:14:08,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {1947#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1951#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 19:14:08,542 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1732#true} {1947#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1947#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 19:14:08,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {1732#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:08,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {1732#true} [124] 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[] {1732#true} is VALID [2022-04-27 19:14:08,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {1732#true} [119] __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] {1732#true} is VALID [2022-04-27 19:14:08,543 INFO L272 TraceCheckUtils]: 23: Hoare triple {1947#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1732#true} is VALID [2022-04-27 19:14:08,546 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1732#true} {1947#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1947#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 19:14:08,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {1732#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:08,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {1732#true} [124] 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[] {1732#true} is VALID [2022-04-27 19:14:08,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {1732#true} [119] __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] {1732#true} is VALID [2022-04-27 19:14:08,547 INFO L272 TraceCheckUtils]: 18: Hoare triple {1947#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1732#true} is VALID [2022-04-27 19:14:08,547 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1732#true} {1947#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1947#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 19:14:08,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {1732#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:08,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {1732#true} [124] 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[] {1732#true} is VALID [2022-04-27 19:14:08,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {1732#true} [119] __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] {1732#true} is VALID [2022-04-27 19:14:08,548 INFO L272 TraceCheckUtils]: 13: Hoare triple {1947#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1732#true} is VALID [2022-04-27 19:14:08,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {1947#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1947#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 19:14:08,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {1732#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {1947#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 19:14:08,549 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1732#true} {1732#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1732#true} is VALID [2022-04-27 19:14:08,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {1732#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:08,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {1732#true} [110] 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[] {1732#true} is VALID [2022-04-27 19:14:08,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {1732#true} [105] 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] {1732#true} is VALID [2022-04-27 19:14:08,549 INFO L272 TraceCheckUtils]: 6: Hoare triple {1732#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1732#true} is VALID [2022-04-27 19:14:08,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {1732#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1732#true} is VALID [2022-04-27 19:14:08,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {1732#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:08,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1732#true} {1732#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:08,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {1732#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:08,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {1732#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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 .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {1732#true} is VALID [2022-04-27 19:14:08,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {1732#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#true} is VALID [2022-04-27 19:14:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 19:14:08,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:14:08,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571940866] [2022-04-27 19:14:08,551 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:14:08,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955473933] [2022-04-27 19:14:08,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955473933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 19:14:08,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 19:14:08,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 19:14:08,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555744862] [2022-04-27 19:14:08,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 19:14:08,552 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 64 [2022-04-27 19:14:08,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:14:08,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 19:14:08,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:14:08,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 19:14:08,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:14:08,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 19:14:08,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 19:14:08,676 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 19:14:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:12,425 INFO L93 Difference]: Finished difference Result 131 states and 176 transitions. [2022-04-27 19:14:12,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 19:14:12,425 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 64 [2022-04-27 19:14:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:14:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 19:14:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2022-04-27 19:14:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 19:14:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2022-04-27 19:14:12,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 124 transitions. [2022-04-27 19:14:12,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:14:12,630 INFO L225 Difference]: With dead ends: 131 [2022-04-27 19:14:12,630 INFO L226 Difference]: Without dead ends: 125 [2022-04-27 19:14:12,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-27 19:14:12,631 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 38 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 19:14:12,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 183 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 19:14:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-27 19:14:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113. [2022-04-27 19:14:12,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:14:12,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 113 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 19:14:12,639 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 113 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 19:14:12,640 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 113 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 19:14:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:12,645 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2022-04-27 19:14:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2022-04-27 19:14:12,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:12,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:12,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 125 states. [2022-04-27 19:14:12,646 INFO L87 Difference]: Start difference. First operand has 113 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 125 states. [2022-04-27 19:14:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:12,652 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2022-04-27 19:14:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2022-04-27 19:14:12,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:12,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:12,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:14:12,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:14:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 19:14:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2022-04-27 19:14:12,657 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 64 [2022-04-27 19:14:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:14:12,657 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2022-04-27 19:14:12,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 19:14:12,658 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2022-04-27 19:14:12,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 19:14:12,659 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:14:12,659 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:14:12,682 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 19:14:12,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:14:12,876 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:14:12,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:14:12,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1085940318, now seen corresponding path program 1 times [2022-04-27 19:14:12,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:14:12,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974876561] [2022-04-27 19:14:12,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:14:12,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:14:12,903 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:14:12,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1668049422] [2022-04-27 19:14:12,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:14:12,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:14:12,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:14:12,914 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 19:14:12,933 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 19:14:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:12,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 19:14:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:12,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:14:13,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {2627#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:13,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {2627#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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 .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {2627#true} is VALID [2022-04-27 19:14:13,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {2627#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:13,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2627#true} {2627#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:13,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {2627#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:13,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {2627#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2627#true} is VALID [2022-04-27 19:14:13,547 INFO L272 TraceCheckUtils]: 6: Hoare triple {2627#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2627#true} is VALID [2022-04-27 19:14:13,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {2627#true} [105] 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] {2627#true} is VALID [2022-04-27 19:14:13,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {2627#true} [110] 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[] {2627#true} is VALID [2022-04-27 19:14:13,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {2627#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:13,547 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2627#true} {2627#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2627#true} is VALID [2022-04-27 19:14:13,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {2627#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {2665#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:13,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {2665#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:13,548 INFO L272 TraceCheckUtils]: 13: Hoare triple {2665#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2627#true} is VALID [2022-04-27 19:14:13,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {2627#true} [119] __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] {2627#true} is VALID [2022-04-27 19:14:13,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {2627#true} [124] 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[] {2627#true} is VALID [2022-04-27 19:14:13,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {2627#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:13,549 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2627#true} {2665#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2665#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:13,549 INFO L272 TraceCheckUtils]: 18: Hoare triple {2665#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2627#true} is VALID [2022-04-27 19:14:13,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {2627#true} [119] __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] {2627#true} is VALID [2022-04-27 19:14:13,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {2627#true} [124] 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[] {2627#true} is VALID [2022-04-27 19:14:13,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {2627#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:13,555 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2627#true} {2665#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2665#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:13,555 INFO L272 TraceCheckUtils]: 23: Hoare triple {2665#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2627#true} is VALID [2022-04-27 19:14:13,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {2627#true} [119] __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] {2627#true} is VALID [2022-04-27 19:14:13,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {2627#true} [124] 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[] {2627#true} is VALID [2022-04-27 19:14:13,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {2627#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:13,556 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2627#true} {2665#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2665#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:13,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {2665#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:13,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:13,558 INFO L272 TraceCheckUtils]: 30: Hoare triple {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2627#true} is VALID [2022-04-27 19:14:13,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {2627#true} [119] __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] {2627#true} is VALID [2022-04-27 19:14:13,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {2627#true} [124] 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[] {2627#true} is VALID [2022-04-27 19:14:13,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {2627#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:13,559 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2627#true} {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:13,559 INFO L272 TraceCheckUtils]: 35: Hoare triple {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2627#true} is VALID [2022-04-27 19:14:13,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {2627#true} [119] __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] {2627#true} is VALID [2022-04-27 19:14:13,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {2627#true} [124] 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[] {2627#true} is VALID [2022-04-27 19:14:13,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {2627#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:13,560 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2627#true} {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:13,560 INFO L272 TraceCheckUtils]: 40: Hoare triple {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2627#true} is VALID [2022-04-27 19:14:13,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {2627#true} [119] __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] {2627#true} is VALID [2022-04-27 19:14:13,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {2627#true} [124] 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[] {2627#true} is VALID [2022-04-27 19:14:13,560 INFO L290 TraceCheckUtils]: 43: Hoare triple {2627#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:13,561 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2627#true} {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:13,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [128] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_9)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:13,562 INFO L290 TraceCheckUtils]: 46: Hoare triple {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:13,562 INFO L272 TraceCheckUtils]: 47: Hoare triple {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {2627#true} is VALID [2022-04-27 19:14:13,562 INFO L290 TraceCheckUtils]: 48: Hoare triple {2627#true} [119] __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] {2627#true} is VALID [2022-04-27 19:14:13,562 INFO L290 TraceCheckUtils]: 49: Hoare triple {2627#true} [124] 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[] {2627#true} is VALID [2022-04-27 19:14:13,562 INFO L290 TraceCheckUtils]: 50: Hoare triple {2627#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:13,563 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2627#true} {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:13,563 INFO L272 TraceCheckUtils]: 52: Hoare triple {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2627#true} is VALID [2022-04-27 19:14:13,563 INFO L290 TraceCheckUtils]: 53: Hoare triple {2627#true} [119] __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] {2627#true} is VALID [2022-04-27 19:14:13,563 INFO L290 TraceCheckUtils]: 54: Hoare triple {2627#true} [124] 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[] {2627#true} is VALID [2022-04-27 19:14:13,563 INFO L290 TraceCheckUtils]: 55: Hoare triple {2627#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:13,564 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2627#true} {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 19:14:13,564 INFO L290 TraceCheckUtils]: 57: Hoare triple {2717#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [127] L46-->L52: Formula: (and (= v_main_~p~0_5 (let ((.cse0 (div v_main_~p~0_6 2))) (ite (and (< v_main_~p~0_6 0) (not (= (mod v_main_~p~0_6 2) 0))) (+ .cse0 1) .cse0))) (= v_main_~d~0_4 (let ((.cse1 (div v_main_~d~0_5 2))) (ite (and (< v_main_~d~0_5 0) (not (= (mod v_main_~d~0_5 2) 0))) (+ .cse1 1) .cse1))) (not (= v_main_~p~0_6 1))) InVars {main_~p~0=v_main_~p~0_6, main_~d~0=v_main_~d~0_5} OutVars{main_~p~0=v_main_~p~0_5, main_~d~0=v_main_~d~0_4} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2665#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:13,565 INFO L290 TraceCheckUtils]: 58: Hoare triple {2665#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [134] L52-->L52-2: Formula: (and (<= v_main_~d~0_6 v_main_~r~0_5) (= (+ v_main_~p~0_7 v_main_~q~0_5) v_main_~q~0_4) (= v_main_~r~0_4 (+ v_main_~r~0_5 (* (- 1) v_main_~d~0_6)))) InVars {main_~q~0=v_main_~q~0_5, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_4, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {2808#(and (= main_~q~0 main_~p~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:13,565 INFO L290 TraceCheckUtils]: 59: Hoare triple {2808#(and (= main_~q~0 main_~p~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2808#(and (= main_~q~0 main_~p~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:13,565 INFO L272 TraceCheckUtils]: 60: Hoare triple {2808#(and (= main_~q~0 main_~p~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {2627#true} is VALID [2022-04-27 19:14:13,566 INFO L290 TraceCheckUtils]: 61: Hoare triple {2627#true} [119] __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] {2818#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:14:13,566 INFO L290 TraceCheckUtils]: 62: Hoare triple {2818#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [124] 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[] {2822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 19:14:13,566 INFO L290 TraceCheckUtils]: 63: Hoare triple {2822#(not (= |__VERIFIER_assert_#in~cond| 0))} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 19:14:13,567 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {2822#(not (= |__VERIFIER_assert_#in~cond| 0))} {2808#(and (= main_~q~0 main_~p~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {2808#(and (= main_~q~0 main_~p~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:13,567 INFO L272 TraceCheckUtils]: 65: Hoare triple {2808#(and (= main_~q~0 main_~p~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2627#true} is VALID [2022-04-27 19:14:13,567 INFO L290 TraceCheckUtils]: 66: Hoare triple {2627#true} [119] __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] {2818#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:14:13,568 INFO L290 TraceCheckUtils]: 67: Hoare triple {2818#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [124] 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[] {2822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 19:14:13,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {2822#(not (= |__VERIFIER_assert_#in~cond| 0))} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 19:14:13,569 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {2822#(not (= |__VERIFIER_assert_#in~cond| 0))} {2808#(and (= main_~q~0 main_~p~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2844#(and (= main_~q~0 main_~p~0) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} is VALID [2022-04-27 19:14:13,569 INFO L290 TraceCheckUtils]: 70: Hoare triple {2844#(and (= main_~q~0 main_~p~0) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} [126] L46-->L44-1: Formula: (= v_main_~p~0_4 1) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_4} AuxVars[] AssignedVars[] {2848#(and (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~q~0 1))} is VALID [2022-04-27 19:14:13,570 INFO L272 TraceCheckUtils]: 71: Hoare triple {2848#(and (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~q~0 1))} [116] L44-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_12 (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_12, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {2852#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:14:13,570 INFO L290 TraceCheckUtils]: 72: Hoare triple {2852#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {2856#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:14:13,571 INFO L290 TraceCheckUtils]: 73: Hoare triple {2856#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {2628#false} is VALID [2022-04-27 19:14:13,571 INFO L290 TraceCheckUtils]: 74: Hoare triple {2628#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2628#false} is VALID [2022-04-27 19:14:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 66 proven. 11 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-27 19:14:13,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:14:26,247 INFO L290 TraceCheckUtils]: 74: Hoare triple {2628#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2628#false} is VALID [2022-04-27 19:14:26,247 INFO L290 TraceCheckUtils]: 73: Hoare triple {2856#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {2628#false} is VALID [2022-04-27 19:14:26,248 INFO L290 TraceCheckUtils]: 72: Hoare triple {2852#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {2856#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:14:26,248 INFO L272 TraceCheckUtils]: 71: Hoare triple {2872#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} [116] L44-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_12 (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_12, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {2852#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:14:26,249 INFO L290 TraceCheckUtils]: 70: Hoare triple {2876#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} [126] L46-->L44-1: Formula: (= v_main_~p~0_4 1) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_4} AuxVars[] AssignedVars[] {2872#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 19:14:26,250 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {2822#(not (= |__VERIFIER_assert_#in~cond| 0))} {2880#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2876#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-27 19:14:26,250 INFO L290 TraceCheckUtils]: 68: Hoare triple {2822#(not (= |__VERIFIER_assert_#in~cond| 0))} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 19:14:26,251 INFO L290 TraceCheckUtils]: 67: Hoare triple {2890#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [124] 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[] {2822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 19:14:26,251 INFO L290 TraceCheckUtils]: 66: Hoare triple {2627#true} [119] __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] {2890#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 19:14:26,251 INFO L272 TraceCheckUtils]: 65: Hoare triple {2880#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2627#true} is VALID [2022-04-27 19:14:26,254 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {2822#(not (= |__VERIFIER_assert_#in~cond| 0))} {2627#true} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {2880#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} is VALID [2022-04-27 19:14:26,254 INFO L290 TraceCheckUtils]: 63: Hoare triple {2822#(not (= |__VERIFIER_assert_#in~cond| 0))} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 19:14:26,255 INFO L290 TraceCheckUtils]: 62: Hoare triple {2890#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [124] 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[] {2822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 19:14:26,255 INFO L290 TraceCheckUtils]: 61: Hoare triple {2627#true} [119] __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] {2890#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 19:14:26,255 INFO L272 TraceCheckUtils]: 60: Hoare triple {2627#true} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {2627#true} is VALID [2022-04-27 19:14:26,255 INFO L290 TraceCheckUtils]: 59: Hoare triple {2627#true} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,255 INFO L290 TraceCheckUtils]: 58: Hoare triple {2627#true} [134] L52-->L52-2: Formula: (and (<= v_main_~d~0_6 v_main_~r~0_5) (= (+ v_main_~p~0_7 v_main_~q~0_5) v_main_~q~0_4) (= v_main_~r~0_4 (+ v_main_~r~0_5 (* (- 1) v_main_~d~0_6)))) InVars {main_~q~0=v_main_~q~0_5, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_4, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {2627#true} is VALID [2022-04-27 19:14:26,256 INFO L290 TraceCheckUtils]: 57: Hoare triple {2627#true} [127] L46-->L52: Formula: (and (= v_main_~p~0_5 (let ((.cse0 (div v_main_~p~0_6 2))) (ite (and (< v_main_~p~0_6 0) (not (= (mod v_main_~p~0_6 2) 0))) (+ .cse0 1) .cse0))) (= v_main_~d~0_4 (let ((.cse1 (div v_main_~d~0_5 2))) (ite (and (< v_main_~d~0_5 0) (not (= (mod v_main_~d~0_5 2) 0))) (+ .cse1 1) .cse1))) (not (= v_main_~p~0_6 1))) InVars {main_~p~0=v_main_~p~0_6, main_~d~0=v_main_~d~0_5} OutVars{main_~p~0=v_main_~p~0_5, main_~d~0=v_main_~d~0_4} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2627#true} is VALID [2022-04-27 19:14:26,256 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2627#true} {2627#true} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2627#true} is VALID [2022-04-27 19:14:26,256 INFO L290 TraceCheckUtils]: 55: Hoare triple {2627#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,256 INFO L290 TraceCheckUtils]: 54: Hoare triple {2627#true} [124] 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[] {2627#true} is VALID [2022-04-27 19:14:26,256 INFO L290 TraceCheckUtils]: 53: Hoare triple {2627#true} [119] __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] {2627#true} is VALID [2022-04-27 19:14:26,256 INFO L272 TraceCheckUtils]: 52: Hoare triple {2627#true} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2627#true} is VALID [2022-04-27 19:14:26,256 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2627#true} {2627#true} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {2627#true} is VALID [2022-04-27 19:14:26,256 INFO L290 TraceCheckUtils]: 50: Hoare triple {2627#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,256 INFO L290 TraceCheckUtils]: 49: Hoare triple {2627#true} [124] 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[] {2627#true} is VALID [2022-04-27 19:14:26,257 INFO L290 TraceCheckUtils]: 48: Hoare triple {2627#true} [119] __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] {2627#true} is VALID [2022-04-27 19:14:26,257 INFO L272 TraceCheckUtils]: 47: Hoare triple {2627#true} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {2627#true} is VALID [2022-04-27 19:14:26,257 INFO L290 TraceCheckUtils]: 46: Hoare triple {2627#true} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,257 INFO L290 TraceCheckUtils]: 45: Hoare triple {2627#true} [128] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_9)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,257 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2627#true} {2627#true} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2627#true} is VALID [2022-04-27 19:14:26,257 INFO L290 TraceCheckUtils]: 43: Hoare triple {2627#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {2627#true} [124] 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[] {2627#true} is VALID [2022-04-27 19:14:26,257 INFO L290 TraceCheckUtils]: 41: Hoare triple {2627#true} [119] __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] {2627#true} is VALID [2022-04-27 19:14:26,257 INFO L272 TraceCheckUtils]: 40: Hoare triple {2627#true} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2627#true} is VALID [2022-04-27 19:14:26,257 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2627#true} {2627#true} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2627#true} is VALID [2022-04-27 19:14:26,258 INFO L290 TraceCheckUtils]: 38: Hoare triple {2627#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,258 INFO L290 TraceCheckUtils]: 37: Hoare triple {2627#true} [124] 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[] {2627#true} is VALID [2022-04-27 19:14:26,258 INFO L290 TraceCheckUtils]: 36: Hoare triple {2627#true} [119] __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] {2627#true} is VALID [2022-04-27 19:14:26,258 INFO L272 TraceCheckUtils]: 35: Hoare triple {2627#true} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2627#true} is VALID [2022-04-27 19:14:26,258 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2627#true} {2627#true} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2627#true} is VALID [2022-04-27 19:14:26,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {2627#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,258 INFO L290 TraceCheckUtils]: 32: Hoare triple {2627#true} [124] 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[] {2627#true} is VALID [2022-04-27 19:14:26,258 INFO L290 TraceCheckUtils]: 31: Hoare triple {2627#true} [119] __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] {2627#true} is VALID [2022-04-27 19:14:26,258 INFO L272 TraceCheckUtils]: 30: Hoare triple {2627#true} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2627#true} is VALID [2022-04-27 19:14:26,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {2627#true} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {2627#true} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2627#true} is VALID [2022-04-27 19:14:26,259 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2627#true} {2627#true} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2627#true} is VALID [2022-04-27 19:14:26,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {2627#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {2627#true} [124] 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[] {2627#true} is VALID [2022-04-27 19:14:26,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {2627#true} [119] __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] {2627#true} is VALID [2022-04-27 19:14:26,259 INFO L272 TraceCheckUtils]: 23: Hoare triple {2627#true} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2627#true} is VALID [2022-04-27 19:14:26,259 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2627#true} {2627#true} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2627#true} is VALID [2022-04-27 19:14:26,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {2627#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {2627#true} [124] 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[] {2627#true} is VALID [2022-04-27 19:14:26,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {2627#true} [119] __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] {2627#true} is VALID [2022-04-27 19:14:26,260 INFO L272 TraceCheckUtils]: 18: Hoare triple {2627#true} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2627#true} is VALID [2022-04-27 19:14:26,260 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2627#true} {2627#true} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2627#true} is VALID [2022-04-27 19:14:26,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {2627#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {2627#true} [124] 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[] {2627#true} is VALID [2022-04-27 19:14:26,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {2627#true} [119] __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] {2627#true} is VALID [2022-04-27 19:14:26,260 INFO L272 TraceCheckUtils]: 13: Hoare triple {2627#true} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2627#true} is VALID [2022-04-27 19:14:26,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {2627#true} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {2627#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {2627#true} is VALID [2022-04-27 19:14:26,260 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2627#true} {2627#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2627#true} is VALID [2022-04-27 19:14:26,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {2627#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {2627#true} [110] 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[] {2627#true} is VALID [2022-04-27 19:14:26,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {2627#true} [105] 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] {2627#true} is VALID [2022-04-27 19:14:26,261 INFO L272 TraceCheckUtils]: 6: Hoare triple {2627#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2627#true} is VALID [2022-04-27 19:14:26,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {2627#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2627#true} is VALID [2022-04-27 19:14:26,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {2627#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2627#true} {2627#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {2627#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {2627#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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 .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {2627#true} is VALID [2022-04-27 19:14:26,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {2627#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2627#true} is VALID [2022-04-27 19:14:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-04-27 19:14:26,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:14:26,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974876561] [2022-04-27 19:14:26,262 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:14:26,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668049422] [2022-04-27 19:14:26,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668049422] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 19:14:26,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 19:14:26,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-04-27 19:14:26,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471247447] [2022-04-27 19:14:26,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 19:14:26,264 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) Word has length 75 [2022-04-27 19:14:26,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:14:26,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 19:14:26,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:14:26,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 19:14:26,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:14:26,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 19:14:26,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-27 19:14:26,332 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 19:14:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:27,336 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2022-04-27 19:14:27,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 19:14:27,336 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) Word has length 75 [2022-04-27 19:14:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:14:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 19:14:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 97 transitions. [2022-04-27 19:14:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 19:14:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 97 transitions. [2022-04-27 19:14:27,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 97 transitions. [2022-04-27 19:14:27,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:14:27,474 INFO L225 Difference]: With dead ends: 134 [2022-04-27 19:14:27,474 INFO L226 Difference]: Without dead ends: 115 [2022-04-27 19:14:27,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 133 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-04-27 19:14:27,474 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 39 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 19:14:27,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 114 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 19:14:27,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-27 19:14:27,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2022-04-27 19:14:27,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:14:27,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 101 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 64 states have internal predecessors, (71), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 19:14:27,482 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 101 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 64 states have internal predecessors, (71), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 19:14:27,482 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 101 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 64 states have internal predecessors, (71), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 19:14:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:27,487 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2022-04-27 19:14:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2022-04-27 19:14:27,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:27,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:27,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 64 states have internal predecessors, (71), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 115 states. [2022-04-27 19:14:27,488 INFO L87 Difference]: Start difference. First operand has 101 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 64 states have internal predecessors, (71), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 115 states. [2022-04-27 19:14:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:27,492 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2022-04-27 19:14:27,492 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2022-04-27 19:14:27,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:27,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:27,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:14:27,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:14:27,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 64 states have internal predecessors, (71), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 19:14:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2022-04-27 19:14:27,497 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 75 [2022-04-27 19:14:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:14:27,497 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2022-04-27 19:14:27,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 19:14:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2022-04-27 19:14:27,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 19:14:27,498 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:14:27,498 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 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 19:14:27,519 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 19:14:27,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:14:27,712 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:14:27,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:14:27,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1480109990, now seen corresponding path program 1 times [2022-04-27 19:14:27,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:14:27,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091723642] [2022-04-27 19:14:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:14:27,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:14:27,748 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:14:27,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1941057382] [2022-04-27 19:14:27,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:14:27,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:14:27,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:14:27,752 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 19:14:27,759 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 19:14:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:27,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 19:14:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:27,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:14:29,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {3560#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3560#true} is VALID [2022-04-27 19:14:29,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {3560#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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 .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {3560#true} is VALID [2022-04-27 19:14:29,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {3560#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3560#true} is VALID [2022-04-27 19:14:29,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3560#true} {3560#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3560#true} is VALID [2022-04-27 19:14:29,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {3560#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3560#true} is VALID [2022-04-27 19:14:29,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {3560#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {3560#true} is VALID [2022-04-27 19:14:29,844 INFO L272 TraceCheckUtils]: 6: Hoare triple {3560#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {3560#true} is VALID [2022-04-27 19:14:29,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {3560#true} [105] 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] {3560#true} is VALID [2022-04-27 19:14:29,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {3560#true} [110] 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[] {3560#true} is VALID [2022-04-27 19:14:29,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {3560#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3560#true} is VALID [2022-04-27 19:14:29,845 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3560#true} {3560#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {3560#true} is VALID [2022-04-27 19:14:29,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {3560#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {3598#(<= 1 main_~p~0)} is VALID [2022-04-27 19:14:29,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {3598#(<= 1 main_~p~0)} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3598#(<= 1 main_~p~0)} is VALID [2022-04-27 19:14:29,851 INFO L272 TraceCheckUtils]: 13: Hoare triple {3598#(<= 1 main_~p~0)} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3560#true} is VALID [2022-04-27 19:14:29,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {3560#true} [119] __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] {3560#true} is VALID [2022-04-27 19:14:29,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {3560#true} [124] 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[] {3560#true} is VALID [2022-04-27 19:14:29,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {3560#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3560#true} is VALID [2022-04-27 19:14:29,851 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3560#true} {3598#(<= 1 main_~p~0)} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3598#(<= 1 main_~p~0)} is VALID [2022-04-27 19:14:29,851 INFO L272 TraceCheckUtils]: 18: Hoare triple {3598#(<= 1 main_~p~0)} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3560#true} is VALID [2022-04-27 19:14:29,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {3560#true} [119] __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] {3560#true} is VALID [2022-04-27 19:14:29,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {3560#true} [124] 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[] {3560#true} is VALID [2022-04-27 19:14:29,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {3560#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3560#true} is VALID [2022-04-27 19:14:29,852 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3560#true} {3598#(<= 1 main_~p~0)} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3598#(<= 1 main_~p~0)} is VALID [2022-04-27 19:14:29,852 INFO L272 TraceCheckUtils]: 23: Hoare triple {3598#(<= 1 main_~p~0)} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3560#true} is VALID [2022-04-27 19:14:29,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {3560#true} [119] __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] {3560#true} is VALID [2022-04-27 19:14:29,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {3560#true} [124] 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[] {3560#true} is VALID [2022-04-27 19:14:29,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {3560#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3560#true} is VALID [2022-04-27 19:14:29,853 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3560#true} {3598#(<= 1 main_~p~0)} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3598#(<= 1 main_~p~0)} is VALID [2022-04-27 19:14:29,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {3598#(<= 1 main_~p~0)} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {3650#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 19:14:29,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {3650#(<= 1 (div main_~p~0 2))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3650#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 19:14:29,854 INFO L272 TraceCheckUtils]: 30: Hoare triple {3650#(<= 1 (div main_~p~0 2))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3560#true} is VALID [2022-04-27 19:14:29,854 INFO L290 TraceCheckUtils]: 31: Hoare triple {3560#true} [119] __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] {3560#true} is VALID [2022-04-27 19:14:29,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {3560#true} [124] 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[] {3560#true} is VALID [2022-04-27 19:14:29,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {3560#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3560#true} is VALID [2022-04-27 19:14:29,864 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3560#true} {3650#(<= 1 (div main_~p~0 2))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3650#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 19:14:29,864 INFO L272 TraceCheckUtils]: 35: Hoare triple {3650#(<= 1 (div main_~p~0 2))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3560#true} is VALID [2022-04-27 19:14:29,864 INFO L290 TraceCheckUtils]: 36: Hoare triple {3560#true} [119] __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] {3560#true} is VALID [2022-04-27 19:14:29,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {3560#true} [124] 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[] {3560#true} is VALID [2022-04-27 19:14:29,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {3560#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3560#true} is VALID [2022-04-27 19:14:29,865 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3560#true} {3650#(<= 1 (div main_~p~0 2))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3650#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 19:14:29,865 INFO L272 TraceCheckUtils]: 40: Hoare triple {3650#(<= 1 (div main_~p~0 2))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3560#true} is VALID [2022-04-27 19:14:29,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {3560#true} [119] __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] {3560#true} is VALID [2022-04-27 19:14:29,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {3560#true} [124] 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[] {3560#true} is VALID [2022-04-27 19:14:29,865 INFO L290 TraceCheckUtils]: 43: Hoare triple {3560#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3560#true} is VALID [2022-04-27 19:14:29,866 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3560#true} {3650#(<= 1 (div main_~p~0 2))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3650#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 19:14:29,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {3650#(<= 1 (div main_~p~0 2))} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {3702#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 19:14:29,868 INFO L290 TraceCheckUtils]: 46: Hoare triple {3702#(<= 1 (div (div main_~p~0 2) 2))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3702#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 19:14:29,868 INFO L272 TraceCheckUtils]: 47: Hoare triple {3702#(<= 1 (div (div main_~p~0 2) 2))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3560#true} is VALID [2022-04-27 19:14:29,868 INFO L290 TraceCheckUtils]: 48: Hoare triple {3560#true} [119] __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] {3560#true} is VALID [2022-04-27 19:14:29,868 INFO L290 TraceCheckUtils]: 49: Hoare triple {3560#true} [124] 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[] {3560#true} is VALID [2022-04-27 19:14:29,868 INFO L290 TraceCheckUtils]: 50: Hoare triple {3560#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3560#true} is VALID [2022-04-27 19:14:29,869 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3560#true} {3702#(<= 1 (div (div main_~p~0 2) 2))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3702#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 19:14:29,869 INFO L272 TraceCheckUtils]: 52: Hoare triple {3702#(<= 1 (div (div main_~p~0 2) 2))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3560#true} is VALID [2022-04-27 19:14:29,869 INFO L290 TraceCheckUtils]: 53: Hoare triple {3560#true} [119] __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] {3560#true} is VALID [2022-04-27 19:14:29,869 INFO L290 TraceCheckUtils]: 54: Hoare triple {3560#true} [124] 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[] {3560#true} is VALID [2022-04-27 19:14:29,869 INFO L290 TraceCheckUtils]: 55: Hoare triple {3560#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3560#true} is VALID [2022-04-27 19:14:29,870 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3560#true} {3702#(<= 1 (div (div main_~p~0 2) 2))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3702#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 19:14:29,870 INFO L272 TraceCheckUtils]: 57: Hoare triple {3702#(<= 1 (div (div main_~p~0 2) 2))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3560#true} is VALID [2022-04-27 19:14:29,870 INFO L290 TraceCheckUtils]: 58: Hoare triple {3560#true} [119] __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] {3560#true} is VALID [2022-04-27 19:14:29,870 INFO L290 TraceCheckUtils]: 59: Hoare triple {3560#true} [124] 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[] {3560#true} is VALID [2022-04-27 19:14:29,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {3560#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3560#true} is VALID [2022-04-27 19:14:29,871 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3560#true} {3702#(<= 1 (div (div main_~p~0 2) 2))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3702#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 19:14:29,871 INFO L290 TraceCheckUtils]: 62: Hoare triple {3702#(<= 1 (div (div main_~p~0 2) 2))} [128] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_9)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {3702#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 19:14:29,871 INFO L290 TraceCheckUtils]: 63: Hoare triple {3702#(<= 1 (div (div main_~p~0 2) 2))} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3702#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 19:14:29,871 INFO L272 TraceCheckUtils]: 64: Hoare triple {3702#(<= 1 (div (div main_~p~0 2) 2))} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {3560#true} is VALID [2022-04-27 19:14:29,872 INFO L290 TraceCheckUtils]: 65: Hoare triple {3560#true} [119] __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] {3560#true} is VALID [2022-04-27 19:14:29,872 INFO L290 TraceCheckUtils]: 66: Hoare triple {3560#true} [124] 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[] {3560#true} is VALID [2022-04-27 19:14:29,872 INFO L290 TraceCheckUtils]: 67: Hoare triple {3560#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3560#true} is VALID [2022-04-27 19:14:29,872 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3560#true} {3702#(<= 1 (div (div main_~p~0 2) 2))} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {3702#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 19:14:29,873 INFO L272 TraceCheckUtils]: 69: Hoare triple {3702#(<= 1 (div (div main_~p~0 2) 2))} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3560#true} is VALID [2022-04-27 19:14:29,873 INFO L290 TraceCheckUtils]: 70: Hoare triple {3560#true} [119] __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] {3560#true} is VALID [2022-04-27 19:14:29,873 INFO L290 TraceCheckUtils]: 71: Hoare triple {3560#true} [124] 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[] {3560#true} is VALID [2022-04-27 19:14:29,873 INFO L290 TraceCheckUtils]: 72: Hoare triple {3560#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3560#true} is VALID [2022-04-27 19:14:29,873 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3560#true} {3702#(<= 1 (div (div main_~p~0 2) 2))} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3702#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 19:14:29,874 INFO L290 TraceCheckUtils]: 74: Hoare triple {3702#(<= 1 (div (div main_~p~0 2) 2))} [126] L46-->L44-1: Formula: (= v_main_~p~0_4 1) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_4} AuxVars[] AssignedVars[] {3561#false} is VALID [2022-04-27 19:14:29,874 INFO L272 TraceCheckUtils]: 75: Hoare triple {3561#false} [116] L44-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_12 (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_12, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {3561#false} is VALID [2022-04-27 19:14:29,874 INFO L290 TraceCheckUtils]: 76: Hoare triple {3561#false} [119] __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] {3561#false} is VALID [2022-04-27 19:14:29,874 INFO L290 TraceCheckUtils]: 77: Hoare triple {3561#false} [124] 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[] {3561#false} is VALID [2022-04-27 19:14:29,874 INFO L290 TraceCheckUtils]: 78: Hoare triple {3561#false} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3561#false} is VALID [2022-04-27 19:14:29,874 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {3561#false} {3561#false} [143] __VERIFIER_assertEXIT-->L58: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_12 (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_12, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {3561#false} is VALID [2022-04-27 19:14:29,874 INFO L272 TraceCheckUtils]: 80: Hoare triple {3561#false} [120] L58-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (= v_main_~B~0_10 v_main_~d~0_17) 1 0)) InVars {main_~d~0=v_main_~d~0_17, main_~B~0=v_main_~B~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0] {3561#false} is VALID [2022-04-27 19:14:29,874 INFO L290 TraceCheckUtils]: 81: Hoare triple {3561#false} [119] __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] {3561#false} is VALID [2022-04-27 19:14:29,874 INFO L290 TraceCheckUtils]: 82: Hoare triple {3561#false} [123] 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[] {3561#false} is VALID [2022-04-27 19:14:29,875 INFO L290 TraceCheckUtils]: 83: Hoare triple {3561#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3561#false} is VALID [2022-04-27 19:14:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-04-27 19:14:29,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 19:14:29,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:14:29,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091723642] [2022-04-27 19:14:29,876 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:14:29,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941057382] [2022-04-27 19:14:29,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941057382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:14:29,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:14:29,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 19:14:29,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59806114] [2022-04-27 19:14:29,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:14:29,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 84 [2022-04-27 19:14:29,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:14:29,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 19:14:29,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:14:29,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 19:14:29,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:14:29,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 19:14:29,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-27 19:14:29,929 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 19:14:30,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:30,072 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-04-27 19:14:30,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 19:14:30,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 84 [2022-04-27 19:14:30,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:14:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 19:14:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 19:14:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 19:14:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 19:14:30,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-27 19:14:30,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:14:30,145 INFO L225 Difference]: With dead ends: 103 [2022-04-27 19:14:30,145 INFO L226 Difference]: Without dead ends: 103 [2022-04-27 19:14:30,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-27 19:14:30,146 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 14 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:14:30,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 82 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:14:30,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-27 19:14:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-27 19:14:30,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:14:30,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 64 states have internal predecessors, (72), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 19:14:30,153 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 64 states have internal predecessors, (72), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 19:14:30,153 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 64 states have internal predecessors, (72), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 19:14:30,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:30,156 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-04-27 19:14:30,156 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2022-04-27 19:14:30,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:30,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:30,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 64 states have internal predecessors, (72), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 103 states. [2022-04-27 19:14:30,157 INFO L87 Difference]: Start difference. First operand has 103 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 64 states have internal predecessors, (72), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 103 states. [2022-04-27 19:14:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:30,160 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-04-27 19:14:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2022-04-27 19:14:30,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:30,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:30,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:14:30,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:14:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 64 states have internal predecessors, (72), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 19:14:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2022-04-27 19:14:30,164 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 84 [2022-04-27 19:14:30,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:14:30,165 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2022-04-27 19:14:30,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 19:14:30,165 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2022-04-27 19:14:30,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-27 19:14:30,166 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:14:30,166 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:14:30,190 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 19:14:30,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:14:30,372 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:14:30,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:14:30,372 INFO L85 PathProgramCache]: Analyzing trace with hash -233495842, now seen corresponding path program 2 times [2022-04-27 19:14:30,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:14:30,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248957645] [2022-04-27 19:14:30,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:14:30,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:14:30,385 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:14:30,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [474962612] [2022-04-27 19:14:30,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 19:14:30,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:14:30,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:14:30,387 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 19:14:30,411 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 19:14:30,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 19:14:30,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 19:14:30,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 19:14:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:14:30,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:14:31,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {4228#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4228#true} is VALID [2022-04-27 19:14:31,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {4228#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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 .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {4228#true} is VALID [2022-04-27 19:14:31,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {4228#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4228#true} is VALID [2022-04-27 19:14:31,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4228#true} {4228#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4228#true} is VALID [2022-04-27 19:14:31,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {4228#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4228#true} is VALID [2022-04-27 19:14:31,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {4228#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {4228#true} is VALID [2022-04-27 19:14:31,076 INFO L272 TraceCheckUtils]: 6: Hoare triple {4228#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {4228#true} is VALID [2022-04-27 19:14:31,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {4228#true} [105] 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] {4254#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 19:14:31,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {4254#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [110] 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[] {4258#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 19:14:31,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {4258#(not (= |assume_abort_if_not_#in~cond| 0))} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4258#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 19:14:31,078 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4258#(not (= |assume_abort_if_not_#in~cond| 0))} {4228#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {4265#(and (<= 0 main_~A~0) (<= main_~A~0 1))} is VALID [2022-04-27 19:14:31,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {4265#(and (<= 0 main_~A~0) (<= main_~A~0 1))} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {4269#(and (<= main_~r~0 1) (<= 1 main_~d~0))} is VALID [2022-04-27 19:14:31,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {4269#(and (<= main_~r~0 1) (<= 1 main_~d~0))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4269#(and (<= main_~r~0 1) (<= 1 main_~d~0))} is VALID [2022-04-27 19:14:31,079 INFO L272 TraceCheckUtils]: 13: Hoare triple {4269#(and (<= main_~r~0 1) (<= 1 main_~d~0))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {4228#true} is VALID [2022-04-27 19:14:31,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {4228#true} [119] __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] {4228#true} is VALID [2022-04-27 19:14:31,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {4228#true} [124] 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[] {4228#true} is VALID [2022-04-27 19:14:31,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {4228#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4228#true} is VALID [2022-04-27 19:14:31,079 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4228#true} {4269#(and (<= main_~r~0 1) (<= 1 main_~d~0))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {4269#(and (<= main_~r~0 1) (<= 1 main_~d~0))} is VALID [2022-04-27 19:14:31,079 INFO L272 TraceCheckUtils]: 18: Hoare triple {4269#(and (<= main_~r~0 1) (<= 1 main_~d~0))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {4228#true} is VALID [2022-04-27 19:14:31,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {4228#true} [119] __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] {4228#true} is VALID [2022-04-27 19:14:31,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {4228#true} [124] 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[] {4228#true} is VALID [2022-04-27 19:14:31,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {4228#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4228#true} is VALID [2022-04-27 19:14:31,080 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4228#true} {4269#(and (<= main_~r~0 1) (<= 1 main_~d~0))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {4269#(and (<= main_~r~0 1) (<= 1 main_~d~0))} is VALID [2022-04-27 19:14:31,080 INFO L272 TraceCheckUtils]: 23: Hoare triple {4269#(and (<= main_~r~0 1) (<= 1 main_~d~0))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4228#true} is VALID [2022-04-27 19:14:31,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {4228#true} [119] __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] {4228#true} is VALID [2022-04-27 19:14:31,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {4228#true} [124] 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[] {4228#true} is VALID [2022-04-27 19:14:31,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {4228#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4228#true} is VALID [2022-04-27 19:14:31,081 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4228#true} {4269#(and (<= main_~r~0 1) (<= 1 main_~d~0))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4269#(and (<= main_~r~0 1) (<= 1 main_~d~0))} is VALID [2022-04-27 19:14:31,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {4269#(and (<= main_~r~0 1) (<= 1 main_~d~0))} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {4321#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} is VALID [2022-04-27 19:14:31,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {4321#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4321#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} is VALID [2022-04-27 19:14:31,082 INFO L272 TraceCheckUtils]: 30: Hoare triple {4321#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {4228#true} is VALID [2022-04-27 19:14:31,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {4228#true} [119] __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] {4228#true} is VALID [2022-04-27 19:14:31,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {4228#true} [124] 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[] {4228#true} is VALID [2022-04-27 19:14:31,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {4228#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4228#true} is VALID [2022-04-27 19:14:31,083 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4228#true} {4321#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {4321#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} is VALID [2022-04-27 19:14:31,083 INFO L272 TraceCheckUtils]: 35: Hoare triple {4321#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {4228#true} is VALID [2022-04-27 19:14:31,083 INFO L290 TraceCheckUtils]: 36: Hoare triple {4228#true} [119] __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] {4228#true} is VALID [2022-04-27 19:14:31,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {4228#true} [124] 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[] {4228#true} is VALID [2022-04-27 19:14:31,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {4228#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4228#true} is VALID [2022-04-27 19:14:31,084 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4228#true} {4321#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {4321#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} is VALID [2022-04-27 19:14:31,084 INFO L272 TraceCheckUtils]: 40: Hoare triple {4321#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4228#true} is VALID [2022-04-27 19:14:31,084 INFO L290 TraceCheckUtils]: 41: Hoare triple {4228#true} [119] __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] {4228#true} is VALID [2022-04-27 19:14:31,084 INFO L290 TraceCheckUtils]: 42: Hoare triple {4228#true} [124] 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[] {4228#true} is VALID [2022-04-27 19:14:31,084 INFO L290 TraceCheckUtils]: 43: Hoare triple {4228#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4228#true} is VALID [2022-04-27 19:14:31,085 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4228#true} {4321#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4321#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} is VALID [2022-04-27 19:14:31,086 INFO L290 TraceCheckUtils]: 45: Hoare triple {4321#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {4229#false} is VALID [2022-04-27 19:14:31,086 INFO L290 TraceCheckUtils]: 46: Hoare triple {4229#false} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4229#false} is VALID [2022-04-27 19:14:31,086 INFO L272 TraceCheckUtils]: 47: Hoare triple {4229#false} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {4229#false} is VALID [2022-04-27 19:14:31,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {4229#false} [119] __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] {4229#false} is VALID [2022-04-27 19:14:31,086 INFO L290 TraceCheckUtils]: 49: Hoare triple {4229#false} [124] 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[] {4229#false} is VALID [2022-04-27 19:14:31,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {4229#false} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4229#false} is VALID [2022-04-27 19:14:31,086 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4229#false} {4229#false} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {4229#false} is VALID [2022-04-27 19:14:31,086 INFO L272 TraceCheckUtils]: 52: Hoare triple {4229#false} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {4229#false} is VALID [2022-04-27 19:14:31,086 INFO L290 TraceCheckUtils]: 53: Hoare triple {4229#false} [119] __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] {4229#false} is VALID [2022-04-27 19:14:31,086 INFO L290 TraceCheckUtils]: 54: Hoare triple {4229#false} [124] 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[] {4229#false} is VALID [2022-04-27 19:14:31,086 INFO L290 TraceCheckUtils]: 55: Hoare triple {4229#false} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4229#false} is VALID [2022-04-27 19:14:31,086 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4229#false} {4229#false} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {4229#false} is VALID [2022-04-27 19:14:31,087 INFO L272 TraceCheckUtils]: 57: Hoare triple {4229#false} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4229#false} is VALID [2022-04-27 19:14:31,087 INFO L290 TraceCheckUtils]: 58: Hoare triple {4229#false} [119] __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] {4229#false} is VALID [2022-04-27 19:14:31,087 INFO L290 TraceCheckUtils]: 59: Hoare triple {4229#false} [124] 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[] {4229#false} is VALID [2022-04-27 19:14:31,087 INFO L290 TraceCheckUtils]: 60: Hoare triple {4229#false} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4229#false} is VALID [2022-04-27 19:14:31,087 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4229#false} {4229#false} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4229#false} is VALID [2022-04-27 19:14:31,087 INFO L290 TraceCheckUtils]: 62: Hoare triple {4229#false} [128] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_9)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {4229#false} is VALID [2022-04-27 19:14:31,087 INFO L290 TraceCheckUtils]: 63: Hoare triple {4229#false} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4229#false} is VALID [2022-04-27 19:14:31,087 INFO L272 TraceCheckUtils]: 64: Hoare triple {4229#false} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {4229#false} is VALID [2022-04-27 19:14:31,087 INFO L290 TraceCheckUtils]: 65: Hoare triple {4229#false} [119] __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] {4229#false} is VALID [2022-04-27 19:14:31,087 INFO L290 TraceCheckUtils]: 66: Hoare triple {4229#false} [124] 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[] {4229#false} is VALID [2022-04-27 19:14:31,087 INFO L290 TraceCheckUtils]: 67: Hoare triple {4229#false} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4229#false} is VALID [2022-04-27 19:14:31,090 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4229#false} {4229#false} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {4229#false} is VALID [2022-04-27 19:14:31,090 INFO L272 TraceCheckUtils]: 69: Hoare triple {4229#false} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4229#false} is VALID [2022-04-27 19:14:31,090 INFO L290 TraceCheckUtils]: 70: Hoare triple {4229#false} [119] __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] {4229#false} is VALID [2022-04-27 19:14:31,091 INFO L290 TraceCheckUtils]: 71: Hoare triple {4229#false} [124] 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[] {4229#false} is VALID [2022-04-27 19:14:31,091 INFO L290 TraceCheckUtils]: 72: Hoare triple {4229#false} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4229#false} is VALID [2022-04-27 19:14:31,091 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4229#false} {4229#false} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4229#false} is VALID [2022-04-27 19:14:31,091 INFO L290 TraceCheckUtils]: 74: Hoare triple {4229#false} [127] L46-->L52: Formula: (and (= v_main_~p~0_5 (let ((.cse0 (div v_main_~p~0_6 2))) (ite (and (< v_main_~p~0_6 0) (not (= (mod v_main_~p~0_6 2) 0))) (+ .cse0 1) .cse0))) (= v_main_~d~0_4 (let ((.cse1 (div v_main_~d~0_5 2))) (ite (and (< v_main_~d~0_5 0) (not (= (mod v_main_~d~0_5 2) 0))) (+ .cse1 1) .cse1))) (not (= v_main_~p~0_6 1))) InVars {main_~p~0=v_main_~p~0_6, main_~d~0=v_main_~d~0_5} OutVars{main_~p~0=v_main_~p~0_5, main_~d~0=v_main_~d~0_4} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {4229#false} is VALID [2022-04-27 19:14:31,091 INFO L290 TraceCheckUtils]: 75: Hoare triple {4229#false} [134] L52-->L52-2: Formula: (and (<= v_main_~d~0_6 v_main_~r~0_5) (= (+ v_main_~p~0_7 v_main_~q~0_5) v_main_~q~0_4) (= v_main_~r~0_4 (+ v_main_~r~0_5 (* (- 1) v_main_~d~0_6)))) InVars {main_~q~0=v_main_~q~0_5, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_4, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {4229#false} is VALID [2022-04-27 19:14:31,091 INFO L290 TraceCheckUtils]: 76: Hoare triple {4229#false} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4229#false} is VALID [2022-04-27 19:14:31,091 INFO L272 TraceCheckUtils]: 77: Hoare triple {4229#false} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {4229#false} is VALID [2022-04-27 19:14:31,091 INFO L290 TraceCheckUtils]: 78: Hoare triple {4229#false} [119] __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] {4229#false} is VALID [2022-04-27 19:14:31,091 INFO L290 TraceCheckUtils]: 79: Hoare triple {4229#false} [124] 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[] {4229#false} is VALID [2022-04-27 19:14:31,091 INFO L290 TraceCheckUtils]: 80: Hoare triple {4229#false} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4229#false} is VALID [2022-04-27 19:14:31,091 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {4229#false} {4229#false} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {4229#false} is VALID [2022-04-27 19:14:31,092 INFO L272 TraceCheckUtils]: 82: Hoare triple {4229#false} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4229#false} is VALID [2022-04-27 19:14:31,092 INFO L290 TraceCheckUtils]: 83: Hoare triple {4229#false} [119] __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] {4229#false} is VALID [2022-04-27 19:14:31,092 INFO L290 TraceCheckUtils]: 84: Hoare triple {4229#false} [124] 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[] {4229#false} is VALID [2022-04-27 19:14:31,092 INFO L290 TraceCheckUtils]: 85: Hoare triple {4229#false} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4229#false} is VALID [2022-04-27 19:14:31,092 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {4229#false} {4229#false} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4229#false} is VALID [2022-04-27 19:14:31,092 INFO L290 TraceCheckUtils]: 87: Hoare triple {4229#false} [127] L46-->L52: Formula: (and (= v_main_~p~0_5 (let ((.cse0 (div v_main_~p~0_6 2))) (ite (and (< v_main_~p~0_6 0) (not (= (mod v_main_~p~0_6 2) 0))) (+ .cse0 1) .cse0))) (= v_main_~d~0_4 (let ((.cse1 (div v_main_~d~0_5 2))) (ite (and (< v_main_~d~0_5 0) (not (= (mod v_main_~d~0_5 2) 0))) (+ .cse1 1) .cse1))) (not (= v_main_~p~0_6 1))) InVars {main_~p~0=v_main_~p~0_6, main_~d~0=v_main_~d~0_5} OutVars{main_~p~0=v_main_~p~0_5, main_~d~0=v_main_~d~0_4} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {4229#false} is VALID [2022-04-27 19:14:31,092 INFO L290 TraceCheckUtils]: 88: Hoare triple {4229#false} [134] L52-->L52-2: Formula: (and (<= v_main_~d~0_6 v_main_~r~0_5) (= (+ v_main_~p~0_7 v_main_~q~0_5) v_main_~q~0_4) (= v_main_~r~0_4 (+ v_main_~r~0_5 (* (- 1) v_main_~d~0_6)))) InVars {main_~q~0=v_main_~q~0_5, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_4, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {4229#false} is VALID [2022-04-27 19:14:31,092 INFO L290 TraceCheckUtils]: 89: Hoare triple {4229#false} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4229#false} is VALID [2022-04-27 19:14:31,092 INFO L272 TraceCheckUtils]: 90: Hoare triple {4229#false} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {4229#false} is VALID [2022-04-27 19:14:31,092 INFO L290 TraceCheckUtils]: 91: Hoare triple {4229#false} [119] __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] {4229#false} is VALID [2022-04-27 19:14:31,092 INFO L290 TraceCheckUtils]: 92: Hoare triple {4229#false} [123] 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[] {4229#false} is VALID [2022-04-27 19:14:31,093 INFO L290 TraceCheckUtils]: 93: Hoare triple {4229#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4229#false} is VALID [2022-04-27 19:14:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-04-27 19:14:31,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 19:14:31,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:14:31,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248957645] [2022-04-27 19:14:31,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:14:31,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474962612] [2022-04-27 19:14:31,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474962612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:14:31,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:14:31,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 19:14:31,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106063793] [2022-04-27 19:14:31,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:14:31,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 94 [2022-04-27 19:14:31,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:14:31,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 19:14:31,145 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 19:14:31,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 19:14:31,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:14:31,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 19:14:31,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 19:14:31,146 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 19:14:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:31,308 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-04-27 19:14:31,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 19:14:31,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 94 [2022-04-27 19:14:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:14:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 19:14:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-27 19:14:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 19:14:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-27 19:14:31,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-27 19:14:31,343 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 19:14:31,343 INFO L225 Difference]: With dead ends: 38 [2022-04-27 19:14:31,343 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 19:14:31,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-27 19:14:31,344 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:14:31,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:14:31,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 19:14:31,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 19:14:31,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:14:31,345 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 19:14:31,345 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 19:14:31,345 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 19:14:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:31,346 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 19:14:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 19:14:31,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:31,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:31,346 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 19:14:31,346 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 19:14:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:14:31,346 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 19:14:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 19:14:31,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:31,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:14:31,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:14:31,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:14:31,346 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 19:14:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 19:14:31,347 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2022-04-27 19:14:31,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:14:31,347 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 19:14:31,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 19:14:31,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 19:14:31,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:14:31,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 19:14:31,377 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 19:14:31,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:14:31,553 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:14:31,555 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 19:14:31,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 07:14:31 BasicIcfg [2022-04-27 19:14:31,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 19:14:31,559 INFO L158 Benchmark]: Toolchain (without parser) took 32658.74ms. Allocated memory was 182.5MB in the beginning and 224.4MB in the end (delta: 41.9MB). Free memory was 130.2MB in the beginning and 118.0MB in the end (delta: 12.2MB). Peak memory consumption was 54.8MB. Max. memory is 8.0GB. [2022-04-27 19:14:31,559 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 19:14:31,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.62ms. Allocated memory is still 182.5MB. Free memory was 130.0MB in the beginning and 157.9MB in the end (delta: -27.8MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-27 19:14:31,563 INFO L158 Benchmark]: Boogie Preprocessor took 33.80ms. Allocated memory is still 182.5MB. Free memory was 157.9MB in the beginning and 156.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 19:14:31,564 INFO L158 Benchmark]: RCFGBuilder took 250.78ms. Allocated memory is still 182.5MB. Free memory was 156.4MB in the beginning and 144.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 19:14:31,564 INFO L158 Benchmark]: IcfgTransformer took 43.17ms. Allocated memory is still 182.5MB. Free memory was 144.9MB in the beginning and 143.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 19:14:31,564 INFO L158 Benchmark]: TraceAbstraction took 32067.88ms. Allocated memory was 182.5MB in the beginning and 224.4MB in the end (delta: 41.9MB). Free memory was 142.9MB in the beginning and 118.0MB in the end (delta: 24.8MB). Peak memory consumption was 67.8MB. Max. memory is 8.0GB. [2022-04-27 19:14:31,566 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 182.5MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.62ms. Allocated memory is still 182.5MB. Free memory was 130.0MB in the beginning and 157.9MB in the end (delta: -27.8MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.80ms. Allocated memory is still 182.5MB. Free memory was 157.9MB in the beginning and 156.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 250.78ms. Allocated memory is still 182.5MB. Free memory was 156.4MB in the beginning and 144.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 43.17ms. Allocated memory is still 182.5MB. Free memory was 144.9MB in the beginning and 143.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 32067.88ms. Allocated memory was 182.5MB in the beginning and 224.4MB in the end (delta: 41.9MB). Free memory was 142.9MB in the beginning and 118.0MB in the end (delta: 24.8MB). Peak memory consumption was 67.8MB. 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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.0s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 209 mSDsluCounter, 934 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 578 mSDsCounter, 228 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1030 IncrementalHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 228 mSolverCounterUnsat, 356 mSDtfsCounter, 1030 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 645 GetRequests, 568 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=7, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 648 ConstructedInterpolants, 0 QuantifiedInterpolants, 3057 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1081 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 1458/1489 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 RESULT: Ultimate proved your program to be correct! [2022-04-27 19:14:31,593 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...