/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/egcd3-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 19:17:29,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 19:17:29,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 19:17:29,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 19:17:29,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 19:17:29,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 19:17:29,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 19:17:29,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 19:17:29,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 19:17:29,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 19:17:29,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 19:17:29,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 19:17:29,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 19:17:29,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 19:17:29,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 19:17:29,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 19:17:29,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 19:17:29,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 19:17:29,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 19:17:29,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 19:17:29,923 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 19:17:29,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 19:17:29,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 19:17:29,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 19:17:29,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 19:17:29,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 19:17:29,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 19:17:29,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 19:17:29,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 19:17:29,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 19:17:29,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 19:17:29,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 19:17:29,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 19:17:29,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 19:17:29,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 19:17:29,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 19:17:29,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 19:17:29,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 19:17:29,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 19:17:29,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 19:17:29,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 19:17:29,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 19:17:29,944 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 19:17:29,952 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 19:17:29,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 19:17:29,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 19:17:29,953 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 19:17:29,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 19:17:29,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 19:17:29,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 19:17:29,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 19:17:29,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 19:17:29,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 19:17:29,955 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 19:17:29,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 19:17:29,960 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 19:17:29,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 19:17:29,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 19:17:29,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 19:17:29,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 19:17:29,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 19:17:29,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:17:29,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 19:17:29,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 19:17:29,961 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 19:17:29,961 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-07 19:17:30,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 19:17:30,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 19:17:30,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 19:17:30,215 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 19:17:30,216 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 19:17:30,217 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound10.c [2022-04-07 19:17:30,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e334d321a/e7d53257bf804e25bb8ddaeba2b0671b/FLAGc0f6591a8 [2022-04-07 19:17:30,626 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 19:17:30,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound10.c [2022-04-07 19:17:30,631 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e334d321a/e7d53257bf804e25bb8ddaeba2b0671b/FLAGc0f6591a8 [2022-04-07 19:17:30,643 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e334d321a/e7d53257bf804e25bb8ddaeba2b0671b [2022-04-07 19:17:30,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 19:17:30,647 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 19:17:30,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 19:17:30,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 19:17:30,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 19:17:30,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:17:30" (1/1) ... [2022-04-07 19:17:30,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40749816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:17:30, skipping insertion in model container [2022-04-07 19:17:30,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:17:30" (1/1) ... [2022-04-07 19:17:30,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 19:17:30,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 19:17:30,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound10.c[490,503] [2022-04-07 19:17:30,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:17:30,892 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 19:17:30,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound10.c[490,503] [2022-04-07 19:17:30,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:17:30,947 INFO L208 MainTranslator]: Completed translation [2022-04-07 19:17:30,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:17:30 WrapperNode [2022-04-07 19:17:30,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 19:17:30,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 19:17:30,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 19:17:30,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 19:17:30,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:17:30" (1/1) ... [2022-04-07 19:17:30,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:17:30" (1/1) ... [2022-04-07 19:17:30,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:17:30" (1/1) ... [2022-04-07 19:17:30,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:17:30" (1/1) ... [2022-04-07 19:17:30,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:17:30" (1/1) ... [2022-04-07 19:17:30,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:17:30" (1/1) ... [2022-04-07 19:17:30,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:17:30" (1/1) ... [2022-04-07 19:17:30,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 19:17:30,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 19:17:30,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 19:17:30,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 19:17:30,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:17:30" (1/1) ... [2022-04-07 19:17:31,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:17:31,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:31,020 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-07 19:17:31,030 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-07 19:17:31,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 19:17:31,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 19:17:31,058 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 19:17:31,058 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 19:17:31,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 19:17:31,058 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 19:17:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 19:17:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 19:17:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 19:17:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 19:17:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 19:17:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 19:17:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 19:17:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 19:17:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 19:17:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 19:17:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 19:17:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 19:17:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 19:17:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 19:17:31,111 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 19:17:31,112 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 19:17:31,311 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 19:17:31,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 19:17:31,317 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-07 19:17:31,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:17:31 BoogieIcfgContainer [2022-04-07 19:17:31,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 19:17:31,319 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 19:17:31,319 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 19:17:31,325 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 19:17:31,328 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:17:31" (1/1) ... [2022-04-07 19:17:31,330 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 19:17:31,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:17:31 BasicIcfg [2022-04-07 19:17:31,376 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 19:17:31,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 19:17:31,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 19:17:31,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 19:17:31,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 07:17:30" (1/4) ... [2022-04-07 19:17:31,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38780136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:17:31, skipping insertion in model container [2022-04-07 19:17:31,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:17:30" (2/4) ... [2022-04-07 19:17:31,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38780136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:17:31, skipping insertion in model container [2022-04-07 19:17:31,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:17:31" (3/4) ... [2022-04-07 19:17:31,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38780136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:17:31, skipping insertion in model container [2022-04-07 19:17:31,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:17:31" (4/4) ... [2022-04-07 19:17:31,389 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound10.cJordan [2022-04-07 19:17:31,393 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 19:17:31,393 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 19:17:31,425 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 19:17:31,430 INFO L340 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 [2022-04-07 19:17:31,431 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 19:17:31,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 19:17:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 19:17:31,452 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:31,453 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:31,453 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:31,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:31,457 INFO L85 PathProgramCache]: Analyzing trace with hash 6304412, now seen corresponding path program 1 times [2022-04-07 19:17:31,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:31,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557731251] [2022-04-07 19:17:31,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:31,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:31,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:17:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:31,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {43#true} is VALID [2022-04-07 19:17:31,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-07 19:17:31,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-07 19:17:31,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 19:17:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:31,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-07 19:17:31,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:17:31,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:17:31,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {44#false} is VALID [2022-04-07 19:17:31,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-07 19:17:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:31,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-07 19:17:31,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:17:31,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:17:31,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {44#false} is VALID [2022-04-07 19:17:31,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:17:31,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {43#true} is VALID [2022-04-07 19:17:31,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-07 19:17:31,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-07 19:17:31,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-07 19:17:31,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {43#true} is VALID [2022-04-07 19:17:31,639 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {43#true} is VALID [2022-04-07 19:17:31,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-07 19:17:31,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:17:31,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:17:31,640 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {44#false} is VALID [2022-04-07 19:17:31,640 INFO L272 TraceCheckUtils]: 11: Hoare triple {44#false} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {43#true} is VALID [2022-04-07 19:17:31,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-07 19:17:31,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:17:31,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:17:31,642 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44#false} {44#false} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {44#false} is VALID [2022-04-07 19:17:31,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#false} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {44#false} is VALID [2022-04-07 19:17:31,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {44#false} [123] L34-3-->L34-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:17:31,643 INFO L272 TraceCheckUtils]: 18: Hoare triple {44#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {44#false} is VALID [2022-04-07 19:17:31,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44#false} is VALID [2022-04-07 19:17:31,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:17:31,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {44#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:17:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:17:31,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:17:31,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557731251] [2022-04-07 19:17:31,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557731251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:17:31,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:17:31,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 19:17:31,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675027511] [2022-04-07 19:17:31,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:17:31,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 19:17:31,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:17:31,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:31,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:31,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 19:17:31,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:17:31,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 19:17:31,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:17:31,710 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:31,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:31,904 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-07 19:17:31,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 19:17:31,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 19:17:31,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:17:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-04-07 19:17:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-04-07 19:17:31,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2022-04-07 19:17:31,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:32,004 INFO L225 Difference]: With dead ends: 41 [2022-04-07 19:17:32,004 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 19:17:32,006 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:17:32,013 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:17:32,016 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:17:32,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 19:17:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-07 19:17:32,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:17:32,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:17:32,046 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:17:32,048 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:17:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:32,065 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-07 19:17:32,066 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-07 19:17:32,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:32,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:32,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-07 19:17:32,067 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-07 19:17:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:32,071 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-07 19:17:32,071 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-07 19:17:32,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:32,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:32,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:17:32,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:17:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:17:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-04-07 19:17:32,079 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22 [2022-04-07 19:17:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:17:32,080 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-04-07 19:17:32,081 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:32,082 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-07 19:17:32,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 19:17:32,083 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:32,083 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:32,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 19:17:32,084 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:32,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:32,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1535904754, now seen corresponding path program 1 times [2022-04-07 19:17:32,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:32,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964847472] [2022-04-07 19:17:32,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:32,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:32,129 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:17:32,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [470191613] [2022-04-07 19:17:32,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:32,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:32,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:32,139 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-07 19:17:32,169 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-07 19:17:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:32,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 19:17:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:32,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:17:32,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {207#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#true} is VALID [2022-04-07 19:17:32,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {207#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:32,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:32,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#(<= ~counter~0 0)} {207#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:32,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:32,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:32,442 INFO L272 TraceCheckUtils]: 6: Hoare triple {215#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:32,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {215#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:32,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {215#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:32,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {215#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:32,445 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {215#(<= ~counter~0 0)} {215#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:32,446 INFO L272 TraceCheckUtils]: 11: Hoare triple {215#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:32,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {215#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:32,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {215#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:32,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {215#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:32,452 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {215#(<= ~counter~0 0)} {215#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:32,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {215#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:32,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {215#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {264#(<= |main_#t~post6| 0)} is VALID [2022-04-07 19:17:32,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {264#(<= |main_#t~post6| 0)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {208#false} is VALID [2022-04-07 19:17:32,457 INFO L272 TraceCheckUtils]: 19: Hoare triple {208#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {208#false} is VALID [2022-04-07 19:17:32,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {208#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {208#false} is VALID [2022-04-07 19:17:32,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {208#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {208#false} is VALID [2022-04-07 19:17:32,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {208#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#false} is VALID [2022-04-07 19:17:32,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:17:32,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:17:32,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:17:32,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964847472] [2022-04-07 19:17:32,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:17:32,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470191613] [2022-04-07 19:17:32,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470191613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:17:32,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:17:32,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 19:17:32,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89477402] [2022-04-07 19:17:32,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:17:32,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-07 19:17:32,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:17:32,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:32,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:32,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 19:17:32,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:17:32,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 19:17:32,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 19:17:32,479 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:32,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:32,559 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-07 19:17:32,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 19:17:32,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-07 19:17:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:17:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-07 19:17:32,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-07 19:17:32,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2022-04-07 19:17:32,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:32,604 INFO L225 Difference]: With dead ends: 37 [2022-04-07 19:17:32,604 INFO L226 Difference]: Without dead ends: 37 [2022-04-07 19:17:32,604 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 19:17:32,606 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:17:32,606 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:17:32,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-07 19:17:32,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-07 19:17:32,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:17:32,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:17:32,610 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:17:32,611 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:17:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:32,614 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-07 19:17:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-07 19:17:32,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:32,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:32,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-07 19:17:32,615 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-07 19:17:32,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:32,618 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-07 19:17:32,618 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-07 19:17:32,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:32,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:32,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:17:32,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:17:32,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:17:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-07 19:17:32,621 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2022-04-07 19:17:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:17:32,621 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-07 19:17:32,622 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-07 19:17:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 19:17:32,623 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:32,623 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:32,650 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-07 19:17:32,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:32,848 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:32,848 INFO L85 PathProgramCache]: Analyzing trace with hash 401530880, now seen corresponding path program 1 times [2022-04-07 19:17:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:32,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293295304] [2022-04-07 19:17:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:32,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:32,869 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:17:32,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [761469611] [2022-04-07 19:17:32,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:32,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:32,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:32,871 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-07 19:17:32,884 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-07 19:17:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:32,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 19:17:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:32,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:17:33,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {427#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-07 19:17:33,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {427#true} is VALID [2022-04-07 19:17:33,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {427#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-07 19:17:33,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {427#true} {427#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-07 19:17:33,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {427#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-07 19:17:33,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {427#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {427#true} is VALID [2022-04-07 19:17:33,094 INFO L272 TraceCheckUtils]: 6: Hoare triple {427#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {427#true} is VALID [2022-04-07 19:17:33,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {427#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {427#true} is VALID [2022-04-07 19:17:33,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {427#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-07 19:17:33,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {427#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-07 19:17:33,095 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {427#true} {427#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {427#true} is VALID [2022-04-07 19:17:33,095 INFO L272 TraceCheckUtils]: 11: Hoare triple {427#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {427#true} is VALID [2022-04-07 19:17:33,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {427#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {468#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:17:33,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {468#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {472#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:17:33,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {472#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {472#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:17:33,097 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {472#(not (= |assume_abort_if_not_#in~cond| 0))} {427#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {479#(<= 1 main_~y~0)} is VALID [2022-04-07 19:17:33,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {479#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {483#(<= 1 main_~b~0)} is VALID [2022-04-07 19:17:33,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {483#(<= 1 main_~b~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {483#(<= 1 main_~b~0)} is VALID [2022-04-07 19:17:33,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {483#(<= 1 main_~b~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {483#(<= 1 main_~b~0)} is VALID [2022-04-07 19:17:33,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {483#(<= 1 main_~b~0)} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {428#false} is VALID [2022-04-07 19:17:33,099 INFO L272 TraceCheckUtils]: 20: Hoare triple {428#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {428#false} is VALID [2022-04-07 19:17:33,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {428#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {428#false} is VALID [2022-04-07 19:17:33,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {428#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {428#false} is VALID [2022-04-07 19:17:33,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {428#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#false} is VALID [2022-04-07 19:17:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 19:17:33,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:17:33,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:17:33,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293295304] [2022-04-07 19:17:33,101 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:17:33,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761469611] [2022-04-07 19:17:33,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761469611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:17:33,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:17:33,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 19:17:33,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091306417] [2022-04-07 19:17:33,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:17:33,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-07 19:17:33,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:17:33,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:17:33,120 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-07 19:17:33,120 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 19:17:33,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:17:33,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 19:17:33,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:17:33,122 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:17:33,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:33,366 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-07 19:17:33,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 19:17:33,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-07 19:17:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:17:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:17:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-07 19:17:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:17:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-07 19:17:33,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-07 19:17:33,449 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-07 19:17:33,454 INFO L225 Difference]: With dead ends: 50 [2022-04-07 19:17:33,455 INFO L226 Difference]: Without dead ends: 50 [2022-04-07 19:17:33,455 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 19:17:33,459 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:17:33,460 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 148 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:17:33,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-07 19:17:33,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2022-04-07 19:17:33,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:17:33,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:17:33,472 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:17:33,473 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:17:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:33,476 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-07 19:17:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-07 19:17:33,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:33,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:33,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-07 19:17:33,483 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-07 19:17:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:33,486 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-07 19:17:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-07 19:17:33,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:33,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:33,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:17:33,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:17:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:17:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-04-07 19:17:33,489 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 24 [2022-04-07 19:17:33,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:17:33,489 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-04-07 19:17:33,489 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:17:33,489 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-07 19:17:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 19:17:33,490 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:33,490 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:33,507 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-07 19:17:33,694 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 19:17:33,694 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:33,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:33,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2110136122, now seen corresponding path program 1 times [2022-04-07 19:17:33,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:33,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522006027] [2022-04-07 19:17:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:33,741 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:17:33,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062479258] [2022-04-07 19:17:33,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:33,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:33,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:33,748 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-07 19:17:33,751 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-07 19:17:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:33,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 19:17:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:33,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:17:33,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {696#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-07 19:17:33,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {696#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:33,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {704#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:33,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {704#(<= ~counter~0 0)} {696#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:33,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {704#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:33,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {704#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:33,954 INFO L272 TraceCheckUtils]: 6: Hoare triple {704#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:33,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {704#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:33,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {704#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:33,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {704#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:33,957 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {704#(<= ~counter~0 0)} {704#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:33,957 INFO L272 TraceCheckUtils]: 11: Hoare triple {704#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:33,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {704#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:33,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {704#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:33,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {704#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:33,959 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {704#(<= ~counter~0 0)} {704#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:33,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {704#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:33,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {704#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {753#(<= ~counter~0 1)} is VALID [2022-04-07 19:17:33,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {753#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {753#(<= ~counter~0 1)} is VALID [2022-04-07 19:17:33,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {753#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {753#(<= ~counter~0 1)} is VALID [2022-04-07 19:17:33,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {753#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {763#(<= |main_#t~post7| 1)} is VALID [2022-04-07 19:17:33,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {763#(<= |main_#t~post7| 1)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {697#false} is VALID [2022-04-07 19:17:33,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {697#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {697#false} is VALID [2022-04-07 19:17:33,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {697#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {697#false} is VALID [2022-04-07 19:17:33,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {697#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {697#false} is VALID [2022-04-07 19:17:33,963 INFO L272 TraceCheckUtils]: 25: Hoare triple {697#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {697#false} is VALID [2022-04-07 19:17:33,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {697#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {697#false} is VALID [2022-04-07 19:17:33,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {697#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {697#false} is VALID [2022-04-07 19:17:33,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {697#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {697#false} is VALID [2022-04-07 19:17:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:17:33,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:17:33,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:17:33,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522006027] [2022-04-07 19:17:33,964 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:17:33,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062479258] [2022-04-07 19:17:33,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062479258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:17:33,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:17:33,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:17:33,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580331826] [2022-04-07 19:17:33,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:17:33,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-07 19:17:33,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:17:33,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:33,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:33,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:17:33,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:17:33,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:17:33,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:17:33,987 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:34,098 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-07 19:17:34,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:17:34,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-07 19:17:34,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:17:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-07 19:17:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-07 19:17:34,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-07 19:17:34,142 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-07 19:17:34,143 INFO L225 Difference]: With dead ends: 40 [2022-04-07 19:17:34,144 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 19:17:34,144 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:17:34,145 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:17:34,145 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:17:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 19:17:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-07 19:17:34,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:17:34,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:17:34,148 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:17:34,149 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:17:34,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:34,151 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-07 19:17:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-07 19:17:34,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:34,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:34,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-07 19:17:34,152 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-07 19:17:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:34,154 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-07 19:17:34,154 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-07 19:17:34,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:34,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:34,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:17:34,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:17:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:17:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-04-07 19:17:34,156 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 29 [2022-04-07 19:17:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:17:34,157 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-04-07 19:17:34,157 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-07 19:17:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 19:17:34,158 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:34,158 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:34,183 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-07 19:17:34,372 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:34,373 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:34,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:34,373 INFO L85 PathProgramCache]: Analyzing trace with hash -358604865, now seen corresponding path program 1 times [2022-04-07 19:17:34,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:34,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862428109] [2022-04-07 19:17:34,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:34,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:34,397 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:17:34,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1169726539] [2022-04-07 19:17:34,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:34,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:34,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:34,398 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-07 19:17:34,404 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-07 19:17:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:34,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 19:17:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:34,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:17:34,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {947#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 19:17:34,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {947#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {947#true} is VALID [2022-04-07 19:17:34,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {947#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 19:17:34,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {947#true} {947#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 19:17:34,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {947#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 19:17:34,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {947#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {947#true} is VALID [2022-04-07 19:17:34,830 INFO L272 TraceCheckUtils]: 6: Hoare triple {947#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {947#true} is VALID [2022-04-07 19:17:34,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {947#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {947#true} is VALID [2022-04-07 19:17:34,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {947#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 19:17:34,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {947#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 19:17:34,831 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {947#true} {947#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {947#true} is VALID [2022-04-07 19:17:34,831 INFO L272 TraceCheckUtils]: 11: Hoare triple {947#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {947#true} is VALID [2022-04-07 19:17:34,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {947#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {988#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:17:34,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {988#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {992#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:17:34,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {992#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:17:34,835 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {992#(not (= |assume_abort_if_not_#in~cond| 0))} {947#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {999#(<= 1 main_~y~0)} is VALID [2022-04-07 19:17:34,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {999#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1003#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:34,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {1003#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1003#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:34,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {1003#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1003#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:34,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {1003#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1013#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:34,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {1013#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1013#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:34,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {1013#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1013#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:34,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {1013#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {1023#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:34,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {1023#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {1023#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:34,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {1023#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {1023#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:34,849 INFO L272 TraceCheckUtils]: 25: Hoare triple {1023#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1033#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:17:34,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {1033#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1037#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:17:34,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {1037#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {948#false} is VALID [2022-04-07 19:17:34,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {948#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {948#false} is VALID [2022-04-07 19:17:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 19:17:34,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:17:34,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:17:34,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862428109] [2022-04-07 19:17:34,851 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:17:34,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169726539] [2022-04-07 19:17:34,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169726539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:17:34,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:17:34,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-07 19:17:34,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876455447] [2022-04-07 19:17:34,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:17:34,852 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-07 19:17:34,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:17:34,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:17:34,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:34,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 19:17:34,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:17:34,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 19:17:34,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:17:34,876 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:17:35,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:35,505 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-07 19:17:35,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 19:17:35,506 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-07 19:17:35,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:17:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:17:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 91 transitions. [2022-04-07 19:17:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:17:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 91 transitions. [2022-04-07 19:17:35,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 91 transitions. [2022-04-07 19:17:35,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:35,603 INFO L225 Difference]: With dead ends: 66 [2022-04-07 19:17:35,603 INFO L226 Difference]: Without dead ends: 66 [2022-04-07 19:17:35,603 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-07 19:17:35,604 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:17:35,604 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 227 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 19:17:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-07 19:17:35,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-04-07 19:17:35,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:17:35,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 19:17:35,609 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 19:17:35,610 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 19:17:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:35,613 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-07 19:17:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-07 19:17:35,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:35,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:35,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 66 states. [2022-04-07 19:17:35,614 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 66 states. [2022-04-07 19:17:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:35,617 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-07 19:17:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-07 19:17:35,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:35,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:35,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:17:35,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:17:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 19:17:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2022-04-07 19:17:35,621 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 29 [2022-04-07 19:17:35,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:17:35,621 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2022-04-07 19:17:35,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:17:35,621 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-07 19:17:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 19:17:35,622 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:35,622 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:35,651 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-07 19:17:35,836 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:35,836 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:35,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:35,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2061673945, now seen corresponding path program 1 times [2022-04-07 19:17:35,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:35,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993314281] [2022-04-07 19:17:35,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:35,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:35,860 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:17:35,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1173799310] [2022-04-07 19:17:35,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:35,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:35,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:35,861 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-07 19:17:35,892 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-07 19:17:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:35,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 19:17:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:35,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:17:36,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {1304#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1304#true} is VALID [2022-04-07 19:17:36,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {1304#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:36,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {1312#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:36,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1312#(<= ~counter~0 0)} {1304#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:36,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {1312#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:36,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {1312#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:36,098 INFO L272 TraceCheckUtils]: 6: Hoare triple {1312#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:36,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {1312#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:36,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {1312#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:36,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {1312#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:36,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1312#(<= ~counter~0 0)} {1312#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:36,101 INFO L272 TraceCheckUtils]: 11: Hoare triple {1312#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:36,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {1312#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:36,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {1312#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:36,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {1312#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:36,102 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1312#(<= ~counter~0 0)} {1312#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:36,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {1312#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:36,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {1312#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1361#(<= ~counter~0 1)} is VALID [2022-04-07 19:17:36,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {1361#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1361#(<= ~counter~0 1)} is VALID [2022-04-07 19:17:36,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {1361#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1361#(<= ~counter~0 1)} is VALID [2022-04-07 19:17:36,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {1361#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1371#(<= ~counter~0 2)} is VALID [2022-04-07 19:17:36,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {1371#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1371#(<= ~counter~0 2)} is VALID [2022-04-07 19:17:36,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {1371#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {1371#(<= ~counter~0 2)} is VALID [2022-04-07 19:17:36,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {1371#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1371#(<= ~counter~0 2)} is VALID [2022-04-07 19:17:36,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {1371#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1384#(<= |main_#t~post6| 2)} is VALID [2022-04-07 19:17:36,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {1384#(<= |main_#t~post6| 2)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1305#false} is VALID [2022-04-07 19:17:36,107 INFO L272 TraceCheckUtils]: 26: Hoare triple {1305#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1305#false} is VALID [2022-04-07 19:17:36,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {1305#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1305#false} is VALID [2022-04-07 19:17:36,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {1305#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1305#false} is VALID [2022-04-07 19:17:36,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {1305#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1305#false} is VALID [2022-04-07 19:17:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:17:36,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:17:36,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {1305#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1305#false} is VALID [2022-04-07 19:17:36,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {1305#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1305#false} is VALID [2022-04-07 19:17:36,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {1305#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1305#false} is VALID [2022-04-07 19:17:36,295 INFO L272 TraceCheckUtils]: 26: Hoare triple {1305#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1305#false} is VALID [2022-04-07 19:17:36,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {1412#(< |main_#t~post6| 10)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1305#false} is VALID [2022-04-07 19:17:36,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {1416#(< ~counter~0 10)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1412#(< |main_#t~post6| 10)} is VALID [2022-04-07 19:17:36,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {1416#(< ~counter~0 10)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1416#(< ~counter~0 10)} is VALID [2022-04-07 19:17:36,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {1416#(< ~counter~0 10)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {1416#(< ~counter~0 10)} is VALID [2022-04-07 19:17:36,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {1416#(< ~counter~0 10)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1416#(< ~counter~0 10)} is VALID [2022-04-07 19:17:36,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {1429#(< ~counter~0 9)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1416#(< ~counter~0 10)} is VALID [2022-04-07 19:17:36,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {1429#(< ~counter~0 9)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1429#(< ~counter~0 9)} is VALID [2022-04-07 19:17:36,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {1429#(< ~counter~0 9)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1429#(< ~counter~0 9)} is VALID [2022-04-07 19:17:36,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {1439#(< ~counter~0 8)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1429#(< ~counter~0 9)} is VALID [2022-04-07 19:17:36,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {1439#(< ~counter~0 8)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1439#(< ~counter~0 8)} is VALID [2022-04-07 19:17:36,303 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1304#true} {1439#(< ~counter~0 8)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1439#(< ~counter~0 8)} is VALID [2022-04-07 19:17:36,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {1304#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1304#true} is VALID [2022-04-07 19:17:36,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {1304#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1304#true} is VALID [2022-04-07 19:17:36,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {1304#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1304#true} is VALID [2022-04-07 19:17:36,304 INFO L272 TraceCheckUtils]: 11: Hoare triple {1439#(< ~counter~0 8)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1304#true} is VALID [2022-04-07 19:17:36,306 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1304#true} {1439#(< ~counter~0 8)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1439#(< ~counter~0 8)} is VALID [2022-04-07 19:17:36,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {1304#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1304#true} is VALID [2022-04-07 19:17:36,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {1304#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1304#true} is VALID [2022-04-07 19:17:36,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {1304#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1304#true} is VALID [2022-04-07 19:17:36,307 INFO L272 TraceCheckUtils]: 6: Hoare triple {1439#(< ~counter~0 8)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1304#true} is VALID [2022-04-07 19:17:36,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {1439#(< ~counter~0 8)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1439#(< ~counter~0 8)} is VALID [2022-04-07 19:17:36,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {1439#(< ~counter~0 8)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1439#(< ~counter~0 8)} is VALID [2022-04-07 19:17:36,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1439#(< ~counter~0 8)} {1304#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1439#(< ~counter~0 8)} is VALID [2022-04-07 19:17:36,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {1439#(< ~counter~0 8)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1439#(< ~counter~0 8)} is VALID [2022-04-07 19:17:36,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {1304#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1439#(< ~counter~0 8)} is VALID [2022-04-07 19:17:36,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {1304#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1304#true} is VALID [2022-04-07 19:17:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:17:36,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:17:36,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993314281] [2022-04-07 19:17:36,311 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:17:36,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173799310] [2022-04-07 19:17:36,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173799310] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:17:36,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:17:36,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-07 19:17:36,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808909317] [2022-04-07 19:17:36,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:17:36,312 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-04-07 19:17:36,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:17:36,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:17:36,351 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-07 19:17:36,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 19:17:36,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:17:36,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 19:17:36,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:17:36,352 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:17:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:36,773 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2022-04-07 19:17:36,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 19:17:36,773 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-04-07 19:17:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:17:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:17:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 139 transitions. [2022-04-07 19:17:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:17:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 139 transitions. [2022-04-07 19:17:36,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 139 transitions. [2022-04-07 19:17:36,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:36,917 INFO L225 Difference]: With dead ends: 144 [2022-04-07 19:17:36,918 INFO L226 Difference]: Without dead ends: 144 [2022-04-07 19:17:36,918 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-04-07 19:17:36,919 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 94 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:17:36,919 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 253 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:17:36,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-07 19:17:36,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2022-04-07 19:17:36,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:17:36,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 19:17:36,928 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 19:17:36,928 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 19:17:36,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:36,934 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2022-04-07 19:17:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 188 transitions. [2022-04-07 19:17:36,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:36,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:36,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 144 states. [2022-04-07 19:17:36,936 INFO L87 Difference]: Start difference. First operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 144 states. [2022-04-07 19:17:36,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:36,941 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2022-04-07 19:17:36,942 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 188 transitions. [2022-04-07 19:17:36,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:36,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:36,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:17:36,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:17:36,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 19:17:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 134 transitions. [2022-04-07 19:17:36,946 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 134 transitions. Word has length 30 [2022-04-07 19:17:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:17:36,947 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 134 transitions. [2022-04-07 19:17:36,947 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:17:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 134 transitions. [2022-04-07 19:17:36,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 19:17:36,948 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:36,948 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:36,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-07 19:17:37,163 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:37,164 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:37,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:37,164 INFO L85 PathProgramCache]: Analyzing trace with hash 545740907, now seen corresponding path program 1 times [2022-04-07 19:17:37,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:37,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401658838] [2022-04-07 19:17:37,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:37,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:37,188 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:17:37,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124994828] [2022-04-07 19:17:37,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:37,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:37,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:37,189 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-07 19:17:37,219 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-07 19:17:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:37,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 19:17:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:37,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:17:37,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {2032#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2032#true} is VALID [2022-04-07 19:17:37,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {2032#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2032#true} is VALID [2022-04-07 19:17:37,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {2032#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2032#true} is VALID [2022-04-07 19:17:37,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2032#true} {2032#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2032#true} is VALID [2022-04-07 19:17:37,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {2032#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2032#true} is VALID [2022-04-07 19:17:37,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {2032#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2032#true} is VALID [2022-04-07 19:17:37,420 INFO L272 TraceCheckUtils]: 6: Hoare triple {2032#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2032#true} is VALID [2022-04-07 19:17:37,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {2032#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2058#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:17:37,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {2058#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2062#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:17:37,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {2062#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2062#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:17:37,422 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2062#(not (= |assume_abort_if_not_#in~cond| 0))} {2032#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2069#(<= 1 main_~x~0)} is VALID [2022-04-07 19:17:37,422 INFO L272 TraceCheckUtils]: 11: Hoare triple {2069#(<= 1 main_~x~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2032#true} is VALID [2022-04-07 19:17:37,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {2032#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2032#true} is VALID [2022-04-07 19:17:37,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {2032#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2032#true} is VALID [2022-04-07 19:17:37,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {2032#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2032#true} is VALID [2022-04-07 19:17:37,423 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2032#true} {2069#(<= 1 main_~x~0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2069#(<= 1 main_~x~0)} is VALID [2022-04-07 19:17:37,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {2069#(<= 1 main_~x~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2088#(<= 1 main_~a~0)} is VALID [2022-04-07 19:17:37,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {2088#(<= 1 main_~a~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2088#(<= 1 main_~a~0)} is VALID [2022-04-07 19:17:37,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {2088#(<= 1 main_~a~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2088#(<= 1 main_~a~0)} is VALID [2022-04-07 19:17:37,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {2088#(<= 1 main_~a~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {2098#(<= 1 main_~c~0)} is VALID [2022-04-07 19:17:37,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {2098#(<= 1 main_~c~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2098#(<= 1 main_~c~0)} is VALID [2022-04-07 19:17:37,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {2098#(<= 1 main_~c~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2098#(<= 1 main_~c~0)} is VALID [2022-04-07 19:17:37,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {2098#(<= 1 main_~c~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {2098#(<= 1 main_~c~0)} is VALID [2022-04-07 19:17:37,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {2098#(<= 1 main_~c~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2111#(<= 1 main_~b~0)} is VALID [2022-04-07 19:17:37,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {2111#(<= 1 main_~b~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2111#(<= 1 main_~b~0)} is VALID [2022-04-07 19:17:37,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {2111#(<= 1 main_~b~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2111#(<= 1 main_~b~0)} is VALID [2022-04-07 19:17:37,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {2111#(<= 1 main_~b~0)} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {2033#false} is VALID [2022-04-07 19:17:37,428 INFO L272 TraceCheckUtils]: 27: Hoare triple {2033#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2033#false} is VALID [2022-04-07 19:17:37,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {2033#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2033#false} is VALID [2022-04-07 19:17:37,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {2033#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2033#false} is VALID [2022-04-07 19:17:37,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {2033#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2033#false} is VALID [2022-04-07 19:17:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 19:17:37,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:17:37,642 INFO L290 TraceCheckUtils]: 30: Hoare triple {2033#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2033#false} is VALID [2022-04-07 19:17:37,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {2033#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2033#false} is VALID [2022-04-07 19:17:37,642 INFO L290 TraceCheckUtils]: 28: Hoare triple {2033#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2033#false} is VALID [2022-04-07 19:17:37,643 INFO L272 TraceCheckUtils]: 27: Hoare triple {2033#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2033#false} is VALID [2022-04-07 19:17:37,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {2111#(<= 1 main_~b~0)} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {2033#false} is VALID [2022-04-07 19:17:37,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {2111#(<= 1 main_~b~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2111#(<= 1 main_~b~0)} is VALID [2022-04-07 19:17:37,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {2111#(<= 1 main_~b~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2111#(<= 1 main_~b~0)} is VALID [2022-04-07 19:17:37,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {2098#(<= 1 main_~c~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2111#(<= 1 main_~b~0)} is VALID [2022-04-07 19:17:37,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {2098#(<= 1 main_~c~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {2098#(<= 1 main_~c~0)} is VALID [2022-04-07 19:17:37,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {2098#(<= 1 main_~c~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2098#(<= 1 main_~c~0)} is VALID [2022-04-07 19:17:37,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {2098#(<= 1 main_~c~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2098#(<= 1 main_~c~0)} is VALID [2022-04-07 19:17:37,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {2088#(<= 1 main_~a~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {2098#(<= 1 main_~c~0)} is VALID [2022-04-07 19:17:37,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {2088#(<= 1 main_~a~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2088#(<= 1 main_~a~0)} is VALID [2022-04-07 19:17:37,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {2088#(<= 1 main_~a~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2088#(<= 1 main_~a~0)} is VALID [2022-04-07 19:17:37,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {2069#(<= 1 main_~x~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2088#(<= 1 main_~a~0)} is VALID [2022-04-07 19:17:37,654 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2032#true} {2069#(<= 1 main_~x~0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2069#(<= 1 main_~x~0)} is VALID [2022-04-07 19:17:37,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {2032#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2032#true} is VALID [2022-04-07 19:17:37,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {2032#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2032#true} is VALID [2022-04-07 19:17:37,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {2032#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2032#true} is VALID [2022-04-07 19:17:37,659 INFO L272 TraceCheckUtils]: 11: Hoare triple {2069#(<= 1 main_~x~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2032#true} is VALID [2022-04-07 19:17:37,659 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2062#(not (= |assume_abort_if_not_#in~cond| 0))} {2032#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2069#(<= 1 main_~x~0)} is VALID [2022-04-07 19:17:37,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {2062#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2062#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:17:37,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {2202#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2062#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:17:37,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {2032#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2202#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-07 19:17:37,661 INFO L272 TraceCheckUtils]: 6: Hoare triple {2032#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2032#true} is VALID [2022-04-07 19:17:37,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {2032#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2032#true} is VALID [2022-04-07 19:17:37,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {2032#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2032#true} is VALID [2022-04-07 19:17:37,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2032#true} {2032#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2032#true} is VALID [2022-04-07 19:17:37,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {2032#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2032#true} is VALID [2022-04-07 19:17:37,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {2032#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2032#true} is VALID [2022-04-07 19:17:37,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {2032#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2032#true} is VALID [2022-04-07 19:17:37,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 19:17:37,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:17:37,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401658838] [2022-04-07 19:17:37,662 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:17:37,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124994828] [2022-04-07 19:17:37,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124994828] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:17:37,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:17:37,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-07 19:17:37,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697502607] [2022-04-07 19:17:37,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:17:37,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-07 19:17:37,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:17:37,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:37,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:37,686 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 19:17:37,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:17:37,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 19:17:37,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-07 19:17:37,687 INFO L87 Difference]: Start difference. First operand 101 states and 134 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:38,421 INFO L93 Difference]: Finished difference Result 175 states and 251 transitions. [2022-04-07 19:17:38,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 19:17:38,421 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-07 19:17:38,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:17:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2022-04-07 19:17:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2022-04-07 19:17:38,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 149 transitions. [2022-04-07 19:17:38,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:38,562 INFO L225 Difference]: With dead ends: 175 [2022-04-07 19:17:38,562 INFO L226 Difference]: Without dead ends: 175 [2022-04-07 19:17:38,562 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-07 19:17:38,563 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 113 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:17:38,563 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 358 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 19:17:38,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-07 19:17:38,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2022-04-07 19:17:38,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:17:38,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 19:17:38,573 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 19:17:38,573 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 19:17:38,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:38,584 INFO L93 Difference]: Finished difference Result 175 states and 251 transitions. [2022-04-07 19:17:38,584 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 251 transitions. [2022-04-07 19:17:38,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:38,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:38,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 175 states. [2022-04-07 19:17:38,586 INFO L87 Difference]: Start difference. First operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 175 states. [2022-04-07 19:17:38,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:38,596 INFO L93 Difference]: Finished difference Result 175 states and 251 transitions. [2022-04-07 19:17:38,596 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 251 transitions. [2022-04-07 19:17:38,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:38,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:38,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:17:38,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:17:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 19:17:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 180 transitions. [2022-04-07 19:17:38,604 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 180 transitions. Word has length 31 [2022-04-07 19:17:38,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:17:38,604 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 180 transitions. [2022-04-07 19:17:38,604 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 180 transitions. [2022-04-07 19:17:38,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 19:17:38,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:38,605 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:38,631 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-07 19:17:38,824 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:38,824 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:38,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:38,825 INFO L85 PathProgramCache]: Analyzing trace with hash 653912885, now seen corresponding path program 1 times [2022-04-07 19:17:38,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:38,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575872415] [2022-04-07 19:17:38,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:38,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:38,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:17:38,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1187871417] [2022-04-07 19:17:38,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:38,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:38,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:38,845 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-07 19:17:38,876 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-07 19:17:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:38,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 19:17:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:38,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:17:39,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {2897#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2897#true} is VALID [2022-04-07 19:17:39,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {2897#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2897#true} is VALID [2022-04-07 19:17:39,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {2897#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2897#true} is VALID [2022-04-07 19:17:39,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2897#true} {2897#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2897#true} is VALID [2022-04-07 19:17:39,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {2897#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2897#true} is VALID [2022-04-07 19:17:39,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {2897#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2897#true} is VALID [2022-04-07 19:17:39,333 INFO L272 TraceCheckUtils]: 6: Hoare triple {2897#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2897#true} is VALID [2022-04-07 19:17:39,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {2897#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2897#true} is VALID [2022-04-07 19:17:39,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {2897#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2897#true} is VALID [2022-04-07 19:17:39,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {2897#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2897#true} is VALID [2022-04-07 19:17:39,333 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2897#true} {2897#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2897#true} is VALID [2022-04-07 19:17:39,333 INFO L272 TraceCheckUtils]: 11: Hoare triple {2897#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2897#true} is VALID [2022-04-07 19:17:39,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {2897#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2938#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:17:39,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {2938#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2942#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:17:39,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {2942#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2942#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:17:39,335 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2942#(not (= |assume_abort_if_not_#in~cond| 0))} {2897#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2949#(<= 1 main_~y~0)} is VALID [2022-04-07 19:17:39,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {2949#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2953#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:17:39,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {2953#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2953#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:17:39,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {2953#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2953#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:17:39,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {2953#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {2963#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:17:39,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {2963#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2963#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:17:39,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {2963#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2963#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:17:39,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {2963#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {2973#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:17:39,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {2973#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {2973#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:17:39,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {2973#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {2973#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:17:39,340 INFO L272 TraceCheckUtils]: 25: Hoare triple {2973#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2897#true} is VALID [2022-04-07 19:17:39,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {2897#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2897#true} is VALID [2022-04-07 19:17:39,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {2897#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2897#true} is VALID [2022-04-07 19:17:39,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {2897#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2897#true} is VALID [2022-04-07 19:17:39,345 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2897#true} {2973#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2973#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:17:39,346 INFO L272 TraceCheckUtils]: 30: Hoare triple {2973#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2998#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:17:39,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {2998#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3002#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:17:39,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {3002#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2898#false} is VALID [2022-04-07 19:17:39,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {2898#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2898#false} is VALID [2022-04-07 19:17:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 19:17:39,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:17:39,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:17:39,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575872415] [2022-04-07 19:17:39,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:17:39,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187871417] [2022-04-07 19:17:39,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187871417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:17:39,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:17:39,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-07 19:17:39,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707380607] [2022-04-07 19:17:39,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:17:39,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-07 19:17:39,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:17:39,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:17:39,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:39,375 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 19:17:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:17:39,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 19:17:39,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:17:39,376 INFO L87 Difference]: Start difference. First operand 132 states and 180 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:17:39,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:39,968 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2022-04-07 19:17:39,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 19:17:39,968 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-07 19:17:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:17:39,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:17:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-07 19:17:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:17:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-07 19:17:39,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 92 transitions. [2022-04-07 19:17:40,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:40,055 INFO L225 Difference]: With dead ends: 155 [2022-04-07 19:17:40,055 INFO L226 Difference]: Without dead ends: 155 [2022-04-07 19:17:40,056 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-07 19:17:40,056 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 88 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:17:40,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 228 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 19:17:40,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-07 19:17:40,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2022-04-07 19:17:40,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:17:40,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 19:17:40,064 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 19:17:40,065 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 19:17:40,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:40,069 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2022-04-07 19:17:40,070 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 206 transitions. [2022-04-07 19:17:40,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:40,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:40,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 155 states. [2022-04-07 19:17:40,071 INFO L87 Difference]: Start difference. First operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 155 states. [2022-04-07 19:17:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:40,076 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2022-04-07 19:17:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 206 transitions. [2022-04-07 19:17:40,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:40,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:40,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:17:40,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:17:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 19:17:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 189 transitions. [2022-04-07 19:17:40,081 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 189 transitions. Word has length 34 [2022-04-07 19:17:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:17:40,081 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 189 transitions. [2022-04-07 19:17:40,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:17:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2022-04-07 19:17:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-07 19:17:40,082 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:40,083 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:40,106 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-07 19:17:40,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:40,295 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:40,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:40,296 INFO L85 PathProgramCache]: Analyzing trace with hash -47631820, now seen corresponding path program 1 times [2022-04-07 19:17:40,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:40,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494001163] [2022-04-07 19:17:40,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:40,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:40,319 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:17:40,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413771495] [2022-04-07 19:17:40,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:40,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:40,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:40,320 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:17:40,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-07 19:17:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:40,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-07 19:17:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:40,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:17:40,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {3627#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3627#true} is VALID [2022-04-07 19:17:40,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {3627#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {3627#true} is VALID [2022-04-07 19:17:40,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {3627#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3627#true} is VALID [2022-04-07 19:17:40,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3627#true} {3627#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3627#true} is VALID [2022-04-07 19:17:40,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {3627#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3627#true} is VALID [2022-04-07 19:17:40,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {3627#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3627#true} is VALID [2022-04-07 19:17:40,692 INFO L272 TraceCheckUtils]: 6: Hoare triple {3627#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3627#true} is VALID [2022-04-07 19:17:40,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {3627#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3653#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:17:40,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {3653#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3657#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:17:40,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {3657#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3657#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:17:40,697 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3657#(not (= |assume_abort_if_not_#in~cond| 0))} {3627#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3664#(<= 1 main_~x~0)} is VALID [2022-04-07 19:17:40,697 INFO L272 TraceCheckUtils]: 11: Hoare triple {3664#(<= 1 main_~x~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3627#true} is VALID [2022-04-07 19:17:40,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {3627#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3627#true} is VALID [2022-04-07 19:17:40,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {3627#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3627#true} is VALID [2022-04-07 19:17:40,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {3627#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3627#true} is VALID [2022-04-07 19:17:40,698 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3627#true} {3664#(<= 1 main_~x~0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3664#(<= 1 main_~x~0)} is VALID [2022-04-07 19:17:40,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {3664#(<= 1 main_~x~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3683#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:17:40,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {3683#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3683#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:17:40,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {3683#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3683#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:17:40,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {3683#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {3683#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:17:40,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {3683#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {3683#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:17:40,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {3683#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3683#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:17:40,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {3683#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {3683#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:17:40,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {3683#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:17:40,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:17:40,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:17:40,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:17:40,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:17:40,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:17:40,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:17:40,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:17:40,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:17:40,708 INFO L272 TraceCheckUtils]: 32: Hoare triple {3705#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3733#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:17:40,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {3733#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3737#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:17:40,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {3737#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3628#false} is VALID [2022-04-07 19:17:40,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {3628#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3628#false} is VALID [2022-04-07 19:17:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 19:17:40,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:17:40,938 INFO L290 TraceCheckUtils]: 35: Hoare triple {3628#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3628#false} is VALID [2022-04-07 19:17:40,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {3737#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3628#false} is VALID [2022-04-07 19:17:40,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {3733#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3737#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:17:40,940 INFO L272 TraceCheckUtils]: 32: Hoare triple {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3733#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:17:40,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:17:40,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:17:40,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:17:40,942 INFO L290 TraceCheckUtils]: 28: Hoare triple {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:17:40,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:17:40,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:17:40,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:17:40,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:17:40,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {3781#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3753#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:17:40,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {3781#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {3781#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:40,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {3781#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3781#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:40,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {3781#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {3781#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:40,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {3781#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {3781#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:40,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {3781#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3781#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:40,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {3781#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3781#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:40,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {3627#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3781#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:40,948 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3627#true} {3627#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3627#true} is VALID [2022-04-07 19:17:40,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {3627#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3627#true} is VALID [2022-04-07 19:17:40,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {3627#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3627#true} is VALID [2022-04-07 19:17:40,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {3627#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3627#true} is VALID [2022-04-07 19:17:40,949 INFO L272 TraceCheckUtils]: 11: Hoare triple {3627#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3627#true} is VALID [2022-04-07 19:17:40,949 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3627#true} {3627#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3627#true} is VALID [2022-04-07 19:17:40,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {3627#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3627#true} is VALID [2022-04-07 19:17:40,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {3627#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3627#true} is VALID [2022-04-07 19:17:40,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {3627#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3627#true} is VALID [2022-04-07 19:17:40,950 INFO L272 TraceCheckUtils]: 6: Hoare triple {3627#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3627#true} is VALID [2022-04-07 19:17:40,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {3627#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3627#true} is VALID [2022-04-07 19:17:40,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {3627#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3627#true} is VALID [2022-04-07 19:17:40,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3627#true} {3627#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3627#true} is VALID [2022-04-07 19:17:40,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {3627#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3627#true} is VALID [2022-04-07 19:17:40,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {3627#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {3627#true} is VALID [2022-04-07 19:17:40,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {3627#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3627#true} is VALID [2022-04-07 19:17:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:17:40,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:17:40,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494001163] [2022-04-07 19:17:40,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:17:40,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413771495] [2022-04-07 19:17:40,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413771495] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:17:40,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:17:40,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-04-07 19:17:40,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471751476] [2022-04-07 19:17:40,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:17:40,952 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-07 19:17:40,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:17:40,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:17:40,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:40,995 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-07 19:17:40,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:17:40,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-07 19:17:40,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-07 19:17:40,996 INFO L87 Difference]: Start difference. First operand 144 states and 189 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:17:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:41,597 INFO L93 Difference]: Finished difference Result 177 states and 239 transitions. [2022-04-07 19:17:41,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 19:17:41,597 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-07 19:17:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:17:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:17:41,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-07 19:17:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:17:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-07 19:17:41,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 98 transitions. [2022-04-07 19:17:41,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:41,682 INFO L225 Difference]: With dead ends: 177 [2022-04-07 19:17:41,682 INFO L226 Difference]: Without dead ends: 177 [2022-04-07 19:17:41,683 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-07 19:17:41,683 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 84 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:17:41,683 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 334 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 19:17:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-07 19:17:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2022-04-07 19:17:41,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:17:41,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-07 19:17:41,691 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-07 19:17:41,691 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-07 19:17:41,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:41,697 INFO L93 Difference]: Finished difference Result 177 states and 239 transitions. [2022-04-07 19:17:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2022-04-07 19:17:41,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:41,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:41,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 177 states. [2022-04-07 19:17:41,698 INFO L87 Difference]: Start difference. First operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 177 states. [2022-04-07 19:17:41,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:41,704 INFO L93 Difference]: Finished difference Result 177 states and 239 transitions. [2022-04-07 19:17:41,704 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2022-04-07 19:17:41,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:41,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:41,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:17:41,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:17:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-07 19:17:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 236 transitions. [2022-04-07 19:17:41,710 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 236 transitions. Word has length 36 [2022-04-07 19:17:41,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:17:41,711 INFO L478 AbstractCegarLoop]: Abstraction has 174 states and 236 transitions. [2022-04-07 19:17:41,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:17:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 236 transitions. [2022-04-07 19:17:41,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-07 19:17:41,711 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:41,711 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:41,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-07 19:17:41,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-07 19:17:41,928 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:41,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:41,928 INFO L85 PathProgramCache]: Analyzing trace with hash -375710268, now seen corresponding path program 1 times [2022-04-07 19:17:41,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:41,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149491396] [2022-04-07 19:17:41,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:41,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:41,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:17:41,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [169044684] [2022-04-07 19:17:41,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:41,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:41,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:41,944 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:17:41,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-07 19:17:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:41,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 19:17:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:42,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:17:42,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {4564#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4564#true} is VALID [2022-04-07 19:17:42,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {4564#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {4572#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:42,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4572#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:42,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#(<= ~counter~0 0)} {4564#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4572#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:42,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {4572#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4572#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:42,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {4572#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4572#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:42,166 INFO L272 TraceCheckUtils]: 6: Hoare triple {4572#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4572#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:42,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {4572#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4572#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:42,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {4572#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4572#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:42,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {4572#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4572#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:42,171 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4572#(<= ~counter~0 0)} {4572#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4572#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:42,172 INFO L272 TraceCheckUtils]: 11: Hoare triple {4572#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4572#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:42,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {4572#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4572#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:42,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {4572#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4572#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:42,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {4572#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4572#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:42,173 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4572#(<= ~counter~0 0)} {4572#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4572#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:42,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {4572#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4572#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:42,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {4572#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4621#(<= ~counter~0 1)} is VALID [2022-04-07 19:17:42,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {4621#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4621#(<= ~counter~0 1)} is VALID [2022-04-07 19:17:42,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {4621#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {4621#(<= ~counter~0 1)} is VALID [2022-04-07 19:17:42,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {4621#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {4631#(<= ~counter~0 2)} is VALID [2022-04-07 19:17:42,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {4631#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4631#(<= ~counter~0 2)} is VALID [2022-04-07 19:17:42,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {4631#(<= ~counter~0 2)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {4631#(<= ~counter~0 2)} is VALID [2022-04-07 19:17:42,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {4631#(<= ~counter~0 2)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {4641#(<= |main_#t~post8| 2)} is VALID [2022-04-07 19:17:42,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {4641#(<= |main_#t~post8| 2)} [154] L48-1-->L48-4: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {4565#false} is VALID [2022-04-07 19:17:42,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {4565#false} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {4565#false} is VALID [2022-04-07 19:17:42,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {4565#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {4565#false} is VALID [2022-04-07 19:17:42,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {4565#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4565#false} is VALID [2022-04-07 19:17:42,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {4565#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4565#false} is VALID [2022-04-07 19:17:42,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {4565#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4565#false} is VALID [2022-04-07 19:17:42,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {4565#false} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4565#false} is VALID [2022-04-07 19:17:42,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {4565#false} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {4565#false} is VALID [2022-04-07 19:17:42,182 INFO L272 TraceCheckUtils]: 32: Hoare triple {4565#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4565#false} is VALID [2022-04-07 19:17:42,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {4565#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4565#false} is VALID [2022-04-07 19:17:42,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {4565#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4565#false} is VALID [2022-04-07 19:17:42,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {4565#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4565#false} is VALID [2022-04-07 19:17:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:17:42,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:17:42,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:17:42,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149491396] [2022-04-07 19:17:42,182 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:17:42,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169044684] [2022-04-07 19:17:42,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169044684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:17:42,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:17:42,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 19:17:42,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341816174] [2022-04-07 19:17:42,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:17:42,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-07 19:17:42,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:17:42,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:42,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:42,205 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 19:17:42,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:17:42,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 19:17:42,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:17:42,206 INFO L87 Difference]: Start difference. First operand 174 states and 236 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:42,300 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-04-07 19:17:42,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 19:17:42,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-07 19:17:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:17:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-07 19:17:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-07 19:17:42,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-07 19:17:42,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:42,349 INFO L225 Difference]: With dead ends: 174 [2022-04-07 19:17:42,349 INFO L226 Difference]: Without dead ends: 174 [2022-04-07 19:17:42,349 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:17:42,350 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:17:42,350 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 139 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:17:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-07 19:17:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-04-07 19:17:42,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:17:42,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-07 19:17:42,358 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-07 19:17:42,358 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-07 19:17:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:42,363 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-04-07 19:17:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-04-07 19:17:42,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:42,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:42,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 174 states. [2022-04-07 19:17:42,365 INFO L87 Difference]: Start difference. First operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 174 states. [2022-04-07 19:17:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:42,370 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-04-07 19:17:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-04-07 19:17:42,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:42,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:42,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:17:42,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:17:42,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-07 19:17:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2022-04-07 19:17:42,375 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 235 transitions. Word has length 36 [2022-04-07 19:17:42,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:17:42,375 INFO L478 AbstractCegarLoop]: Abstraction has 174 states and 235 transitions. [2022-04-07 19:17:42,375 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:17:42,376 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-04-07 19:17:42,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-07 19:17:42,376 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:42,376 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:42,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-07 19:17:42,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-07 19:17:42,603 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:42,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash -344890017, now seen corresponding path program 1 times [2022-04-07 19:17:42,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:42,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101212681] [2022-04-07 19:17:42,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:42,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:42,617 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:17:42,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [28022515] [2022-04-07 19:17:42,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:42,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:42,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:42,618 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:17:42,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-07 19:17:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:42,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 19:17:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:42,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:17:42,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {5373#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5373#true} is VALID [2022-04-07 19:17:42,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {5373#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {5373#true} is VALID [2022-04-07 19:17:42,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {5373#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5373#true} is VALID [2022-04-07 19:17:42,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5373#true} {5373#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5373#true} is VALID [2022-04-07 19:17:42,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {5373#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5373#true} is VALID [2022-04-07 19:17:42,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {5373#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5373#true} is VALID [2022-04-07 19:17:42,801 INFO L272 TraceCheckUtils]: 6: Hoare triple {5373#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5373#true} is VALID [2022-04-07 19:17:42,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {5373#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5373#true} is VALID [2022-04-07 19:17:42,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {5373#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5373#true} is VALID [2022-04-07 19:17:42,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {5373#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5373#true} is VALID [2022-04-07 19:17:42,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5373#true} {5373#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5373#true} is VALID [2022-04-07 19:17:42,802 INFO L272 TraceCheckUtils]: 11: Hoare triple {5373#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5373#true} is VALID [2022-04-07 19:17:42,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {5373#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5373#true} is VALID [2022-04-07 19:17:42,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {5373#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5373#true} is VALID [2022-04-07 19:17:42,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {5373#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5373#true} is VALID [2022-04-07 19:17:42,802 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5373#true} {5373#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5373#true} is VALID [2022-04-07 19:17:42,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {5373#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5373#true} is VALID [2022-04-07 19:17:42,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {5373#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {5373#true} is VALID [2022-04-07 19:17:42,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {5373#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5373#true} is VALID [2022-04-07 19:17:42,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {5373#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-07 19:17:42,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-07 19:17:42,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-07 19:17:42,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-07 19:17:42,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-07 19:17:42,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-07 19:17:42,805 INFO L272 TraceCheckUtils]: 25: Hoare triple {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5373#true} is VALID [2022-04-07 19:17:42,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {5373#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5373#true} is VALID [2022-04-07 19:17:42,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {5373#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5373#true} is VALID [2022-04-07 19:17:42,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {5373#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5373#true} is VALID [2022-04-07 19:17:42,807 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5373#true} {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-07 19:17:42,807 INFO L272 TraceCheckUtils]: 30: Hoare triple {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5373#true} is VALID [2022-04-07 19:17:42,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {5373#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5373#true} is VALID [2022-04-07 19:17:42,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {5373#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5373#true} is VALID [2022-04-07 19:17:42,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {5373#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5373#true} is VALID [2022-04-07 19:17:42,808 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5373#true} {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-07 19:17:42,809 INFO L272 TraceCheckUtils]: 35: Hoare triple {5435#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {5484#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:17:42,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {5484#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5488#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:17:42,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {5488#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {5374#false} is VALID [2022-04-07 19:17:42,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {5374#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5374#false} is VALID [2022-04-07 19:17:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-07 19:17:42,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:17:42,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:17:42,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101212681] [2022-04-07 19:17:42,810 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:17:42,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28022515] [2022-04-07 19:17:42,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28022515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:17:42,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:17:42,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:17:42,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051943875] [2022-04-07 19:17:42,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:17:42,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-07 19:17:42,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:17:42,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:17:42,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:42,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:17:42,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:17:42,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:17:42,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:17:42,836 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:17:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:42,980 INFO L93 Difference]: Finished difference Result 237 states and 331 transitions. [2022-04-07 19:17:42,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:17:42,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-07 19:17:42,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:17:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:17:42,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 19:17:42,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:17:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 19:17:42,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-07 19:17:43,057 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-07 19:17:43,062 INFO L225 Difference]: With dead ends: 237 [2022-04-07 19:17:43,062 INFO L226 Difference]: Without dead ends: 237 [2022-04-07 19:17:43,062 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:17:43,063 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:17:43,063 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:17:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-07 19:17:43,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2022-04-07 19:17:43,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:17:43,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 19:17:43,071 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 19:17:43,072 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 19:17:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:43,079 INFO L93 Difference]: Finished difference Result 237 states and 331 transitions. [2022-04-07 19:17:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 331 transitions. [2022-04-07 19:17:43,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:43,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:43,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand 237 states. [2022-04-07 19:17:43,081 INFO L87 Difference]: Start difference. First operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand 237 states. [2022-04-07 19:17:43,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:43,088 INFO L93 Difference]: Finished difference Result 237 states and 331 transitions. [2022-04-07 19:17:43,088 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 331 transitions. [2022-04-07 19:17:43,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:43,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:43,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:17:43,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:17:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 19:17:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2022-04-07 19:17:43,096 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 39 [2022-04-07 19:17:43,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:17:43,096 INFO L478 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2022-04-07 19:17:43,096 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:17:43,096 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2022-04-07 19:17:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 19:17:43,097 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:43,097 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:43,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-07 19:17:43,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-07 19:17:43,311 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:43,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:43,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1057809952, now seen corresponding path program 1 times [2022-04-07 19:17:43,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:43,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354561641] [2022-04-07 19:17:43,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:43,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:43,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:17:43,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2010677125] [2022-04-07 19:17:43,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:43,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:43,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:43,326 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:17:43,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-07 19:17:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:43,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-07 19:17:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:43,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:17:43,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {6437#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:43,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {6437#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {6437#true} is VALID [2022-04-07 19:17:43,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {6437#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:43,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6437#true} {6437#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:43,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {6437#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:43,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {6437#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6437#true} is VALID [2022-04-07 19:17:43,719 INFO L272 TraceCheckUtils]: 6: Hoare triple {6437#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6437#true} is VALID [2022-04-07 19:17:43,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {6437#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {6437#true} is VALID [2022-04-07 19:17:43,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {6437#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:43,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {6437#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:43,719 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6437#true} {6437#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6437#true} is VALID [2022-04-07 19:17:43,720 INFO L272 TraceCheckUtils]: 11: Hoare triple {6437#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6437#true} is VALID [2022-04-07 19:17:43,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {6437#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {6437#true} is VALID [2022-04-07 19:17:43,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {6437#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:43,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {6437#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:43,720 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6437#true} {6437#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6437#true} is VALID [2022-04-07 19:17:43,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {6437#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:43,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {6490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {6490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:43,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {6490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:43,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {6490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {6500#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:43,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {6500#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {6500#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:43,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {6500#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6500#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:43,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {6500#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {6500#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:43,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {6500#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:17:43,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:17:43,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:17:43,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:17:43,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:17:43,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:17:43,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:17:43,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:17:43,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:17:43,728 INFO L272 TraceCheckUtils]: 32: Hoare triple {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6437#true} is VALID [2022-04-07 19:17:43,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {6437#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6437#true} is VALID [2022-04-07 19:17:43,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {6437#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:43,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {6437#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:43,729 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6437#true} {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:17:43,730 INFO L272 TraceCheckUtils]: 37: Hoare triple {6513#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:17:43,731 INFO L290 TraceCheckUtils]: 38: Hoare triple {6556#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:17:43,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {6560#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {6438#false} is VALID [2022-04-07 19:17:43,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {6438#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6438#false} is VALID [2022-04-07 19:17:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:17:43,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:17:43,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {6438#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6438#false} is VALID [2022-04-07 19:17:43,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {6560#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {6438#false} is VALID [2022-04-07 19:17:43,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {6556#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:17:43,946 INFO L272 TraceCheckUtils]: 37: Hoare triple {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:17:43,947 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6437#true} {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:43,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {6437#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:43,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {6437#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:43,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {6437#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6437#true} is VALID [2022-04-07 19:17:43,947 INFO L272 TraceCheckUtils]: 32: Hoare triple {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6437#true} is VALID [2022-04-07 19:17:43,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:43,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:43,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:43,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:43,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:43,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:43,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:43,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:45,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {6619#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6576#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:17:45,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {6619#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {6619#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-07 19:17:45,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {6619#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6619#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-07 19:17:45,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {6619#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {6619#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-07 19:17:45,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {6632#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {6619#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-07 19:17:45,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {6632#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6632#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:17:45,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {6632#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {6632#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:17:45,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {6437#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6632#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:17:45,583 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6437#true} {6437#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6437#true} is VALID [2022-04-07 19:17:45,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {6437#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:45,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {6437#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:45,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {6437#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {6437#true} is VALID [2022-04-07 19:17:45,583 INFO L272 TraceCheckUtils]: 11: Hoare triple {6437#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6437#true} is VALID [2022-04-07 19:17:45,583 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6437#true} {6437#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6437#true} is VALID [2022-04-07 19:17:45,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {6437#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:45,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {6437#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:45,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {6437#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {6437#true} is VALID [2022-04-07 19:17:45,584 INFO L272 TraceCheckUtils]: 6: Hoare triple {6437#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6437#true} is VALID [2022-04-07 19:17:45,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {6437#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6437#true} is VALID [2022-04-07 19:17:45,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {6437#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:45,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6437#true} {6437#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:45,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {6437#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:45,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {6437#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {6437#true} is VALID [2022-04-07 19:17:45,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {6437#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6437#true} is VALID [2022-04-07 19:17:45,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:17:45,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:17:45,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354561641] [2022-04-07 19:17:45,585 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:17:45,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010677125] [2022-04-07 19:17:45,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010677125] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:17:45,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:17:45,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-07 19:17:45,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492617853] [2022-04-07 19:17:45,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:17:45,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-07 19:17:45,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:17:45,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 19:17:45,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:45,765 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 19:17:45,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:17:45,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 19:17:45,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:17:45,766 INFO L87 Difference]: Start difference. First operand 230 states and 324 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 19:17:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:47,786 INFO L93 Difference]: Finished difference Result 390 states and 576 transitions. [2022-04-07 19:17:47,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 19:17:47,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-07 19:17:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:17:47,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 19:17:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 251 transitions. [2022-04-07 19:17:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 19:17:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 251 transitions. [2022-04-07 19:17:47,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 251 transitions. [2022-04-07 19:17:48,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:48,473 INFO L225 Difference]: With dead ends: 390 [2022-04-07 19:17:48,474 INFO L226 Difference]: Without dead ends: 390 [2022-04-07 19:17:48,474 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-07 19:17:48,474 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 161 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-07 19:17:48,475 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 348 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-07 19:17:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-04-07 19:17:48,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 377. [2022-04-07 19:17:48,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:17:48,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 390 states. Second operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-07 19:17:48,486 INFO L74 IsIncluded]: Start isIncluded. First operand 390 states. Second operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-07 19:17:48,487 INFO L87 Difference]: Start difference. First operand 390 states. Second operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-07 19:17:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:48,501 INFO L93 Difference]: Finished difference Result 390 states and 576 transitions. [2022-04-07 19:17:48,501 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 576 transitions. [2022-04-07 19:17:48,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:48,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:48,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) Second operand 390 states. [2022-04-07 19:17:48,504 INFO L87 Difference]: Start difference. First operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) Second operand 390 states. [2022-04-07 19:17:48,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:48,519 INFO L93 Difference]: Finished difference Result 390 states and 576 transitions. [2022-04-07 19:17:48,519 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 576 transitions. [2022-04-07 19:17:48,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:48,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:48,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:17:48,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:17:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-07 19:17:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 563 transitions. [2022-04-07 19:17:48,533 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 563 transitions. Word has length 41 [2022-04-07 19:17:48,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:17:48,533 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 563 transitions. [2022-04-07 19:17:48,534 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 19:17:48,534 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 563 transitions. [2022-04-07 19:17:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 19:17:48,534 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:48,534 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:48,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-07 19:17:48,743 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-07 19:17:48,744 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:48,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:48,744 INFO L85 PathProgramCache]: Analyzing trace with hash -800046763, now seen corresponding path program 1 times [2022-04-07 19:17:48,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:48,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10506805] [2022-04-07 19:17:48,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:48,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:48,760 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:17:48,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1104599004] [2022-04-07 19:17:48,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:48,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:48,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:48,767 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:17:48,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-07 19:17:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:48,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 19:17:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:48,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:17:48,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {8255#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8255#true} is VALID [2022-04-07 19:17:48,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {8255#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {8255#true} is VALID [2022-04-07 19:17:48,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {8255#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8255#true} is VALID [2022-04-07 19:17:48,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8255#true} {8255#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8255#true} is VALID [2022-04-07 19:17:48,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {8255#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8255#true} is VALID [2022-04-07 19:17:48,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {8255#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {8255#true} is VALID [2022-04-07 19:17:48,930 INFO L272 TraceCheckUtils]: 6: Hoare triple {8255#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {8255#true} is VALID [2022-04-07 19:17:48,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {8255#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {8255#true} is VALID [2022-04-07 19:17:48,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {8255#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {8255#true} is VALID [2022-04-07 19:17:48,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {8255#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8255#true} is VALID [2022-04-07 19:17:48,931 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8255#true} {8255#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {8255#true} is VALID [2022-04-07 19:17:48,931 INFO L272 TraceCheckUtils]: 11: Hoare triple {8255#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {8255#true} is VALID [2022-04-07 19:17:48,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {8255#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {8255#true} is VALID [2022-04-07 19:17:48,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {8255#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {8255#true} is VALID [2022-04-07 19:17:48,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {8255#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8255#true} is VALID [2022-04-07 19:17:48,931 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8255#true} {8255#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {8255#true} is VALID [2022-04-07 19:17:48,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {8255#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {8255#true} is VALID [2022-04-07 19:17:48,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {8255#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {8255#true} is VALID [2022-04-07 19:17:48,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {8255#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {8255#true} is VALID [2022-04-07 19:17:48,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {8255#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {8255#true} is VALID [2022-04-07 19:17:48,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {8255#true} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {8255#true} is VALID [2022-04-07 19:17:48,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {8255#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {8255#true} is VALID [2022-04-07 19:17:48,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {8255#true} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {8326#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-07 19:17:48,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {8326#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {8326#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-07 19:17:48,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {8326#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {8326#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-07 19:17:48,940 INFO L272 TraceCheckUtils]: 25: Hoare triple {8326#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {8255#true} is VALID [2022-04-07 19:17:48,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {8255#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {8255#true} is VALID [2022-04-07 19:17:48,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {8255#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {8255#true} is VALID [2022-04-07 19:17:48,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {8255#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8255#true} is VALID [2022-04-07 19:17:48,941 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {8255#true} {8326#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {8326#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-07 19:17:48,942 INFO L272 TraceCheckUtils]: 30: Hoare triple {8326#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {8255#true} is VALID [2022-04-07 19:17:48,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {8255#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {8255#true} is VALID [2022-04-07 19:17:48,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {8255#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {8255#true} is VALID [2022-04-07 19:17:48,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {8255#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8255#true} is VALID [2022-04-07 19:17:48,944 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8255#true} {8326#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {8326#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-07 19:17:48,944 INFO L272 TraceCheckUtils]: 35: Hoare triple {8326#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {8255#true} is VALID [2022-04-07 19:17:48,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {8255#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {8255#true} is VALID [2022-04-07 19:17:48,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {8255#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {8255#true} is VALID [2022-04-07 19:17:48,944 INFO L290 TraceCheckUtils]: 38: Hoare triple {8255#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8255#true} is VALID [2022-04-07 19:17:48,945 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8255#true} {8326#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {8326#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-07 19:17:48,946 INFO L272 TraceCheckUtils]: 40: Hoare triple {8326#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {8381#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:17:48,946 INFO L290 TraceCheckUtils]: 41: Hoare triple {8381#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {8385#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:17:48,947 INFO L290 TraceCheckUtils]: 42: Hoare triple {8385#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {8256#false} is VALID [2022-04-07 19:17:48,947 INFO L290 TraceCheckUtils]: 43: Hoare triple {8256#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8256#false} is VALID [2022-04-07 19:17:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 19:17:48,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:17:48,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:17:48,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10506805] [2022-04-07 19:17:48,947 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:17:48,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104599004] [2022-04-07 19:17:48,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104599004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:17:48,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:17:48,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:17:48,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149765059] [2022-04-07 19:17:48,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:17:48,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-07 19:17:48,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:17:48,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:17:48,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:48,981 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:17:48,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:17:48,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:17:48,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:17:48,981 INFO L87 Difference]: Start difference. First operand 377 states and 563 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:17:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:49,187 INFO L93 Difference]: Finished difference Result 564 states and 884 transitions. [2022-04-07 19:17:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:17:49,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-07 19:17:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:17:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:17:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 19:17:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:17:49,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 19:17:49,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-07 19:17:49,254 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-07 19:17:49,271 INFO L225 Difference]: With dead ends: 564 [2022-04-07 19:17:49,271 INFO L226 Difference]: Without dead ends: 564 [2022-04-07 19:17:49,271 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:17:49,272 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:17:49,272 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:17:49,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-04-07 19:17:49,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 495. [2022-04-07 19:17:49,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:17:49,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 564 states. Second operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-07 19:17:49,291 INFO L74 IsIncluded]: Start isIncluded. First operand 564 states. Second operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-07 19:17:49,292 INFO L87 Difference]: Start difference. First operand 564 states. Second operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-07 19:17:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:49,319 INFO L93 Difference]: Finished difference Result 564 states and 884 transitions. [2022-04-07 19:17:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 884 transitions. [2022-04-07 19:17:49,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:49,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:49,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 564 states. [2022-04-07 19:17:49,355 INFO L87 Difference]: Start difference. First operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 564 states. [2022-04-07 19:17:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:49,388 INFO L93 Difference]: Finished difference Result 564 states and 884 transitions. [2022-04-07 19:17:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 884 transitions. [2022-04-07 19:17:49,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:49,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:49,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:17:49,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:17:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-07 19:17:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 774 transitions. [2022-04-07 19:17:49,420 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 774 transitions. Word has length 44 [2022-04-07 19:17:49,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:17:49,421 INFO L478 AbstractCegarLoop]: Abstraction has 495 states and 774 transitions. [2022-04-07 19:17:49,422 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:17:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 774 transitions. [2022-04-07 19:17:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-07 19:17:49,422 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:49,422 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:49,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-07 19:17:49,646 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-07 19:17:49,646 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:49,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:49,647 INFO L85 PathProgramCache]: Analyzing trace with hash 684933943, now seen corresponding path program 1 times [2022-04-07 19:17:49,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:49,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489070207] [2022-04-07 19:17:49,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:49,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:49,665 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:17:49,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1037981648] [2022-04-07 19:17:49,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:49,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:49,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:49,667 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:17:49,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-07 19:17:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:49,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 19:17:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:49,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:17:49,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {10580#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10580#true} is VALID [2022-04-07 19:17:49,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {10580#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {10588#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:49,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {10588#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10588#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:49,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10588#(<= ~counter~0 0)} {10580#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10588#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:49,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {10588#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10588#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:49,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {10588#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10588#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:49,911 INFO L272 TraceCheckUtils]: 6: Hoare triple {10588#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {10588#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:49,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {10588#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {10588#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:49,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {10588#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {10588#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:49,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {10588#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10588#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:49,912 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10588#(<= ~counter~0 0)} {10588#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {10588#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:49,912 INFO L272 TraceCheckUtils]: 11: Hoare triple {10588#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {10588#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:49,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {10588#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {10588#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:49,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {10588#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {10588#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:49,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {10588#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10588#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:49,921 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10588#(<= ~counter~0 0)} {10588#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {10588#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:49,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {10588#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10588#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:49,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {10588#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {10637#(<= ~counter~0 1)} is VALID [2022-04-07 19:17:49,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {10637#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {10637#(<= ~counter~0 1)} is VALID [2022-04-07 19:17:49,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {10637#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {10637#(<= ~counter~0 1)} is VALID [2022-04-07 19:17:49,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {10637#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {10647#(<= ~counter~0 2)} is VALID [2022-04-07 19:17:49,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {10647#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {10647#(<= ~counter~0 2)} is VALID [2022-04-07 19:17:49,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {10647#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {10647#(<= ~counter~0 2)} is VALID [2022-04-07 19:17:49,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {10647#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10647#(<= ~counter~0 2)} is VALID [2022-04-07 19:17:49,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {10647#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {10660#(<= ~counter~0 3)} is VALID [2022-04-07 19:17:49,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {10660#(<= ~counter~0 3)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {10660#(<= ~counter~0 3)} is VALID [2022-04-07 19:17:49,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {10660#(<= ~counter~0 3)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {10660#(<= ~counter~0 3)} is VALID [2022-04-07 19:17:49,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {10660#(<= ~counter~0 3)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {10670#(<= |main_#t~post7| 3)} is VALID [2022-04-07 19:17:49,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {10670#(<= |main_#t~post7| 3)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {10581#false} is VALID [2022-04-07 19:17:49,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {10581#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10581#false} is VALID [2022-04-07 19:17:49,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {10581#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {10581#false} is VALID [2022-04-07 19:17:49,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {10581#false} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {10581#false} is VALID [2022-04-07 19:17:49,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {10581#false} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {10581#false} is VALID [2022-04-07 19:17:49,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {10581#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {10581#false} is VALID [2022-04-07 19:17:49,926 INFO L290 TraceCheckUtils]: 34: Hoare triple {10581#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {10581#false} is VALID [2022-04-07 19:17:49,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {10581#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10581#false} is VALID [2022-04-07 19:17:49,926 INFO L290 TraceCheckUtils]: 36: Hoare triple {10581#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {10581#false} is VALID [2022-04-07 19:17:49,927 INFO L290 TraceCheckUtils]: 37: Hoare triple {10581#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {10581#false} is VALID [2022-04-07 19:17:49,927 INFO L272 TraceCheckUtils]: 38: Hoare triple {10581#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10581#false} is VALID [2022-04-07 19:17:49,927 INFO L290 TraceCheckUtils]: 39: Hoare triple {10581#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {10581#false} is VALID [2022-04-07 19:17:49,927 INFO L290 TraceCheckUtils]: 40: Hoare triple {10581#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {10581#false} is VALID [2022-04-07 19:17:49,927 INFO L290 TraceCheckUtils]: 41: Hoare triple {10581#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10581#false} is VALID [2022-04-07 19:17:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-07 19:17:49,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:17:50,149 INFO L290 TraceCheckUtils]: 41: Hoare triple {10581#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10581#false} is VALID [2022-04-07 19:17:50,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {10581#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {10581#false} is VALID [2022-04-07 19:17:50,150 INFO L290 TraceCheckUtils]: 39: Hoare triple {10581#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {10581#false} is VALID [2022-04-07 19:17:50,150 INFO L272 TraceCheckUtils]: 38: Hoare triple {10581#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10581#false} is VALID [2022-04-07 19:17:50,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {10581#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {10581#false} is VALID [2022-04-07 19:17:50,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {10581#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {10581#false} is VALID [2022-04-07 19:17:50,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {10581#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10581#false} is VALID [2022-04-07 19:17:50,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {10581#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {10581#false} is VALID [2022-04-07 19:17:50,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {10581#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {10581#false} is VALID [2022-04-07 19:17:50,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {10581#false} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {10581#false} is VALID [2022-04-07 19:17:50,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {10581#false} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {10581#false} is VALID [2022-04-07 19:17:50,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {10581#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {10581#false} is VALID [2022-04-07 19:17:50,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {10581#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10581#false} is VALID [2022-04-07 19:17:50,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {10752#(< |main_#t~post7| 10)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {10581#false} is VALID [2022-04-07 19:17:50,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {10756#(< ~counter~0 10)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {10752#(< |main_#t~post7| 10)} is VALID [2022-04-07 19:17:50,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {10756#(< ~counter~0 10)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {10756#(< ~counter~0 10)} is VALID [2022-04-07 19:17:50,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {10756#(< ~counter~0 10)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {10756#(< ~counter~0 10)} is VALID [2022-04-07 19:17:50,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {10766#(< ~counter~0 9)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {10756#(< ~counter~0 10)} is VALID [2022-04-07 19:17:50,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {10766#(< ~counter~0 9)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10766#(< ~counter~0 9)} is VALID [2022-04-07 19:17:50,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {10766#(< ~counter~0 9)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {10766#(< ~counter~0 9)} is VALID [2022-04-07 19:17:50,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {10766#(< ~counter~0 9)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {10766#(< ~counter~0 9)} is VALID [2022-04-07 19:17:50,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {10779#(< ~counter~0 8)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {10766#(< ~counter~0 9)} is VALID [2022-04-07 19:17:50,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {10779#(< ~counter~0 8)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {10779#(< ~counter~0 8)} is VALID [2022-04-07 19:17:50,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {10779#(< ~counter~0 8)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {10779#(< ~counter~0 8)} is VALID [2022-04-07 19:17:50,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {10789#(< ~counter~0 7)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {10779#(< ~counter~0 8)} is VALID [2022-04-07 19:17:50,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {10789#(< ~counter~0 7)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10789#(< ~counter~0 7)} is VALID [2022-04-07 19:17:50,158 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10580#true} {10789#(< ~counter~0 7)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {10789#(< ~counter~0 7)} is VALID [2022-04-07 19:17:50,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {10580#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10580#true} is VALID [2022-04-07 19:17:50,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {10580#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {10580#true} is VALID [2022-04-07 19:17:50,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {10580#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {10580#true} is VALID [2022-04-07 19:17:50,158 INFO L272 TraceCheckUtils]: 11: Hoare triple {10789#(< ~counter~0 7)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {10580#true} is VALID [2022-04-07 19:17:50,159 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10580#true} {10789#(< ~counter~0 7)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {10789#(< ~counter~0 7)} is VALID [2022-04-07 19:17:50,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {10580#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10580#true} is VALID [2022-04-07 19:17:50,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {10580#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {10580#true} is VALID [2022-04-07 19:17:50,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {10580#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {10580#true} is VALID [2022-04-07 19:17:50,159 INFO L272 TraceCheckUtils]: 6: Hoare triple {10789#(< ~counter~0 7)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {10580#true} is VALID [2022-04-07 19:17:50,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {10789#(< ~counter~0 7)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10789#(< ~counter~0 7)} is VALID [2022-04-07 19:17:50,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {10789#(< ~counter~0 7)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10789#(< ~counter~0 7)} is VALID [2022-04-07 19:17:50,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10789#(< ~counter~0 7)} {10580#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10789#(< ~counter~0 7)} is VALID [2022-04-07 19:17:50,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {10789#(< ~counter~0 7)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10789#(< ~counter~0 7)} is VALID [2022-04-07 19:17:50,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {10580#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {10789#(< ~counter~0 7)} is VALID [2022-04-07 19:17:50,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {10580#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10580#true} is VALID [2022-04-07 19:17:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-07 19:17:50,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:17:50,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489070207] [2022-04-07 19:17:50,161 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:17:50,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037981648] [2022-04-07 19:17:50,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037981648] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:17:50,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:17:50,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-07 19:17:50,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109124549] [2022-04-07 19:17:50,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:17:50,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-07 19:17:50,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:17:50,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:17:50,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:50,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 19:17:50,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:17:50,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 19:17:50,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-07 19:17:50,201 INFO L87 Difference]: Start difference. First operand 495 states and 774 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:17:50,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:50,780 INFO L93 Difference]: Finished difference Result 770 states and 1118 transitions. [2022-04-07 19:17:50,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-07 19:17:50,781 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-07 19:17:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:17:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:17:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 193 transitions. [2022-04-07 19:17:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:17:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 193 transitions. [2022-04-07 19:17:50,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 193 transitions. [2022-04-07 19:17:50,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:50,973 INFO L225 Difference]: With dead ends: 770 [2022-04-07 19:17:50,973 INFO L226 Difference]: Without dead ends: 770 [2022-04-07 19:17:50,974 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-04-07 19:17:50,974 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 140 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:17:50,974 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 310 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:17:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-04-07 19:17:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 736. [2022-04-07 19:17:50,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:17:50,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 770 states. Second operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-07 19:17:50,997 INFO L74 IsIncluded]: Start isIncluded. First operand 770 states. Second operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-07 19:17:50,998 INFO L87 Difference]: Start difference. First operand 770 states. Second operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-07 19:17:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:51,041 INFO L93 Difference]: Finished difference Result 770 states and 1118 transitions. [2022-04-07 19:17:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1118 transitions. [2022-04-07 19:17:51,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:51,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:51,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) Second operand 770 states. [2022-04-07 19:17:51,047 INFO L87 Difference]: Start difference. First operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) Second operand 770 states. [2022-04-07 19:17:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:51,108 INFO L93 Difference]: Finished difference Result 770 states and 1118 transitions. [2022-04-07 19:17:51,108 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1118 transitions. [2022-04-07 19:17:51,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:51,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:51,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:17:51,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:17:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-07 19:17:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1085 transitions. [2022-04-07 19:17:51,152 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1085 transitions. Word has length 42 [2022-04-07 19:17:51,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:17:51,152 INFO L478 AbstractCegarLoop]: Abstraction has 736 states and 1085 transitions. [2022-04-07 19:17:51,152 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:17:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1085 transitions. [2022-04-07 19:17:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 19:17:51,153 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:51,153 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:51,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-07 19:17:51,367 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-07 19:17:51,367 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:51,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash 841576990, now seen corresponding path program 1 times [2022-04-07 19:17:51,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:51,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137891346] [2022-04-07 19:17:51,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:51,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:51,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:17:51,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [588571201] [2022-04-07 19:17:51,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:51,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:51,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:51,382 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:17:51,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-07 19:17:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:51,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 19:17:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:51,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:17:51,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {13899#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13899#true} is VALID [2022-04-07 19:17:51,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {13899#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {13907#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:51,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {13907#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13907#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:51,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13907#(<= ~counter~0 0)} {13899#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13907#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:51,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {13907#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13907#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:51,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {13907#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {13907#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:51,662 INFO L272 TraceCheckUtils]: 6: Hoare triple {13907#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {13907#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:51,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {13907#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {13907#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:51,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {13907#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {13907#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:51,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {13907#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13907#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:51,663 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13907#(<= ~counter~0 0)} {13907#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {13907#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:51,664 INFO L272 TraceCheckUtils]: 11: Hoare triple {13907#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {13907#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:51,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {13907#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {13907#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:51,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {13907#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {13907#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:51,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {13907#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13907#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:51,666 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13907#(<= ~counter~0 0)} {13907#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {13907#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:51,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {13907#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {13907#(<= ~counter~0 0)} is VALID [2022-04-07 19:17:51,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {13907#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {13956#(<= ~counter~0 1)} is VALID [2022-04-07 19:17:51,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {13956#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {13956#(<= ~counter~0 1)} is VALID [2022-04-07 19:17:51,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {13956#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {13956#(<= ~counter~0 1)} is VALID [2022-04-07 19:17:51,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {13956#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {13966#(<= ~counter~0 2)} is VALID [2022-04-07 19:17:51,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {13966#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {13966#(<= ~counter~0 2)} is VALID [2022-04-07 19:17:51,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {13966#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {13966#(<= ~counter~0 2)} is VALID [2022-04-07 19:17:51,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {13966#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {13966#(<= ~counter~0 2)} is VALID [2022-04-07 19:17:51,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {13966#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {13979#(<= ~counter~0 3)} is VALID [2022-04-07 19:17:51,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {13979#(<= ~counter~0 3)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {13979#(<= ~counter~0 3)} is VALID [2022-04-07 19:17:51,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {13979#(<= ~counter~0 3)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {13979#(<= ~counter~0 3)} is VALID [2022-04-07 19:17:51,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {13979#(<= ~counter~0 3)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {13989#(<= ~counter~0 4)} is VALID [2022-04-07 19:17:51,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {13989#(<= ~counter~0 4)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {13989#(<= ~counter~0 4)} is VALID [2022-04-07 19:17:51,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {13989#(<= ~counter~0 4)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {13989#(<= ~counter~0 4)} is VALID [2022-04-07 19:17:51,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {13989#(<= ~counter~0 4)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {13999#(<= |main_#t~post8| 4)} is VALID [2022-04-07 19:17:51,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {13999#(<= |main_#t~post8| 4)} [154] L48-1-->L48-4: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {13900#false} is VALID [2022-04-07 19:17:51,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {13900#false} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {13900#false} is VALID [2022-04-07 19:17:51,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {13900#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {13900#false} is VALID [2022-04-07 19:17:51,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {13900#false} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {13900#false} is VALID [2022-04-07 19:17:51,674 INFO L290 TraceCheckUtils]: 35: Hoare triple {13900#false} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {13900#false} is VALID [2022-04-07 19:17:51,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {13900#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {13900#false} is VALID [2022-04-07 19:17:51,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {13900#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {13900#false} is VALID [2022-04-07 19:17:51,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {13900#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {13900#false} is VALID [2022-04-07 19:17:51,675 INFO L272 TraceCheckUtils]: 39: Hoare triple {13900#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {13900#false} is VALID [2022-04-07 19:17:51,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {13900#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13900#false} is VALID [2022-04-07 19:17:51,675 INFO L290 TraceCheckUtils]: 41: Hoare triple {13900#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {13900#false} is VALID [2022-04-07 19:17:51,675 INFO L290 TraceCheckUtils]: 42: Hoare triple {13900#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13900#false} is VALID [2022-04-07 19:17:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:17:51,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:17:51,930 INFO L290 TraceCheckUtils]: 42: Hoare triple {13900#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13900#false} is VALID [2022-04-07 19:17:51,930 INFO L290 TraceCheckUtils]: 41: Hoare triple {13900#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {13900#false} is VALID [2022-04-07 19:17:51,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {13900#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13900#false} is VALID [2022-04-07 19:17:51,931 INFO L272 TraceCheckUtils]: 39: Hoare triple {13900#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {13900#false} is VALID [2022-04-07 19:17:51,931 INFO L290 TraceCheckUtils]: 38: Hoare triple {13900#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {13900#false} is VALID [2022-04-07 19:17:51,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {13900#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {13900#false} is VALID [2022-04-07 19:17:51,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {13900#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {13900#false} is VALID [2022-04-07 19:17:51,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {13900#false} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {13900#false} is VALID [2022-04-07 19:17:51,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {13900#false} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {13900#false} is VALID [2022-04-07 19:17:51,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {13900#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {13900#false} is VALID [2022-04-07 19:17:51,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {13900#false} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {13900#false} is VALID [2022-04-07 19:17:51,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {14069#(< |main_#t~post8| 10)} [154] L48-1-->L48-4: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {13900#false} is VALID [2022-04-07 19:17:51,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {14073#(< ~counter~0 10)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {14069#(< |main_#t~post8| 10)} is VALID [2022-04-07 19:17:51,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {14073#(< ~counter~0 10)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {14073#(< ~counter~0 10)} is VALID [2022-04-07 19:17:51,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {14073#(< ~counter~0 10)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {14073#(< ~counter~0 10)} is VALID [2022-04-07 19:17:51,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {14083#(< ~counter~0 9)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {14073#(< ~counter~0 10)} is VALID [2022-04-07 19:17:51,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {14083#(< ~counter~0 9)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {14083#(< ~counter~0 9)} is VALID [2022-04-07 19:17:51,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {14083#(< ~counter~0 9)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {14083#(< ~counter~0 9)} is VALID [2022-04-07 19:17:51,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {14093#(< ~counter~0 8)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {14083#(< ~counter~0 9)} is VALID [2022-04-07 19:17:51,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {14093#(< ~counter~0 8)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {14093#(< ~counter~0 8)} is VALID [2022-04-07 19:17:51,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {14093#(< ~counter~0 8)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {14093#(< ~counter~0 8)} is VALID [2022-04-07 19:17:51,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {14093#(< ~counter~0 8)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {14093#(< ~counter~0 8)} is VALID [2022-04-07 19:17:51,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {14106#(< ~counter~0 7)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {14093#(< ~counter~0 8)} is VALID [2022-04-07 19:17:51,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {14106#(< ~counter~0 7)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {14106#(< ~counter~0 7)} is VALID [2022-04-07 19:17:51,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {14106#(< ~counter~0 7)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {14106#(< ~counter~0 7)} is VALID [2022-04-07 19:17:51,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {14116#(< ~counter~0 6)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {14106#(< ~counter~0 7)} is VALID [2022-04-07 19:17:51,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {14116#(< ~counter~0 6)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {14116#(< ~counter~0 6)} is VALID [2022-04-07 19:17:51,937 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13899#true} {14116#(< ~counter~0 6)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {14116#(< ~counter~0 6)} is VALID [2022-04-07 19:17:51,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {13899#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13899#true} is VALID [2022-04-07 19:17:51,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {13899#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {13899#true} is VALID [2022-04-07 19:17:51,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {13899#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {13899#true} is VALID [2022-04-07 19:17:51,938 INFO L272 TraceCheckUtils]: 11: Hoare triple {14116#(< ~counter~0 6)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {13899#true} is VALID [2022-04-07 19:17:51,938 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13899#true} {14116#(< ~counter~0 6)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {14116#(< ~counter~0 6)} is VALID [2022-04-07 19:17:51,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {13899#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13899#true} is VALID [2022-04-07 19:17:51,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {13899#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {13899#true} is VALID [2022-04-07 19:17:51,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {13899#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {13899#true} is VALID [2022-04-07 19:17:51,938 INFO L272 TraceCheckUtils]: 6: Hoare triple {14116#(< ~counter~0 6)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {13899#true} is VALID [2022-04-07 19:17:51,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {14116#(< ~counter~0 6)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {14116#(< ~counter~0 6)} is VALID [2022-04-07 19:17:51,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {14116#(< ~counter~0 6)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14116#(< ~counter~0 6)} is VALID [2022-04-07 19:17:51,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14116#(< ~counter~0 6)} {13899#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14116#(< ~counter~0 6)} is VALID [2022-04-07 19:17:51,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {14116#(< ~counter~0 6)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14116#(< ~counter~0 6)} is VALID [2022-04-07 19:17:51,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {13899#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {14116#(< ~counter~0 6)} is VALID [2022-04-07 19:17:51,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {13899#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13899#true} is VALID [2022-04-07 19:17:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:17:51,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:17:51,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137891346] [2022-04-07 19:17:51,940 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:17:51,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588571201] [2022-04-07 19:17:51,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588571201] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:17:51,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:17:51,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-07 19:17:51,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246840071] [2022-04-07 19:17:51,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:17:51,941 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-04-07 19:17:51,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:17:51,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:17:51,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:51,983 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 19:17:51,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:17:51,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 19:17:51,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-07 19:17:51,984 INFO L87 Difference]: Start difference. First operand 736 states and 1085 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:17:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:52,931 INFO L93 Difference]: Finished difference Result 1119 states and 1584 transitions. [2022-04-07 19:17:52,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-07 19:17:52,932 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-04-07 19:17:52,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:17:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:17:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 250 transitions. [2022-04-07 19:17:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:17:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 250 transitions. [2022-04-07 19:17:52,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 250 transitions. [2022-04-07 19:17:53,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:53,197 INFO L225 Difference]: With dead ends: 1119 [2022-04-07 19:17:53,197 INFO L226 Difference]: Without dead ends: 1119 [2022-04-07 19:17:53,197 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2022-04-07 19:17:53,198 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 182 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 19:17:53,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 479 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 19:17:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2022-04-07 19:17:53,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1072. [2022-04-07 19:17:53,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:17:53,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1119 states. Second operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-07 19:17:53,227 INFO L74 IsIncluded]: Start isIncluded. First operand 1119 states. Second operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-07 19:17:53,228 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-07 19:17:53,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:53,333 INFO L93 Difference]: Finished difference Result 1119 states and 1584 transitions. [2022-04-07 19:17:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1584 transitions. [2022-04-07 19:17:53,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:53,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:53,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) Second operand 1119 states. [2022-04-07 19:17:53,340 INFO L87 Difference]: Start difference. First operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) Second operand 1119 states. [2022-04-07 19:17:53,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:53,411 INFO L93 Difference]: Finished difference Result 1119 states and 1584 transitions. [2022-04-07 19:17:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1584 transitions. [2022-04-07 19:17:53,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:53,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:53,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:17:53,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:17:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-07 19:17:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1543 transitions. [2022-04-07 19:17:53,481 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1543 transitions. Word has length 43 [2022-04-07 19:17:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:17:53,481 INFO L478 AbstractCegarLoop]: Abstraction has 1072 states and 1543 transitions. [2022-04-07 19:17:53,481 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:17:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1543 transitions. [2022-04-07 19:17:53,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 19:17:53,482 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:53,482 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:53,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-07 19:17:53,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:53,695 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:53,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:53,696 INFO L85 PathProgramCache]: Analyzing trace with hash -799775801, now seen corresponding path program 2 times [2022-04-07 19:17:53,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:53,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894587345] [2022-04-07 19:17:53,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:53,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:53,716 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:17:53,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [329517863] [2022-04-07 19:17:53,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 19:17:53,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:53,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:53,718 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:17:53,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-07 19:17:53,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 19:17:53,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 19:17:53,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 19:17:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:53,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:17:53,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {18613#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18613#true} is VALID [2022-04-07 19:17:53,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {18613#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {18613#true} is VALID [2022-04-07 19:17:53,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {18613#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18613#true} is VALID [2022-04-07 19:17:53,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18613#true} {18613#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18613#true} is VALID [2022-04-07 19:17:53,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {18613#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18613#true} is VALID [2022-04-07 19:17:53,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {18613#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {18613#true} is VALID [2022-04-07 19:17:53,883 INFO L272 TraceCheckUtils]: 6: Hoare triple {18613#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {18613#true} is VALID [2022-04-07 19:17:53,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {18613#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {18613#true} is VALID [2022-04-07 19:17:53,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {18613#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {18613#true} is VALID [2022-04-07 19:17:53,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {18613#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18613#true} is VALID [2022-04-07 19:17:53,884 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18613#true} {18613#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {18613#true} is VALID [2022-04-07 19:17:53,884 INFO L272 TraceCheckUtils]: 11: Hoare triple {18613#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {18613#true} is VALID [2022-04-07 19:17:53,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {18613#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {18613#true} is VALID [2022-04-07 19:17:53,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {18613#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {18613#true} is VALID [2022-04-07 19:17:53,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {18613#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18613#true} is VALID [2022-04-07 19:17:53,884 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18613#true} {18613#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {18613#true} is VALID [2022-04-07 19:17:53,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {18613#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {18613#true} is VALID [2022-04-07 19:17:53,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {18613#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {18613#true} is VALID [2022-04-07 19:17:53,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {18613#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {18613#true} is VALID [2022-04-07 19:17:53,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {18613#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {18613#true} is VALID [2022-04-07 19:17:53,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {18613#true} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {18613#true} is VALID [2022-04-07 19:17:53,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {18613#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {18613#true} is VALID [2022-04-07 19:17:53,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {18613#true} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {18684#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-07 19:17:53,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {18684#(not (<= main_~b~0 main_~c~0))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {18688#(< main_~b~0 main_~a~0)} is VALID [2022-04-07 19:17:53,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {18688#(< main_~b~0 main_~a~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {18688#(< main_~b~0 main_~a~0)} is VALID [2022-04-07 19:17:53,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {18688#(< main_~b~0 main_~a~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {18688#(< main_~b~0 main_~a~0)} is VALID [2022-04-07 19:17:53,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {18688#(< main_~b~0 main_~a~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {18698#(< main_~b~0 main_~c~0)} is VALID [2022-04-07 19:17:53,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {18698#(< main_~b~0 main_~c~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {18698#(< main_~b~0 main_~c~0)} is VALID [2022-04-07 19:17:53,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {18698#(< main_~b~0 main_~c~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {18698#(< main_~b~0 main_~c~0)} is VALID [2022-04-07 19:17:53,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {18698#(< main_~b~0 main_~c~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {18614#false} is VALID [2022-04-07 19:17:53,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {18614#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {18614#false} is VALID [2022-04-07 19:17:53,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {18614#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {18614#false} is VALID [2022-04-07 19:17:53,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {18614#false} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {18614#false} is VALID [2022-04-07 19:17:53,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {18614#false} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {18614#false} is VALID [2022-04-07 19:17:53,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {18614#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {18614#false} is VALID [2022-04-07 19:17:53,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {18614#false} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {18614#false} is VALID [2022-04-07 19:17:53,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {18614#false} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {18614#false} is VALID [2022-04-07 19:17:53,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {18614#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {18614#false} is VALID [2022-04-07 19:17:53,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {18614#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {18614#false} is VALID [2022-04-07 19:17:53,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {18614#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {18614#false} is VALID [2022-04-07 19:17:53,888 INFO L272 TraceCheckUtils]: 40: Hoare triple {18614#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {18614#false} is VALID [2022-04-07 19:17:53,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {18614#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {18614#false} is VALID [2022-04-07 19:17:53,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {18614#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {18614#false} is VALID [2022-04-07 19:17:53,889 INFO L290 TraceCheckUtils]: 43: Hoare triple {18614#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18614#false} is VALID [2022-04-07 19:17:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-07 19:17:53,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:17:53,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:17:53,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894587345] [2022-04-07 19:17:53,889 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:17:53,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329517863] [2022-04-07 19:17:53,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329517863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:17:53,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:17:53,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:17:53,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472919780] [2022-04-07 19:17:53,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:17:53,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-04-07 19:17:53,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:17:53,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:17:53,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:53,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:17:53,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:17:53,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:17:53,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:17:53,929 INFO L87 Difference]: Start difference. First operand 1072 states and 1543 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:17:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:54,259 INFO L93 Difference]: Finished difference Result 1234 states and 1815 transitions. [2022-04-07 19:17:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 19:17:54,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-04-07 19:17:54,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:17:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:17:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-04-07 19:17:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:17:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-04-07 19:17:54,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 93 transitions. [2022-04-07 19:17:54,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:17:54,420 INFO L225 Difference]: With dead ends: 1234 [2022-04-07 19:17:54,420 INFO L226 Difference]: Without dead ends: 1234 [2022-04-07 19:17:54,421 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-07 19:17:54,421 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 29 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:17:54,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 170 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:17:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-04-07 19:17:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 995. [2022-04-07 19:17:54,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:17:54,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1234 states. Second operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-07 19:17:54,457 INFO L74 IsIncluded]: Start isIncluded. First operand 1234 states. Second operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-07 19:17:54,459 INFO L87 Difference]: Start difference. First operand 1234 states. Second operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-07 19:17:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:54,550 INFO L93 Difference]: Finished difference Result 1234 states and 1815 transitions. [2022-04-07 19:17:54,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1815 transitions. [2022-04-07 19:17:54,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:54,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:54,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) Second operand 1234 states. [2022-04-07 19:17:54,558 INFO L87 Difference]: Start difference. First operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) Second operand 1234 states. [2022-04-07 19:17:54,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:17:54,654 INFO L93 Difference]: Finished difference Result 1234 states and 1815 transitions. [2022-04-07 19:17:54,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1815 transitions. [2022-04-07 19:17:54,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:17:54,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:17:54,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:17:54,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:17:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-07 19:17:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1408 transitions. [2022-04-07 19:17:54,718 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1408 transitions. Word has length 44 [2022-04-07 19:17:54,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:17:54,718 INFO L478 AbstractCegarLoop]: Abstraction has 995 states and 1408 transitions. [2022-04-07 19:17:54,719 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:17:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1408 transitions. [2022-04-07 19:17:54,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-07 19:17:54,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:17:54,719 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:17:54,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-07 19:17:54,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-07 19:17:54,937 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:17:54,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:17:54,937 INFO L85 PathProgramCache]: Analyzing trace with hash -2059301326, now seen corresponding path program 1 times [2022-04-07 19:17:54,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:17:54,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41440220] [2022-04-07 19:17:54,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:54,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:17:54,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:17:54,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [799841310] [2022-04-07 19:17:54,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:17:54,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:17:54,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:17:54,950 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:17:54,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-07 19:17:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:55,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-07 19:17:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:17:55,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:17:55,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {23451#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:17:55,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {23451#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {23451#true} is VALID [2022-04-07 19:17:55,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {23451#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:17:55,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23451#true} {23451#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:17:55,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {23451#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:17:55,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {23451#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23451#true} is VALID [2022-04-07 19:17:55,820 INFO L272 TraceCheckUtils]: 6: Hoare triple {23451#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {23451#true} is VALID [2022-04-07 19:17:55,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {23451#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {23451#true} is VALID [2022-04-07 19:17:55,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {23451#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:17:55,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {23451#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:17:55,820 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23451#true} {23451#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {23451#true} is VALID [2022-04-07 19:17:55,820 INFO L272 TraceCheckUtils]: 11: Hoare triple {23451#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {23451#true} is VALID [2022-04-07 19:17:55,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {23451#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {23451#true} is VALID [2022-04-07 19:17:55,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {23451#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:17:55,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {23451#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:17:55,821 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23451#true} {23451#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {23451#true} is VALID [2022-04-07 19:17:55,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {23451#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23504#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {23504#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {23504#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {23504#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {23504#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {23504#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {23514#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {23514#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {23514#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {23514#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {23514#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {23514#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {23524#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {23524#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {23524#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {23524#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {23524#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,826 INFO L272 TraceCheckUtils]: 25: Hoare triple {23524#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {23451#true} is VALID [2022-04-07 19:17:55,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {23451#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:17:55,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {23537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {23541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:17:55,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {23541#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:17:55,828 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {23541#(not (= |__VERIFIER_assert_#in~cond| 0))} {23524#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {23548#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,828 INFO L272 TraceCheckUtils]: 30: Hoare triple {23548#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {23451#true} is VALID [2022-04-07 19:17:55,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {23451#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:17:55,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {23537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {23541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:17:55,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {23541#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:17:55,830 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23541#(not (= |__VERIFIER_assert_#in~cond| 0))} {23548#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {23548#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,830 INFO L272 TraceCheckUtils]: 35: Hoare triple {23548#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {23451#true} is VALID [2022-04-07 19:17:55,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {23451#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23451#true} is VALID [2022-04-07 19:17:55,830 INFO L290 TraceCheckUtils]: 37: Hoare triple {23451#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:17:55,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {23451#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:17:55,831 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23451#true} {23548#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {23548#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,831 INFO L272 TraceCheckUtils]: 40: Hoare triple {23548#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {23451#true} is VALID [2022-04-07 19:17:55,831 INFO L290 TraceCheckUtils]: 41: Hoare triple {23451#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23451#true} is VALID [2022-04-07 19:17:55,831 INFO L290 TraceCheckUtils]: 42: Hoare triple {23451#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:17:55,831 INFO L290 TraceCheckUtils]: 43: Hoare triple {23451#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:17:55,832 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {23451#true} {23548#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {23548#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {23548#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {23548#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,833 INFO L290 TraceCheckUtils]: 46: Hoare triple {23548#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {23600#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,833 INFO L290 TraceCheckUtils]: 47: Hoare triple {23600#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {23600#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,834 INFO L290 TraceCheckUtils]: 48: Hoare triple {23600#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {23600#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,834 INFO L290 TraceCheckUtils]: 49: Hoare triple {23600#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {23600#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:17:55,835 INFO L290 TraceCheckUtils]: 50: Hoare triple {23600#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23613#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:17:55,835 INFO L290 TraceCheckUtils]: 51: Hoare triple {23613#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {23613#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:17:55,836 INFO L290 TraceCheckUtils]: 52: Hoare triple {23613#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {23613#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:17:55,836 INFO L290 TraceCheckUtils]: 53: Hoare triple {23613#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {23623#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:17:55,837 INFO L272 TraceCheckUtils]: 54: Hoare triple {23623#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0))} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23627#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:17:55,837 INFO L290 TraceCheckUtils]: 55: Hoare triple {23627#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23631#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:17:55,838 INFO L290 TraceCheckUtils]: 56: Hoare triple {23631#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {23452#false} is VALID [2022-04-07 19:17:55,838 INFO L290 TraceCheckUtils]: 57: Hoare triple {23452#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23452#false} is VALID [2022-04-07 19:17:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 19:17:55,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:18:37,937 INFO L290 TraceCheckUtils]: 57: Hoare triple {23452#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23452#false} is VALID [2022-04-07 19:18:37,938 INFO L290 TraceCheckUtils]: 56: Hoare triple {23631#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {23452#false} is VALID [2022-04-07 19:18:37,938 INFO L290 TraceCheckUtils]: 55: Hoare triple {23627#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23631#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:18:37,939 INFO L272 TraceCheckUtils]: 54: Hoare triple {23647#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23627#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:18:37,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {23651#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {23647#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:18:37,940 INFO L290 TraceCheckUtils]: 52: Hoare triple {23651#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {23651#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-07 19:18:37,941 INFO L290 TraceCheckUtils]: 51: Hoare triple {23651#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {23651#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-07 19:18:38,114 INFO L290 TraceCheckUtils]: 50: Hoare triple {23661#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23651#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-07 19:18:38,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {23661#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {23661#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:18:38,116 INFO L290 TraceCheckUtils]: 48: Hoare triple {23661#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {23661#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:18:38,116 INFO L290 TraceCheckUtils]: 47: Hoare triple {23661#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {23661#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:18:38,136 INFO L290 TraceCheckUtils]: 46: Hoare triple {23674#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {23661#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:18:38,137 INFO L290 TraceCheckUtils]: 45: Hoare triple {23674#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {23674#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:18:38,138 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {23451#true} {23674#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {23674#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:18:38,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {23451#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:18:38,138 INFO L290 TraceCheckUtils]: 42: Hoare triple {23451#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:18:38,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {23451#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23451#true} is VALID [2022-04-07 19:18:38,138 INFO L272 TraceCheckUtils]: 40: Hoare triple {23674#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {23451#true} is VALID [2022-04-07 19:18:38,139 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23451#true} {23674#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {23674#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:18:38,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {23451#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:18:38,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {23451#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:18:38,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {23451#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23451#true} is VALID [2022-04-07 19:18:38,139 INFO L272 TraceCheckUtils]: 35: Hoare triple {23674#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {23451#true} is VALID [2022-04-07 19:18:38,140 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23541#(not (= |__VERIFIER_assert_#in~cond| 0))} {23711#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {23674#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:18:38,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {23541#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:18:38,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {23721#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {23541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:18:38,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {23451#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23721#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:18:38,141 INFO L272 TraceCheckUtils]: 30: Hoare triple {23711#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {23451#true} is VALID [2022-04-07 19:18:38,142 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {23541#(not (= |__VERIFIER_assert_#in~cond| 0))} {23728#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {23711#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:18:38,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {23541#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:18:38,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {23721#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {23541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:18:38,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {23451#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23721#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:18:38,143 INFO L272 TraceCheckUtils]: 25: Hoare triple {23728#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {23451#true} is VALID [2022-04-07 19:18:38,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {23728#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {23728#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:18:38,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {23728#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {23728#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:18:38,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {23750#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {23728#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:18:38,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {23750#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {23750#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-07 19:18:38,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {23750#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {23750#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-07 19:18:38,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {23451#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {23750#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-07 19:18:38,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {23451#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {23451#true} is VALID [2022-04-07 19:18:38,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {23451#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {23451#true} is VALID [2022-04-07 19:18:38,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {23451#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23451#true} is VALID [2022-04-07 19:18:38,149 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23451#true} {23451#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {23451#true} is VALID [2022-04-07 19:18:38,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {23451#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:18:38,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {23451#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:18:38,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {23451#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {23451#true} is VALID [2022-04-07 19:18:38,149 INFO L272 TraceCheckUtils]: 11: Hoare triple {23451#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {23451#true} is VALID [2022-04-07 19:18:38,149 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23451#true} {23451#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {23451#true} is VALID [2022-04-07 19:18:38,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {23451#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:18:38,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {23451#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:18:38,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {23451#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {23451#true} is VALID [2022-04-07 19:18:38,149 INFO L272 TraceCheckUtils]: 6: Hoare triple {23451#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {23451#true} is VALID [2022-04-07 19:18:38,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {23451#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23451#true} is VALID [2022-04-07 19:18:38,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {23451#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:18:38,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23451#true} {23451#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:18:38,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {23451#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:18:38,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {23451#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {23451#true} is VALID [2022-04-07 19:18:38,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {23451#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23451#true} is VALID [2022-04-07 19:18:38,150 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 19:18:38,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:18:38,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41440220] [2022-04-07 19:18:38,151 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:18:38,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799841310] [2022-04-07 19:18:38,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799841310] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:18:38,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:18:38,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-07 19:18:38,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518762177] [2022-04-07 19:18:38,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:18:38,152 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-04-07 19:18:38,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:18:38,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-07 19:18:38,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:18:38,312 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-07 19:18:38,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:18:38,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-07 19:18:38,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-07 19:18:38,312 INFO L87 Difference]: Start difference. First operand 995 states and 1408 transitions. Second operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-07 19:18:55,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:18:55,491 INFO L93 Difference]: Finished difference Result 1410 states and 2007 transitions. [2022-04-07 19:18:55,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-07 19:18:55,492 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-04-07 19:18:55,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:18:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-07 19:18:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 307 transitions. [2022-04-07 19:18:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-07 19:18:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 307 transitions. [2022-04-07 19:18:55,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 307 transitions. [2022-04-07 19:19:01,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:19:01,892 INFO L225 Difference]: With dead ends: 1410 [2022-04-07 19:19:01,892 INFO L226 Difference]: Without dead ends: 1404 [2022-04-07 19:19:01,893 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2022-04-07 19:19:01,893 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 164 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-04-07 19:19:01,894 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 606 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-04-07 19:19:01,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-04-07 19:19:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1226. [2022-04-07 19:19:01,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:19:01,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1404 states. Second operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-07 19:19:01,934 INFO L74 IsIncluded]: Start isIncluded. First operand 1404 states. Second operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-07 19:19:01,935 INFO L87 Difference]: Start difference. First operand 1404 states. Second operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-07 19:19:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:02,045 INFO L93 Difference]: Finished difference Result 1404 states and 1984 transitions. [2022-04-07 19:19:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1984 transitions. [2022-04-07 19:19:02,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:19:02,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:19:02,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1404 states. [2022-04-07 19:19:02,054 INFO L87 Difference]: Start difference. First operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1404 states. [2022-04-07 19:19:02,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:02,162 INFO L93 Difference]: Finished difference Result 1404 states and 1984 transitions. [2022-04-07 19:19:02,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1984 transitions. [2022-04-07 19:19:02,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:19:02,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:19:02,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:19:02,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:19:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-07 19:19:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1707 transitions. [2022-04-07 19:19:02,248 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1707 transitions. Word has length 58 [2022-04-07 19:19:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:19:02,248 INFO L478 AbstractCegarLoop]: Abstraction has 1226 states and 1707 transitions. [2022-04-07 19:19:02,248 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-07 19:19:02,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1707 transitions. [2022-04-07 19:19:02,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-07 19:19:02,249 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:19:02,249 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:19:02,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-07 19:19:02,472 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-07 19:19:02,473 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:19:02,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:19:02,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1248898955, now seen corresponding path program 1 times [2022-04-07 19:19:02,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:19:02,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248741638] [2022-04-07 19:19:02,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:19:02,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:19:02,487 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:19:02,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818193413] [2022-04-07 19:19:02,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:19:02,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:19:02,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:19:02,491 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:19:02,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-07 19:19:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:19:02,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-07 19:19:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:19:02,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:19:02,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {29301#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29301#true} is VALID [2022-04-07 19:19:02,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {29301#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {29309#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:02,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {29309#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29309#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:02,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29309#(<= ~counter~0 0)} {29301#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29309#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:02,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {29309#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29309#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:02,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {29309#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {29309#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:02,928 INFO L272 TraceCheckUtils]: 6: Hoare triple {29309#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {29309#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:02,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {29309#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {29309#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:02,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {29309#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {29309#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:02,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {29309#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29309#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:02,929 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29309#(<= ~counter~0 0)} {29309#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {29309#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:02,929 INFO L272 TraceCheckUtils]: 11: Hoare triple {29309#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {29309#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:02,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {29309#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {29309#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:02,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {29309#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {29309#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:02,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {29309#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29309#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:02,931 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29309#(<= ~counter~0 0)} {29309#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {29309#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:02,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {29309#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {29309#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:02,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {29309#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {29358#(<= ~counter~0 1)} is VALID [2022-04-07 19:19:02,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {29358#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {29358#(<= ~counter~0 1)} is VALID [2022-04-07 19:19:02,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {29358#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {29358#(<= ~counter~0 1)} is VALID [2022-04-07 19:19:02,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {29358#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {29368#(<= ~counter~0 2)} is VALID [2022-04-07 19:19:02,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {29368#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {29368#(<= ~counter~0 2)} is VALID [2022-04-07 19:19:02,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {29368#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {29368#(<= ~counter~0 2)} is VALID [2022-04-07 19:19:02,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {29368#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {29368#(<= ~counter~0 2)} is VALID [2022-04-07 19:19:02,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {29368#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {29381#(<= ~counter~0 3)} is VALID [2022-04-07 19:19:02,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {29381#(<= ~counter~0 3)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {29381#(<= ~counter~0 3)} is VALID [2022-04-07 19:19:02,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {29381#(<= ~counter~0 3)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {29381#(<= ~counter~0 3)} is VALID [2022-04-07 19:19:02,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {29381#(<= ~counter~0 3)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {29391#(<= ~counter~0 4)} is VALID [2022-04-07 19:19:02,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {29391#(<= ~counter~0 4)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {29391#(<= ~counter~0 4)} is VALID [2022-04-07 19:19:02,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {29391#(<= ~counter~0 4)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {29391#(<= ~counter~0 4)} is VALID [2022-04-07 19:19:02,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {29391#(<= ~counter~0 4)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {29401#(<= ~counter~0 5)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,937 INFO L272 TraceCheckUtils]: 32: Hoare triple {29401#(<= ~counter~0 5)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {29401#(<= ~counter~0 5)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,938 INFO L290 TraceCheckUtils]: 34: Hoare triple {29401#(<= ~counter~0 5)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,938 INFO L290 TraceCheckUtils]: 35: Hoare triple {29401#(<= ~counter~0 5)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,939 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29401#(<= ~counter~0 5)} {29401#(<= ~counter~0 5)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,939 INFO L272 TraceCheckUtils]: 37: Hoare triple {29401#(<= ~counter~0 5)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {29401#(<= ~counter~0 5)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {29401#(<= ~counter~0 5)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {29401#(<= ~counter~0 5)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,941 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29401#(<= ~counter~0 5)} {29401#(<= ~counter~0 5)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,941 INFO L272 TraceCheckUtils]: 42: Hoare triple {29401#(<= ~counter~0 5)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,942 INFO L290 TraceCheckUtils]: 43: Hoare triple {29401#(<= ~counter~0 5)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,942 INFO L290 TraceCheckUtils]: 44: Hoare triple {29401#(<= ~counter~0 5)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,942 INFO L290 TraceCheckUtils]: 45: Hoare triple {29401#(<= ~counter~0 5)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,943 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29401#(<= ~counter~0 5)} {29401#(<= ~counter~0 5)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,943 INFO L272 TraceCheckUtils]: 47: Hoare triple {29401#(<= ~counter~0 5)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,943 INFO L290 TraceCheckUtils]: 48: Hoare triple {29401#(<= ~counter~0 5)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,944 INFO L290 TraceCheckUtils]: 49: Hoare triple {29401#(<= ~counter~0 5)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,944 INFO L290 TraceCheckUtils]: 50: Hoare triple {29401#(<= ~counter~0 5)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,944 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {29401#(<= ~counter~0 5)} {29401#(<= ~counter~0 5)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,945 INFO L290 TraceCheckUtils]: 52: Hoare triple {29401#(<= ~counter~0 5)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,945 INFO L290 TraceCheckUtils]: 53: Hoare triple {29401#(<= ~counter~0 5)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:02,946 INFO L290 TraceCheckUtils]: 54: Hoare triple {29401#(<= ~counter~0 5)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {29474#(<= ~counter~0 6)} is VALID [2022-04-07 19:19:02,946 INFO L290 TraceCheckUtils]: 55: Hoare triple {29474#(<= ~counter~0 6)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {29474#(<= ~counter~0 6)} is VALID [2022-04-07 19:19:02,946 INFO L290 TraceCheckUtils]: 56: Hoare triple {29474#(<= ~counter~0 6)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {29474#(<= ~counter~0 6)} is VALID [2022-04-07 19:19:02,947 INFO L290 TraceCheckUtils]: 57: Hoare triple {29474#(<= ~counter~0 6)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {29474#(<= ~counter~0 6)} is VALID [2022-04-07 19:19:02,947 INFO L290 TraceCheckUtils]: 58: Hoare triple {29474#(<= ~counter~0 6)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {29487#(<= |main_#t~post6| 6)} is VALID [2022-04-07 19:19:02,947 INFO L290 TraceCheckUtils]: 59: Hoare triple {29487#(<= |main_#t~post6| 6)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {29302#false} is VALID [2022-04-07 19:19:02,947 INFO L272 TraceCheckUtils]: 60: Hoare triple {29302#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {29302#false} is VALID [2022-04-07 19:19:02,947 INFO L290 TraceCheckUtils]: 61: Hoare triple {29302#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29302#false} is VALID [2022-04-07 19:19:02,947 INFO L290 TraceCheckUtils]: 62: Hoare triple {29302#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {29302#false} is VALID [2022-04-07 19:19:02,948 INFO L290 TraceCheckUtils]: 63: Hoare triple {29302#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29302#false} is VALID [2022-04-07 19:19:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-07 19:19:02,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:19:03,340 INFO L290 TraceCheckUtils]: 63: Hoare triple {29302#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29302#false} is VALID [2022-04-07 19:19:03,340 INFO L290 TraceCheckUtils]: 62: Hoare triple {29302#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {29302#false} is VALID [2022-04-07 19:19:03,340 INFO L290 TraceCheckUtils]: 61: Hoare triple {29302#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29302#false} is VALID [2022-04-07 19:19:03,340 INFO L272 TraceCheckUtils]: 60: Hoare triple {29302#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {29302#false} is VALID [2022-04-07 19:19:03,340 INFO L290 TraceCheckUtils]: 59: Hoare triple {29515#(< |main_#t~post6| 10)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {29302#false} is VALID [2022-04-07 19:19:03,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {29519#(< ~counter~0 10)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {29515#(< |main_#t~post6| 10)} is VALID [2022-04-07 19:19:03,341 INFO L290 TraceCheckUtils]: 57: Hoare triple {29519#(< ~counter~0 10)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {29519#(< ~counter~0 10)} is VALID [2022-04-07 19:19:03,342 INFO L290 TraceCheckUtils]: 56: Hoare triple {29519#(< ~counter~0 10)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {29519#(< ~counter~0 10)} is VALID [2022-04-07 19:19:03,342 INFO L290 TraceCheckUtils]: 55: Hoare triple {29519#(< ~counter~0 10)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {29519#(< ~counter~0 10)} is VALID [2022-04-07 19:19:03,343 INFO L290 TraceCheckUtils]: 54: Hoare triple {29532#(< ~counter~0 9)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {29519#(< ~counter~0 10)} is VALID [2022-04-07 19:19:03,343 INFO L290 TraceCheckUtils]: 53: Hoare triple {29532#(< ~counter~0 9)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {29532#(< ~counter~0 9)} is VALID [2022-04-07 19:19:03,344 INFO L290 TraceCheckUtils]: 52: Hoare triple {29532#(< ~counter~0 9)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {29532#(< ~counter~0 9)} is VALID [2022-04-07 19:19:03,344 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {29301#true} {29532#(< ~counter~0 9)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {29532#(< ~counter~0 9)} is VALID [2022-04-07 19:19:03,345 INFO L290 TraceCheckUtils]: 50: Hoare triple {29301#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29301#true} is VALID [2022-04-07 19:19:03,345 INFO L290 TraceCheckUtils]: 49: Hoare triple {29301#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {29301#true} is VALID [2022-04-07 19:19:03,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {29301#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29301#true} is VALID [2022-04-07 19:19:03,345 INFO L272 TraceCheckUtils]: 47: Hoare triple {29532#(< ~counter~0 9)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {29301#true} is VALID [2022-04-07 19:19:03,345 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29301#true} {29532#(< ~counter~0 9)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {29532#(< ~counter~0 9)} is VALID [2022-04-07 19:19:03,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {29301#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29301#true} is VALID [2022-04-07 19:19:03,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {29301#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {29301#true} is VALID [2022-04-07 19:19:03,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {29301#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29301#true} is VALID [2022-04-07 19:19:03,346 INFO L272 TraceCheckUtils]: 42: Hoare triple {29532#(< ~counter~0 9)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {29301#true} is VALID [2022-04-07 19:19:03,347 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29301#true} {29532#(< ~counter~0 9)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {29532#(< ~counter~0 9)} is VALID [2022-04-07 19:19:03,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {29301#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29301#true} is VALID [2022-04-07 19:19:03,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {29301#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {29301#true} is VALID [2022-04-07 19:19:03,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {29301#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29301#true} is VALID [2022-04-07 19:19:03,347 INFO L272 TraceCheckUtils]: 37: Hoare triple {29532#(< ~counter~0 9)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {29301#true} is VALID [2022-04-07 19:19:03,348 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29301#true} {29532#(< ~counter~0 9)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {29532#(< ~counter~0 9)} is VALID [2022-04-07 19:19:03,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {29301#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29301#true} is VALID [2022-04-07 19:19:03,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {29301#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {29301#true} is VALID [2022-04-07 19:19:03,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {29301#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29301#true} is VALID [2022-04-07 19:19:03,348 INFO L272 TraceCheckUtils]: 32: Hoare triple {29532#(< ~counter~0 9)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {29301#true} is VALID [2022-04-07 19:19:03,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {29532#(< ~counter~0 9)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {29532#(< ~counter~0 9)} is VALID [2022-04-07 19:19:03,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {29605#(< ~counter~0 8)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {29532#(< ~counter~0 9)} is VALID [2022-04-07 19:19:03,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {29605#(< ~counter~0 8)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {29605#(< ~counter~0 8)} is VALID [2022-04-07 19:19:03,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {29605#(< ~counter~0 8)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {29605#(< ~counter~0 8)} is VALID [2022-04-07 19:19:03,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {29474#(<= ~counter~0 6)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {29605#(< ~counter~0 8)} is VALID [2022-04-07 19:19:03,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {29474#(<= ~counter~0 6)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {29474#(<= ~counter~0 6)} is VALID [2022-04-07 19:19:03,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {29474#(<= ~counter~0 6)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {29474#(<= ~counter~0 6)} is VALID [2022-04-07 19:19:03,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {29401#(<= ~counter~0 5)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {29474#(<= ~counter~0 6)} is VALID [2022-04-07 19:19:03,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {29401#(<= ~counter~0 5)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:03,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {29401#(<= ~counter~0 5)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:03,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {29401#(<= ~counter~0 5)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:03,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {29391#(<= ~counter~0 4)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {29401#(<= ~counter~0 5)} is VALID [2022-04-07 19:19:03,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {29391#(<= ~counter~0 4)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {29391#(<= ~counter~0 4)} is VALID [2022-04-07 19:19:03,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {29391#(<= ~counter~0 4)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {29391#(<= ~counter~0 4)} is VALID [2022-04-07 19:19:03,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {29381#(<= ~counter~0 3)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {29391#(<= ~counter~0 4)} is VALID [2022-04-07 19:19:03,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {29381#(<= ~counter~0 3)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {29381#(<= ~counter~0 3)} is VALID [2022-04-07 19:19:03,356 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29301#true} {29381#(<= ~counter~0 3)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {29381#(<= ~counter~0 3)} is VALID [2022-04-07 19:19:03,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {29301#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29301#true} is VALID [2022-04-07 19:19:03,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {29301#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {29301#true} is VALID [2022-04-07 19:19:03,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {29301#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {29301#true} is VALID [2022-04-07 19:19:03,356 INFO L272 TraceCheckUtils]: 11: Hoare triple {29381#(<= ~counter~0 3)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {29301#true} is VALID [2022-04-07 19:19:03,357 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29301#true} {29381#(<= ~counter~0 3)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {29381#(<= ~counter~0 3)} is VALID [2022-04-07 19:19:03,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {29301#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29301#true} is VALID [2022-04-07 19:19:03,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {29301#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {29301#true} is VALID [2022-04-07 19:19:03,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {29301#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {29301#true} is VALID [2022-04-07 19:19:03,357 INFO L272 TraceCheckUtils]: 6: Hoare triple {29381#(<= ~counter~0 3)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {29301#true} is VALID [2022-04-07 19:19:03,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {29381#(<= ~counter~0 3)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {29381#(<= ~counter~0 3)} is VALID [2022-04-07 19:19:03,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {29381#(<= ~counter~0 3)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29381#(<= ~counter~0 3)} is VALID [2022-04-07 19:19:03,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29381#(<= ~counter~0 3)} {29301#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29381#(<= ~counter~0 3)} is VALID [2022-04-07 19:19:03,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {29381#(<= ~counter~0 3)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29381#(<= ~counter~0 3)} is VALID [2022-04-07 19:19:03,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {29301#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {29381#(<= ~counter~0 3)} is VALID [2022-04-07 19:19:03,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {29301#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29301#true} is VALID [2022-04-07 19:19:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-07 19:19:03,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:19:03,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248741638] [2022-04-07 19:19:03,360 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:19:03,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818193413] [2022-04-07 19:19:03,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818193413] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:19:03,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:19:03,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-07 19:19:03,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369047412] [2022-04-07 19:19:03,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:19:03,361 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 64 [2022-04-07 19:19:03,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:19:03,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-07 19:19:03,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:19:03,437 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 19:19:03,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:19:03,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 19:19:03,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-07 19:19:03,438 INFO L87 Difference]: Start difference. First operand 1226 states and 1707 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-07 19:19:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:04,212 INFO L93 Difference]: Finished difference Result 1292 states and 1758 transitions. [2022-04-07 19:19:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-07 19:19:04,212 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 64 [2022-04-07 19:19:04,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:19:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-07 19:19:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 238 transitions. [2022-04-07 19:19:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-07 19:19:04,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 238 transitions. [2022-04-07 19:19:04,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 238 transitions. [2022-04-07 19:19:04,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:19:04,479 INFO L225 Difference]: With dead ends: 1292 [2022-04-07 19:19:04,480 INFO L226 Difference]: Without dead ends: 1292 [2022-04-07 19:19:04,480 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2022-04-07 19:19:04,481 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 219 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:19:04,481 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 295 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 19:19:04,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2022-04-07 19:19:04,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1255. [2022-04-07 19:19:04,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:19:04,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1292 states. Second operand has 1255 states, 875 states have (on average 1.2765714285714285) internal successors, (1117), 893 states have internal predecessors, (1117), 307 states have call successors, (307), 73 states have call predecessors, (307), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-07 19:19:04,510 INFO L74 IsIncluded]: Start isIncluded. First operand 1292 states. Second operand has 1255 states, 875 states have (on average 1.2765714285714285) internal successors, (1117), 893 states have internal predecessors, (1117), 307 states have call successors, (307), 73 states have call predecessors, (307), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-07 19:19:04,511 INFO L87 Difference]: Start difference. First operand 1292 states. Second operand has 1255 states, 875 states have (on average 1.2765714285714285) internal successors, (1117), 893 states have internal predecessors, (1117), 307 states have call successors, (307), 73 states have call predecessors, (307), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-07 19:19:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:04,593 INFO L93 Difference]: Finished difference Result 1292 states and 1758 transitions. [2022-04-07 19:19:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1758 transitions. [2022-04-07 19:19:04,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:19:04,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:19:04,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 1255 states, 875 states have (on average 1.2765714285714285) internal successors, (1117), 893 states have internal predecessors, (1117), 307 states have call successors, (307), 73 states have call predecessors, (307), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1292 states. [2022-04-07 19:19:04,600 INFO L87 Difference]: Start difference. First operand has 1255 states, 875 states have (on average 1.2765714285714285) internal successors, (1117), 893 states have internal predecessors, (1117), 307 states have call successors, (307), 73 states have call predecessors, (307), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1292 states. [2022-04-07 19:19:04,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:04,682 INFO L93 Difference]: Finished difference Result 1292 states and 1758 transitions. [2022-04-07 19:19:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1758 transitions. [2022-04-07 19:19:04,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:19:04,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:19:04,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:19:04,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:19:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 875 states have (on average 1.2765714285714285) internal successors, (1117), 893 states have internal predecessors, (1117), 307 states have call successors, (307), 73 states have call predecessors, (307), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-07 19:19:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1727 transitions. [2022-04-07 19:19:04,776 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1727 transitions. Word has length 64 [2022-04-07 19:19:04,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:19:04,776 INFO L478 AbstractCegarLoop]: Abstraction has 1255 states and 1727 transitions. [2022-04-07 19:19:04,776 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-07 19:19:04,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1727 transitions. [2022-04-07 19:19:04,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-07 19:19:04,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:19:04,777 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:19:04,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-07 19:19:04,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-07 19:19:04,992 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:19:04,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:19:04,993 INFO L85 PathProgramCache]: Analyzing trace with hash -934249537, now seen corresponding path program 1 times [2022-04-07 19:19:04,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:19:04,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826098319] [2022-04-07 19:19:04,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:19:04,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:19:05,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:19:05,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [534339337] [2022-04-07 19:19:05,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:19:05,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:19:05,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:19:05,009 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:19:05,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-07 19:19:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:19:05,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 19:19:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:19:05,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:19:05,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {34843#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {34843#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {34843#true} is VALID [2022-04-07 19:19:05,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {34843#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34843#true} {34843#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {34843#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {34843#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {34843#true} is VALID [2022-04-07 19:19:05,434 INFO L272 TraceCheckUtils]: 6: Hoare triple {34843#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {34843#true} is VALID [2022-04-07 19:19:05,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {34843#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34843#true} is VALID [2022-04-07 19:19:05,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {34843#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {34843#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,434 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34843#true} {34843#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {34843#true} is VALID [2022-04-07 19:19:05,435 INFO L272 TraceCheckUtils]: 11: Hoare triple {34843#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {34843#true} is VALID [2022-04-07 19:19:05,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {34843#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34884#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:19:05,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {34884#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {34888#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:19:05,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {34888#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34888#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:19:05,436 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34888#(not (= |assume_abort_if_not_#in~cond| 0))} {34843#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {34895#(<= 1 main_~y~0)} is VALID [2022-04-07 19:19:05,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {34895#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {34899#(<= 1 main_~b~0)} is VALID [2022-04-07 19:19:05,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {34899#(<= 1 main_~b~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {34899#(<= 1 main_~b~0)} is VALID [2022-04-07 19:19:05,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {34899#(<= 1 main_~b~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {34899#(<= 1 main_~b~0)} is VALID [2022-04-07 19:19:05,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {34899#(<= 1 main_~b~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {34899#(<= 1 main_~b~0)} is VALID [2022-04-07 19:19:05,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {34899#(<= 1 main_~b~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {34899#(<= 1 main_~b~0)} is VALID [2022-04-07 19:19:05,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {34899#(<= 1 main_~b~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {34899#(<= 1 main_~b~0)} is VALID [2022-04-07 19:19:05,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {34899#(<= 1 main_~b~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-07 19:19:05,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-07 19:19:05,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-07 19:19:05,439 INFO L272 TraceCheckUtils]: 25: Hoare triple {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {34843#true} is VALID [2022-04-07 19:19:05,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {34843#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34843#true} is VALID [2022-04-07 19:19:05,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {34843#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {34843#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,440 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {34843#true} {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-07 19:19:05,440 INFO L272 TraceCheckUtils]: 30: Hoare triple {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {34843#true} is VALID [2022-04-07 19:19:05,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {34843#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34843#true} is VALID [2022-04-07 19:19:05,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {34843#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {34843#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,441 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {34843#true} {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-07 19:19:05,441 INFO L272 TraceCheckUtils]: 35: Hoare triple {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {34843#true} is VALID [2022-04-07 19:19:05,441 INFO L290 TraceCheckUtils]: 36: Hoare triple {34843#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34843#true} is VALID [2022-04-07 19:19:05,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {34843#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,441 INFO L290 TraceCheckUtils]: 38: Hoare triple {34843#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,445 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {34843#true} {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-07 19:19:05,445 INFO L272 TraceCheckUtils]: 40: Hoare triple {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {34843#true} is VALID [2022-04-07 19:19:05,445 INFO L290 TraceCheckUtils]: 41: Hoare triple {34843#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34843#true} is VALID [2022-04-07 19:19:05,445 INFO L290 TraceCheckUtils]: 42: Hoare triple {34843#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {34843#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,445 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {34843#true} {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-07 19:19:05,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {34918#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [150] L52-->L48-3: Formula: (let ((.cse0 (* v_main_~v~0_7 2))) (and (<= .cse0 v_main_~c~0_10) (= v_main_~v~0_6 .cse0) (= v_main_~d~0_5 (* v_main_~d~0_6 2)))) InVars {main_~c~0=v_main_~c~0_10, main_~v~0=v_main_~v~0_7, main_~d~0=v_main_~d~0_6} OutVars{main_~c~0=v_main_~c~0_10, main_~v~0=v_main_~v~0_6, main_~d~0=v_main_~d~0_5} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {34988#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-07 19:19:05,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {34988#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {34988#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-07 19:19:05,447 INFO L290 TraceCheckUtils]: 47: Hoare triple {34988#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {34988#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-07 19:19:05,447 INFO L272 TraceCheckUtils]: 48: Hoare triple {34988#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {34843#true} is VALID [2022-04-07 19:19:05,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {34843#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34843#true} is VALID [2022-04-07 19:19:05,447 INFO L290 TraceCheckUtils]: 50: Hoare triple {34843#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,447 INFO L290 TraceCheckUtils]: 51: Hoare triple {34843#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,448 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {34843#true} {34988#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {34988#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-07 19:19:05,448 INFO L272 TraceCheckUtils]: 53: Hoare triple {34988#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {34843#true} is VALID [2022-04-07 19:19:05,448 INFO L290 TraceCheckUtils]: 54: Hoare triple {34843#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34843#true} is VALID [2022-04-07 19:19:05,448 INFO L290 TraceCheckUtils]: 55: Hoare triple {34843#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,448 INFO L290 TraceCheckUtils]: 56: Hoare triple {34843#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,450 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {34843#true} {34988#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {34988#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-07 19:19:05,450 INFO L272 TraceCheckUtils]: 58: Hoare triple {34988#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {34843#true} is VALID [2022-04-07 19:19:05,450 INFO L290 TraceCheckUtils]: 59: Hoare triple {34843#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34843#true} is VALID [2022-04-07 19:19:05,450 INFO L290 TraceCheckUtils]: 60: Hoare triple {34843#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {34843#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,451 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {34843#true} {34988#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {34988#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-07 19:19:05,452 INFO L272 TraceCheckUtils]: 63: Hoare triple {34988#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {35043#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:19:05,452 INFO L290 TraceCheckUtils]: 64: Hoare triple {35043#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {35047#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:19:05,452 INFO L290 TraceCheckUtils]: 65: Hoare triple {35047#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {34844#false} is VALID [2022-04-07 19:19:05,452 INFO L290 TraceCheckUtils]: 66: Hoare triple {34844#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34844#false} is VALID [2022-04-07 19:19:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-04-07 19:19:05,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:19:05,701 INFO L290 TraceCheckUtils]: 66: Hoare triple {34844#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34844#false} is VALID [2022-04-07 19:19:05,701 INFO L290 TraceCheckUtils]: 65: Hoare triple {35047#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {34844#false} is VALID [2022-04-07 19:19:05,702 INFO L290 TraceCheckUtils]: 64: Hoare triple {35043#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {35047#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:19:05,702 INFO L272 TraceCheckUtils]: 63: Hoare triple {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {35043#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:19:05,703 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {34843#true} {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-07 19:19:05,703 INFO L290 TraceCheckUtils]: 61: Hoare triple {34843#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,703 INFO L290 TraceCheckUtils]: 60: Hoare triple {34843#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,703 INFO L290 TraceCheckUtils]: 59: Hoare triple {34843#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34843#true} is VALID [2022-04-07 19:19:05,703 INFO L272 TraceCheckUtils]: 58: Hoare triple {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {34843#true} is VALID [2022-04-07 19:19:05,704 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {34843#true} {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-07 19:19:05,704 INFO L290 TraceCheckUtils]: 56: Hoare triple {34843#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,704 INFO L290 TraceCheckUtils]: 55: Hoare triple {34843#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,704 INFO L290 TraceCheckUtils]: 54: Hoare triple {34843#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34843#true} is VALID [2022-04-07 19:19:05,704 INFO L272 TraceCheckUtils]: 53: Hoare triple {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {34843#true} is VALID [2022-04-07 19:19:05,705 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {34843#true} {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-07 19:19:05,705 INFO L290 TraceCheckUtils]: 51: Hoare triple {34843#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,705 INFO L290 TraceCheckUtils]: 50: Hoare triple {34843#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,705 INFO L290 TraceCheckUtils]: 49: Hoare triple {34843#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34843#true} is VALID [2022-04-07 19:19:05,705 INFO L272 TraceCheckUtils]: 48: Hoare triple {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {34843#true} is VALID [2022-04-07 19:19:05,705 INFO L290 TraceCheckUtils]: 47: Hoare triple {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-07 19:19:05,706 INFO L290 TraceCheckUtils]: 46: Hoare triple {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-07 19:19:05,708 INFO L290 TraceCheckUtils]: 45: Hoare triple {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [150] L52-->L48-3: Formula: (let ((.cse0 (* v_main_~v~0_7 2))) (and (<= .cse0 v_main_~c~0_10) (= v_main_~v~0_6 .cse0) (= v_main_~d~0_5 (* v_main_~d~0_6 2)))) InVars {main_~c~0=v_main_~c~0_10, main_~v~0=v_main_~v~0_7, main_~d~0=v_main_~d~0_6} OutVars{main_~c~0=v_main_~c~0_10, main_~v~0=v_main_~v~0_6, main_~d~0=v_main_~d~0_5} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-07 19:19:05,708 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {34843#true} {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-07 19:19:05,708 INFO L290 TraceCheckUtils]: 43: Hoare triple {34843#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,708 INFO L290 TraceCheckUtils]: 42: Hoare triple {34843#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,708 INFO L290 TraceCheckUtils]: 41: Hoare triple {34843#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34843#true} is VALID [2022-04-07 19:19:05,708 INFO L272 TraceCheckUtils]: 40: Hoare triple {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {34843#true} is VALID [2022-04-07 19:19:05,709 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {34843#true} {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-07 19:19:05,709 INFO L290 TraceCheckUtils]: 38: Hoare triple {34843#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,709 INFO L290 TraceCheckUtils]: 37: Hoare triple {34843#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,709 INFO L290 TraceCheckUtils]: 36: Hoare triple {34843#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34843#true} is VALID [2022-04-07 19:19:05,709 INFO L272 TraceCheckUtils]: 35: Hoare triple {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {34843#true} is VALID [2022-04-07 19:19:05,710 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {34843#true} {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-07 19:19:05,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {34843#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {34843#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {34843#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34843#true} is VALID [2022-04-07 19:19:05,710 INFO L272 TraceCheckUtils]: 30: Hoare triple {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {34843#true} is VALID [2022-04-07 19:19:05,711 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {34843#true} {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-07 19:19:05,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {34843#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {34843#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {34843#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34843#true} is VALID [2022-04-07 19:19:05,711 INFO L272 TraceCheckUtils]: 25: Hoare triple {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {34843#true} is VALID [2022-04-07 19:19:05,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-07 19:19:05,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-07 19:19:05,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {34843#true} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {35063#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-07 19:19:05,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {34843#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {34843#true} is VALID [2022-04-07 19:19:05,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {34843#true} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {34843#true} is VALID [2022-04-07 19:19:05,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {34843#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {34843#true} is VALID [2022-04-07 19:19:05,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {34843#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {34843#true} is VALID [2022-04-07 19:19:05,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {34843#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {34843#true} is VALID [2022-04-07 19:19:05,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {34843#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {34843#true} is VALID [2022-04-07 19:19:05,712 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34843#true} {34843#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {34843#true} is VALID [2022-04-07 19:19:05,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {34843#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {34843#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {34843#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34843#true} is VALID [2022-04-07 19:19:05,713 INFO L272 TraceCheckUtils]: 11: Hoare triple {34843#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {34843#true} is VALID [2022-04-07 19:19:05,713 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34843#true} {34843#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {34843#true} is VALID [2022-04-07 19:19:05,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {34843#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {34843#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {34843#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34843#true} is VALID [2022-04-07 19:19:05,713 INFO L272 TraceCheckUtils]: 6: Hoare triple {34843#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {34843#true} is VALID [2022-04-07 19:19:05,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {34843#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {34843#true} is VALID [2022-04-07 19:19:05,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {34843#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34843#true} {34843#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {34843#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {34843#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {34843#true} is VALID [2022-04-07 19:19:05,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {34843#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34843#true} is VALID [2022-04-07 19:19:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-07 19:19:05,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:19:05,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826098319] [2022-04-07 19:19:05,714 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:19:05,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534339337] [2022-04-07 19:19:05,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534339337] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 19:19:05,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 19:19:05,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-07 19:19:05,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776000709] [2022-04-07 19:19:05,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:19:05,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2022-04-07 19:19:05,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:19:05,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:19:05,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:19:05,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:19:05,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:19:05,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:19:05,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-07 19:19:05,746 INFO L87 Difference]: Start difference. First operand 1255 states and 1727 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:19:05,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:05,951 INFO L93 Difference]: Finished difference Result 1283 states and 1748 transitions. [2022-04-07 19:19:05,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:19:05,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2022-04-07 19:19:05,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:19:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:19:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-07 19:19:05,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:19:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-07 19:19:05,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-07 19:19:06,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:19:06,047 INFO L225 Difference]: With dead ends: 1283 [2022-04-07 19:19:06,048 INFO L226 Difference]: Without dead ends: 1283 [2022-04-07 19:19:06,048 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-07 19:19:06,048 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:19:06,049 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 147 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:19:06,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2022-04-07 19:19:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1275. [2022-04-07 19:19:06,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:19:06,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1283 states. Second operand has 1275 states, 890 states have (on average 1.2696629213483146) internal successors, (1130), 908 states have internal predecessors, (1130), 307 states have call successors, (307), 78 states have call predecessors, (307), 77 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-07 19:19:06,080 INFO L74 IsIncluded]: Start isIncluded. First operand 1283 states. Second operand has 1275 states, 890 states have (on average 1.2696629213483146) internal successors, (1130), 908 states have internal predecessors, (1130), 307 states have call successors, (307), 78 states have call predecessors, (307), 77 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-07 19:19:06,081 INFO L87 Difference]: Start difference. First operand 1283 states. Second operand has 1275 states, 890 states have (on average 1.2696629213483146) internal successors, (1130), 908 states have internal predecessors, (1130), 307 states have call successors, (307), 78 states have call predecessors, (307), 77 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-07 19:19:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:06,159 INFO L93 Difference]: Finished difference Result 1283 states and 1748 transitions. [2022-04-07 19:19:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1748 transitions. [2022-04-07 19:19:06,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:19:06,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:19:06,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 1275 states, 890 states have (on average 1.2696629213483146) internal successors, (1130), 908 states have internal predecessors, (1130), 307 states have call successors, (307), 78 states have call predecessors, (307), 77 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1283 states. [2022-04-07 19:19:06,166 INFO L87 Difference]: Start difference. First operand has 1275 states, 890 states have (on average 1.2696629213483146) internal successors, (1130), 908 states have internal predecessors, (1130), 307 states have call successors, (307), 78 states have call predecessors, (307), 77 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1283 states. [2022-04-07 19:19:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:06,239 INFO L93 Difference]: Finished difference Result 1283 states and 1748 transitions. [2022-04-07 19:19:06,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1748 transitions. [2022-04-07 19:19:06,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:19:06,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:19:06,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:19:06,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:19:06,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 890 states have (on average 1.2696629213483146) internal successors, (1130), 908 states have internal predecessors, (1130), 307 states have call successors, (307), 78 states have call predecessors, (307), 77 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-07 19:19:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1740 transitions. [2022-04-07 19:19:06,322 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1740 transitions. Word has length 67 [2022-04-07 19:19:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:19:06,323 INFO L478 AbstractCegarLoop]: Abstraction has 1275 states and 1740 transitions. [2022-04-07 19:19:06,323 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:19:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1740 transitions. [2022-04-07 19:19:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-07 19:19:06,324 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:19:06,324 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:19:06,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-07 19:19:06,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:19:06,539 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:19:06,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:19:06,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1422612783, now seen corresponding path program 1 times [2022-04-07 19:19:06,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:19:06,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317909490] [2022-04-07 19:19:06,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:19:06,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:19:06,556 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:19:06,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [768141521] [2022-04-07 19:19:06,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:19:06,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:19:06,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:19:06,557 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:19:06,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-07 19:19:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:19:06,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-07 19:19:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:19:06,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:19:06,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {40381#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {40381#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {40381#true} is VALID [2022-04-07 19:19:06,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {40381#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40381#true} {40381#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {40381#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {40381#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {40381#true} is VALID [2022-04-07 19:19:06,868 INFO L272 TraceCheckUtils]: 6: Hoare triple {40381#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {40381#true} is VALID [2022-04-07 19:19:06,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {40381#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40381#true} is VALID [2022-04-07 19:19:06,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {40381#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {40381#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,868 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40381#true} {40381#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {40381#true} is VALID [2022-04-07 19:19:06,869 INFO L272 TraceCheckUtils]: 11: Hoare triple {40381#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {40381#true} is VALID [2022-04-07 19:19:06,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {40381#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40381#true} is VALID [2022-04-07 19:19:06,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {40381#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {40381#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,869 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40381#true} {40381#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {40381#true} is VALID [2022-04-07 19:19:06,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {40381#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {40381#true} is VALID [2022-04-07 19:19:06,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {40381#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {40381#true} is VALID [2022-04-07 19:19:06,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {40381#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {40381#true} is VALID [2022-04-07 19:19:06,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {40381#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {40381#true} is VALID [2022-04-07 19:19:06,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {40381#true} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {40381#true} is VALID [2022-04-07 19:19:06,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {40381#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {40381#true} is VALID [2022-04-07 19:19:06,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {40381#true} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {40381#true} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {40381#true} is VALID [2022-04-07 19:19:06,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {40381#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {40381#true} is VALID [2022-04-07 19:19:06,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {40381#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {40381#true} is VALID [2022-04-07 19:19:06,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {40381#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {40381#true} is VALID [2022-04-07 19:19:06,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {40381#true} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {40381#true} is VALID [2022-04-07 19:19:06,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {40381#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {40381#true} is VALID [2022-04-07 19:19:06,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {40381#true} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {40473#(<= main_~v~0 main_~b~0)} is VALID [2022-04-07 19:19:06,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {40473#(<= main_~v~0 main_~b~0)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {40473#(<= main_~v~0 main_~b~0)} is VALID [2022-04-07 19:19:06,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {40473#(<= main_~v~0 main_~b~0)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {40473#(<= main_~v~0 main_~b~0)} is VALID [2022-04-07 19:19:06,871 INFO L272 TraceCheckUtils]: 32: Hoare triple {40473#(<= main_~v~0 main_~b~0)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {40381#true} is VALID [2022-04-07 19:19:06,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {40381#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {40381#true} is VALID [2022-04-07 19:19:06,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {40381#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {40381#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,873 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {40381#true} {40473#(<= main_~v~0 main_~b~0)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {40473#(<= main_~v~0 main_~b~0)} is VALID [2022-04-07 19:19:06,873 INFO L272 TraceCheckUtils]: 37: Hoare triple {40473#(<= main_~v~0 main_~b~0)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {40381#true} is VALID [2022-04-07 19:19:06,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {40381#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {40381#true} is VALID [2022-04-07 19:19:06,873 INFO L290 TraceCheckUtils]: 39: Hoare triple {40381#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,873 INFO L290 TraceCheckUtils]: 40: Hoare triple {40381#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,874 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {40381#true} {40473#(<= main_~v~0 main_~b~0)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {40473#(<= main_~v~0 main_~b~0)} is VALID [2022-04-07 19:19:06,874 INFO L272 TraceCheckUtils]: 42: Hoare triple {40473#(<= main_~v~0 main_~b~0)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {40381#true} is VALID [2022-04-07 19:19:06,874 INFO L290 TraceCheckUtils]: 43: Hoare triple {40381#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {40381#true} is VALID [2022-04-07 19:19:06,874 INFO L290 TraceCheckUtils]: 44: Hoare triple {40381#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,874 INFO L290 TraceCheckUtils]: 45: Hoare triple {40381#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,875 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {40381#true} {40473#(<= main_~v~0 main_~b~0)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {40473#(<= main_~v~0 main_~b~0)} is VALID [2022-04-07 19:19:06,875 INFO L272 TraceCheckUtils]: 47: Hoare triple {40473#(<= main_~v~0 main_~b~0)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {40381#true} is VALID [2022-04-07 19:19:06,875 INFO L290 TraceCheckUtils]: 48: Hoare triple {40381#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {40381#true} is VALID [2022-04-07 19:19:06,875 INFO L290 TraceCheckUtils]: 49: Hoare triple {40381#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,875 INFO L290 TraceCheckUtils]: 50: Hoare triple {40381#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40381#true} is VALID [2022-04-07 19:19:06,876 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {40381#true} {40473#(<= main_~v~0 main_~b~0)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {40473#(<= main_~v~0 main_~b~0)} is VALID [2022-04-07 19:19:06,876 INFO L290 TraceCheckUtils]: 52: Hoare triple {40473#(<= main_~v~0 main_~b~0)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {40543#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-07 19:19:06,877 INFO L290 TraceCheckUtils]: 53: Hoare triple {40543#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {40547#(< main_~c~0 main_~b~0)} is VALID [2022-04-07 19:19:06,878 INFO L290 TraceCheckUtils]: 54: Hoare triple {40547#(< main_~c~0 main_~b~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {40547#(< main_~c~0 main_~b~0)} is VALID [2022-04-07 19:19:06,878 INFO L290 TraceCheckUtils]: 55: Hoare triple {40547#(< main_~c~0 main_~b~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {40547#(< main_~c~0 main_~b~0)} is VALID [2022-04-07 19:19:06,878 INFO L290 TraceCheckUtils]: 56: Hoare triple {40547#(< main_~c~0 main_~b~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {40382#false} is VALID [2022-04-07 19:19:06,878 INFO L290 TraceCheckUtils]: 57: Hoare triple {40382#false} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {40382#false} is VALID [2022-04-07 19:19:06,879 INFO L290 TraceCheckUtils]: 58: Hoare triple {40382#false} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {40382#false} is VALID [2022-04-07 19:19:06,879 INFO L272 TraceCheckUtils]: 59: Hoare triple {40382#false} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {40382#false} is VALID [2022-04-07 19:19:06,879 INFO L290 TraceCheckUtils]: 60: Hoare triple {40382#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {40382#false} is VALID [2022-04-07 19:19:06,879 INFO L290 TraceCheckUtils]: 61: Hoare triple {40382#false} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {40382#false} is VALID [2022-04-07 19:19:06,879 INFO L290 TraceCheckUtils]: 62: Hoare triple {40382#false} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40382#false} is VALID [2022-04-07 19:19:06,879 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {40382#false} {40382#false} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {40382#false} is VALID [2022-04-07 19:19:06,879 INFO L272 TraceCheckUtils]: 64: Hoare triple {40382#false} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {40382#false} is VALID [2022-04-07 19:19:06,879 INFO L290 TraceCheckUtils]: 65: Hoare triple {40382#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {40382#false} is VALID [2022-04-07 19:19:06,879 INFO L290 TraceCheckUtils]: 66: Hoare triple {40382#false} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {40382#false} is VALID [2022-04-07 19:19:06,879 INFO L290 TraceCheckUtils]: 67: Hoare triple {40382#false} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40382#false} is VALID [2022-04-07 19:19:06,880 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {40382#false} {40382#false} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {40382#false} is VALID [2022-04-07 19:19:06,880 INFO L272 TraceCheckUtils]: 69: Hoare triple {40382#false} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {40382#false} is VALID [2022-04-07 19:19:06,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {40382#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {40382#false} is VALID [2022-04-07 19:19:06,880 INFO L290 TraceCheckUtils]: 71: Hoare triple {40382#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {40382#false} is VALID [2022-04-07 19:19:06,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {40382#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40382#false} is VALID [2022-04-07 19:19:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-07 19:19:06,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:19:06,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:19:06,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317909490] [2022-04-07 19:19:06,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:19:06,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768141521] [2022-04-07 19:19:06,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768141521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:19:06,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:19:06,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:19:06,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123249407] [2022-04-07 19:19:06,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:19:06,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-04-07 19:19:06,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:19:06,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:19:06,930 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-07 19:19:06,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:19:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:19:06,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:19:06,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:19:06,931 INFO L87 Difference]: Start difference. First operand 1275 states and 1740 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:19:07,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:07,238 INFO L93 Difference]: Finished difference Result 1325 states and 1781 transitions. [2022-04-07 19:19:07,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 19:19:07,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-04-07 19:19:07,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:19:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:19:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-07 19:19:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:19:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-07 19:19:07,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2022-04-07 19:19:07,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:19:07,389 INFO L225 Difference]: With dead ends: 1325 [2022-04-07 19:19:07,389 INFO L226 Difference]: Without dead ends: 1325 [2022-04-07 19:19:07,389 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:19:07,390 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 12 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:19:07,391 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:19:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2022-04-07 19:19:07,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1232. [2022-04-07 19:19:07,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:19:07,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1325 states. Second operand has 1232 states, 885 states have (on average 1.2677966101694915) internal successors, (1122), 888 states have internal predecessors, (1122), 271 states have call successors, (271), 76 states have call predecessors, (271), 75 states have return successors, (267), 267 states have call predecessors, (267), 267 states have call successors, (267) [2022-04-07 19:19:07,422 INFO L74 IsIncluded]: Start isIncluded. First operand 1325 states. Second operand has 1232 states, 885 states have (on average 1.2677966101694915) internal successors, (1122), 888 states have internal predecessors, (1122), 271 states have call successors, (271), 76 states have call predecessors, (271), 75 states have return successors, (267), 267 states have call predecessors, (267), 267 states have call successors, (267) [2022-04-07 19:19:07,423 INFO L87 Difference]: Start difference. First operand 1325 states. Second operand has 1232 states, 885 states have (on average 1.2677966101694915) internal successors, (1122), 888 states have internal predecessors, (1122), 271 states have call successors, (271), 76 states have call predecessors, (271), 75 states have return successors, (267), 267 states have call predecessors, (267), 267 states have call successors, (267) [2022-04-07 19:19:07,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:07,503 INFO L93 Difference]: Finished difference Result 1325 states and 1781 transitions. [2022-04-07 19:19:07,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1781 transitions. [2022-04-07 19:19:07,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:19:07,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:19:07,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 1232 states, 885 states have (on average 1.2677966101694915) internal successors, (1122), 888 states have internal predecessors, (1122), 271 states have call successors, (271), 76 states have call predecessors, (271), 75 states have return successors, (267), 267 states have call predecessors, (267), 267 states have call successors, (267) Second operand 1325 states. [2022-04-07 19:19:07,509 INFO L87 Difference]: Start difference. First operand has 1232 states, 885 states have (on average 1.2677966101694915) internal successors, (1122), 888 states have internal predecessors, (1122), 271 states have call successors, (271), 76 states have call predecessors, (271), 75 states have return successors, (267), 267 states have call predecessors, (267), 267 states have call successors, (267) Second operand 1325 states. [2022-04-07 19:19:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:07,592 INFO L93 Difference]: Finished difference Result 1325 states and 1781 transitions. [2022-04-07 19:19:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1781 transitions. [2022-04-07 19:19:07,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:19:07,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:19:07,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:19:07,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:19:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 885 states have (on average 1.2677966101694915) internal successors, (1122), 888 states have internal predecessors, (1122), 271 states have call successors, (271), 76 states have call predecessors, (271), 75 states have return successors, (267), 267 states have call predecessors, (267), 267 states have call successors, (267) [2022-04-07 19:19:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1660 transitions. [2022-04-07 19:19:07,675 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1660 transitions. Word has length 73 [2022-04-07 19:19:07,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:19:07,675 INFO L478 AbstractCegarLoop]: Abstraction has 1232 states and 1660 transitions. [2022-04-07 19:19:07,675 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:19:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1660 transitions. [2022-04-07 19:19:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-07 19:19:07,676 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:19:07,676 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:19:07,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-07 19:19:07,895 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:19:07,895 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:19:07,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:19:07,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1662269742, now seen corresponding path program 2 times [2022-04-07 19:19:07,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:19:07,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646638888] [2022-04-07 19:19:07,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:19:07,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:19:07,908 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:19:07,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1295809297] [2022-04-07 19:19:07,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 19:19:07,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:19:07,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:19:07,909 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:19:07,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-07 19:19:07,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 19:19:07,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 19:19:07,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 82 conjunts are in the unsatisfiable core [2022-04-07 19:19:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:19:07,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:19:09,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {45814#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:19:09,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {45814#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {45814#true} is VALID [2022-04-07 19:19:09,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {45814#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:19:09,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45814#true} {45814#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:19:09,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {45814#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:19:09,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {45814#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {45814#true} is VALID [2022-04-07 19:19:09,739 INFO L272 TraceCheckUtils]: 6: Hoare triple {45814#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {45814#true} is VALID [2022-04-07 19:19:09,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {45814#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {45814#true} is VALID [2022-04-07 19:19:09,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {45814#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:19:09,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {45814#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:19:09,739 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45814#true} {45814#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {45814#true} is VALID [2022-04-07 19:19:09,739 INFO L272 TraceCheckUtils]: 11: Hoare triple {45814#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {45814#true} is VALID [2022-04-07 19:19:09,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {45814#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {45855#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:19:09,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {45855#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {45859#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:19:09,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {45859#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45859#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:19:09,740 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45859#(not (= |assume_abort_if_not_#in~cond| 0))} {45814#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {45866#(<= 1 main_~y~0)} is VALID [2022-04-07 19:19:09,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {45866#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {45870#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:19:09,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {45870#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {45870#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:19:09,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {45870#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {45870#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:19:09,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {45870#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {45880#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:19:09,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {45880#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {45880#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:19:09,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {45880#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {45880#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:19:09,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {45880#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {45890#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:19:09,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {45890#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {45894#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-07 19:19:09,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {45894#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {45894#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-07 19:19:09,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {45894#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {45894#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-07 19:19:09,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {45894#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {45904#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-07 19:19:09,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {45904#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {45904#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-07 19:19:09,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {45904#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {45904#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-07 19:19:09,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {45904#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {45914#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-07 19:19:09,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {45914#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {45914#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-07 19:19:09,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {45914#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {45914#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-07 19:19:09,748 INFO L272 TraceCheckUtils]: 32: Hoare triple {45914#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {45814#true} is VALID [2022-04-07 19:19:09,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {45814#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {45927#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:19:09,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {45927#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {45931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:19:09,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {45931#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:19:09,750 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {45931#(not (= |__VERIFIER_assert_#in~cond| 0))} {45914#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {45938#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:19:09,750 INFO L272 TraceCheckUtils]: 37: Hoare triple {45938#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {45814#true} is VALID [2022-04-07 19:19:09,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {45814#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {45814#true} is VALID [2022-04-07 19:19:09,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {45814#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:19:09,750 INFO L290 TraceCheckUtils]: 40: Hoare triple {45814#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:19:09,751 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {45814#true} {45938#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {45938#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:19:09,751 INFO L272 TraceCheckUtils]: 42: Hoare triple {45938#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {45814#true} is VALID [2022-04-07 19:19:09,751 INFO L290 TraceCheckUtils]: 43: Hoare triple {45814#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {45814#true} is VALID [2022-04-07 19:19:09,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {45814#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:19:09,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {45814#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:19:09,752 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {45814#true} {45938#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {45938#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:19:09,752 INFO L272 TraceCheckUtils]: 47: Hoare triple {45938#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {45814#true} is VALID [2022-04-07 19:19:09,752 INFO L290 TraceCheckUtils]: 48: Hoare triple {45814#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {45814#true} is VALID [2022-04-07 19:19:09,752 INFO L290 TraceCheckUtils]: 49: Hoare triple {45814#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:19:09,752 INFO L290 TraceCheckUtils]: 50: Hoare triple {45814#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:19:09,753 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {45814#true} {45938#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {45938#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:19:09,754 INFO L290 TraceCheckUtils]: 52: Hoare triple {45938#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {45987#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (< main_~c~0 (* main_~v~0 2)) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:19:09,755 INFO L290 TraceCheckUtils]: 53: Hoare triple {45987#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (< main_~c~0 (* main_~v~0 2)) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {45991#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:19:09,756 INFO L290 TraceCheckUtils]: 54: Hoare triple {45991#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {45991#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:19:09,756 INFO L290 TraceCheckUtils]: 55: Hoare triple {45991#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {45991#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:19:09,757 INFO L290 TraceCheckUtils]: 56: Hoare triple {45991#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {45991#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:19:09,758 INFO L290 TraceCheckUtils]: 57: Hoare triple {45991#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-07 19:19:09,759 INFO L290 TraceCheckUtils]: 58: Hoare triple {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-07 19:19:09,759 INFO L290 TraceCheckUtils]: 59: Hoare triple {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-07 19:19:09,760 INFO L290 TraceCheckUtils]: 60: Hoare triple {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-07 19:19:09,760 INFO L290 TraceCheckUtils]: 61: Hoare triple {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-07 19:19:09,761 INFO L290 TraceCheckUtils]: 62: Hoare triple {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-07 19:19:09,761 INFO L290 TraceCheckUtils]: 63: Hoare triple {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-07 19:19:09,762 INFO L290 TraceCheckUtils]: 64: Hoare triple {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-07 19:19:09,762 INFO L290 TraceCheckUtils]: 65: Hoare triple {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-07 19:19:09,762 INFO L272 TraceCheckUtils]: 66: Hoare triple {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {45814#true} is VALID [2022-04-07 19:19:09,762 INFO L290 TraceCheckUtils]: 67: Hoare triple {45814#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {45927#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:19:09,763 INFO L290 TraceCheckUtils]: 68: Hoare triple {45927#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {45931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:19:09,763 INFO L290 TraceCheckUtils]: 69: Hoare triple {45931#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:19:09,764 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {45931#(not (= |__VERIFIER_assert_#in~cond| 0))} {46004#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {46044#(and (< (* main_~b~0 2) main_~y~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ main_~q~0 1) 0))} is VALID [2022-04-07 19:19:09,765 INFO L272 TraceCheckUtils]: 71: Hoare triple {46044#(and (< (* main_~b~0 2) main_~y~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ main_~q~0 1) 0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {46048#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:19:09,765 INFO L290 TraceCheckUtils]: 72: Hoare triple {46048#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {46052#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:19:09,765 INFO L290 TraceCheckUtils]: 73: Hoare triple {46052#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {45815#false} is VALID [2022-04-07 19:19:09,766 INFO L290 TraceCheckUtils]: 74: Hoare triple {45815#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45815#false} is VALID [2022-04-07 19:19:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 43 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-07 19:19:09,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:20:06,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {45815#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45815#false} is VALID [2022-04-07 19:20:06,393 INFO L290 TraceCheckUtils]: 73: Hoare triple {46052#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {45815#false} is VALID [2022-04-07 19:20:06,394 INFO L290 TraceCheckUtils]: 72: Hoare triple {46048#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {46052#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:20:06,394 INFO L272 TraceCheckUtils]: 71: Hoare triple {46068#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {46048#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:20:06,395 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {45931#(not (= |__VERIFIER_assert_#in~cond| 0))} {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {46068#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:06,395 INFO L290 TraceCheckUtils]: 69: Hoare triple {45931#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:20:06,396 INFO L290 TraceCheckUtils]: 68: Hoare triple {46082#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {45931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:20:06,396 INFO L290 TraceCheckUtils]: 67: Hoare triple {45814#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {46082#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:20:06,396 INFO L272 TraceCheckUtils]: 66: Hoare triple {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {45814#true} is VALID [2022-04-07 19:20:06,396 INFO L290 TraceCheckUtils]: 65: Hoare triple {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-07 19:20:06,397 INFO L290 TraceCheckUtils]: 64: Hoare triple {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-07 19:20:06,397 INFO L290 TraceCheckUtils]: 63: Hoare triple {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-07 19:20:06,398 INFO L290 TraceCheckUtils]: 62: Hoare triple {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-07 19:20:06,398 INFO L290 TraceCheckUtils]: 61: Hoare triple {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-07 19:20:06,399 INFO L290 TraceCheckUtils]: 60: Hoare triple {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-07 19:20:06,399 INFO L290 TraceCheckUtils]: 59: Hoare triple {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-07 19:20:06,400 INFO L290 TraceCheckUtils]: 58: Hoare triple {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-07 19:20:06,413 INFO L290 TraceCheckUtils]: 57: Hoare triple {46113#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {46072#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-07 19:20:06,414 INFO L290 TraceCheckUtils]: 56: Hoare triple {46113#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {46113#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-07 19:20:06,414 INFO L290 TraceCheckUtils]: 55: Hoare triple {46113#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {46113#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-07 19:20:06,415 INFO L290 TraceCheckUtils]: 54: Hoare triple {46113#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {46113#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-07 19:20:06,419 INFO L290 TraceCheckUtils]: 53: Hoare triple {46126#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {46113#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-07 19:20:06,420 INFO L290 TraceCheckUtils]: 52: Hoare triple {46130#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {46126#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-07 19:20:06,423 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {45814#true} {46130#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {46130#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-07 19:20:06,423 INFO L290 TraceCheckUtils]: 50: Hoare triple {45814#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:20:06,423 INFO L290 TraceCheckUtils]: 49: Hoare triple {45814#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:20:06,423 INFO L290 TraceCheckUtils]: 48: Hoare triple {45814#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {45814#true} is VALID [2022-04-07 19:20:06,423 INFO L272 TraceCheckUtils]: 47: Hoare triple {46130#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {45814#true} is VALID [2022-04-07 19:20:06,424 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {45814#true} {46130#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {46130#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-07 19:20:06,424 INFO L290 TraceCheckUtils]: 45: Hoare triple {45814#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:20:06,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {45814#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:20:06,424 INFO L290 TraceCheckUtils]: 43: Hoare triple {45814#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {45814#true} is VALID [2022-04-07 19:20:06,424 INFO L272 TraceCheckUtils]: 42: Hoare triple {46130#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {45814#true} is VALID [2022-04-07 19:20:06,428 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {45814#true} {46130#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {46130#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-07 19:20:06,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {45814#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:20:06,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {45814#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:20:06,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {45814#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {45814#true} is VALID [2022-04-07 19:20:06,428 INFO L272 TraceCheckUtils]: 37: Hoare triple {46130#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {45814#true} is VALID [2022-04-07 19:20:06,429 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {45931#(not (= |__VERIFIER_assert_#in~cond| 0))} {46179#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {46130#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-07 19:20:06,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {45931#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:20:06,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {46082#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {45931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:20:06,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {45814#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {46082#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:20:06,431 INFO L272 TraceCheckUtils]: 32: Hoare triple {46179#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {45814#true} is VALID [2022-04-07 19:20:06,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {46179#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {46179#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-07 19:20:06,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {46179#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {46179#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-07 19:20:06,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {46201#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {46179#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-07 19:20:06,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {46201#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {46201#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-07 19:20:06,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {46201#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {46201#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-07 19:20:06,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {45814#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {46201#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-07 19:20:06,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {45814#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {45814#true} is VALID [2022-04-07 19:20:06,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {45814#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {45814#true} is VALID [2022-04-07 19:20:06,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {45814#true} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {45814#true} is VALID [2022-04-07 19:20:06,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {45814#true} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:20:06,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {45814#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {45814#true} is VALID [2022-04-07 19:20:06,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {45814#true} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {45814#true} is VALID [2022-04-07 19:20:06,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {45814#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {45814#true} is VALID [2022-04-07 19:20:06,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {45814#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {45814#true} is VALID [2022-04-07 19:20:06,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {45814#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {45814#true} is VALID [2022-04-07 19:20:06,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {45814#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {45814#true} is VALID [2022-04-07 19:20:06,437 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45814#true} {45814#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {45814#true} is VALID [2022-04-07 19:20:06,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {45814#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:20:06,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {45814#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:20:06,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {45814#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {45814#true} is VALID [2022-04-07 19:20:06,437 INFO L272 TraceCheckUtils]: 11: Hoare triple {45814#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {45814#true} is VALID [2022-04-07 19:20:06,437 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45814#true} {45814#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {45814#true} is VALID [2022-04-07 19:20:06,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {45814#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:20:06,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {45814#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:20:06,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {45814#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {45814#true} is VALID [2022-04-07 19:20:06,438 INFO L272 TraceCheckUtils]: 6: Hoare triple {45814#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {45814#true} is VALID [2022-04-07 19:20:06,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {45814#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {45814#true} is VALID [2022-04-07 19:20:06,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {45814#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:20:06,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45814#true} {45814#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:20:06,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {45814#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:20:06,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {45814#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {45814#true} is VALID [2022-04-07 19:20:06,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {45814#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45814#true} is VALID [2022-04-07 19:20:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-07 19:20:06,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:20:06,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646638888] [2022-04-07 19:20:06,439 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:20:06,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295809297] [2022-04-07 19:20:06,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295809297] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:20:06,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:20:06,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 28 [2022-04-07 19:20:06,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825974551] [2022-04-07 19:20:06,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:20:06,440 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 75 [2022-04-07 19:20:06,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:20:06,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-07 19:20:06,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:06,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-07 19:20:06,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:20:06,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-07 19:20:06,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2022-04-07 19:20:06,591 INFO L87 Difference]: Start difference. First operand 1232 states and 1660 transitions. Second operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-07 19:20:24,174 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:20:26,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:20:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:39,508 INFO L93 Difference]: Finished difference Result 1473 states and 1962 transitions. [2022-04-07 19:20:39,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-07 19:20:39,509 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 75 [2022-04-07 19:20:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:20:39,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-07 19:20:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 244 transitions. [2022-04-07 19:20:39,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-07 19:20:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 244 transitions. [2022-04-07 19:20:39,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 244 transitions. [2022-04-07 19:20:40,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:40,417 INFO L225 Difference]: With dead ends: 1473 [2022-04-07 19:20:40,417 INFO L226 Difference]: Without dead ends: 1469 [2022-04-07 19:20:40,418 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=469, Invalid=1981, Unknown=0, NotChecked=0, Total=2450 [2022-04-07 19:20:40,419 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 284 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 289 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:20:40,419 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 656 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1188 Invalid, 1 Unknown, 0 Unchecked, 13.1s Time] [2022-04-07 19:20:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2022-04-07 19:20:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1416. [2022-04-07 19:20:40,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:20:40,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1469 states. Second operand has 1416 states, 1028 states have (on average 1.2752918287937742) internal successors, (1311), 1037 states have internal predecessors, (1311), 298 states have call successors, (298), 91 states have call predecessors, (298), 89 states have return successors, (295), 287 states have call predecessors, (295), 295 states have call successors, (295) [2022-04-07 19:20:40,445 INFO L74 IsIncluded]: Start isIncluded. First operand 1469 states. Second operand has 1416 states, 1028 states have (on average 1.2752918287937742) internal successors, (1311), 1037 states have internal predecessors, (1311), 298 states have call successors, (298), 91 states have call predecessors, (298), 89 states have return successors, (295), 287 states have call predecessors, (295), 295 states have call successors, (295) [2022-04-07 19:20:40,447 INFO L87 Difference]: Start difference. First operand 1469 states. Second operand has 1416 states, 1028 states have (on average 1.2752918287937742) internal successors, (1311), 1037 states have internal predecessors, (1311), 298 states have call successors, (298), 91 states have call predecessors, (298), 89 states have return successors, (295), 287 states have call predecessors, (295), 295 states have call successors, (295) [2022-04-07 19:20:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:40,541 INFO L93 Difference]: Finished difference Result 1469 states and 1958 transitions. [2022-04-07 19:20:40,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1958 transitions. [2022-04-07 19:20:40,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:40,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:40,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 1416 states, 1028 states have (on average 1.2752918287937742) internal successors, (1311), 1037 states have internal predecessors, (1311), 298 states have call successors, (298), 91 states have call predecessors, (298), 89 states have return successors, (295), 287 states have call predecessors, (295), 295 states have call successors, (295) Second operand 1469 states. [2022-04-07 19:20:40,547 INFO L87 Difference]: Start difference. First operand has 1416 states, 1028 states have (on average 1.2752918287937742) internal successors, (1311), 1037 states have internal predecessors, (1311), 298 states have call successors, (298), 91 states have call predecessors, (298), 89 states have return successors, (295), 287 states have call predecessors, (295), 295 states have call successors, (295) Second operand 1469 states. [2022-04-07 19:20:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:40,636 INFO L93 Difference]: Finished difference Result 1469 states and 1958 transitions. [2022-04-07 19:20:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1958 transitions. [2022-04-07 19:20:40,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:40,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:40,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:20:40,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:20:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1028 states have (on average 1.2752918287937742) internal successors, (1311), 1037 states have internal predecessors, (1311), 298 states have call successors, (298), 91 states have call predecessors, (298), 89 states have return successors, (295), 287 states have call predecessors, (295), 295 states have call successors, (295) [2022-04-07 19:20:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1904 transitions. [2022-04-07 19:20:40,729 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1904 transitions. Word has length 75 [2022-04-07 19:20:40,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:20:40,729 INFO L478 AbstractCegarLoop]: Abstraction has 1416 states and 1904 transitions. [2022-04-07 19:20:40,730 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-07 19:20:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1904 transitions. [2022-04-07 19:20:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-07 19:20:40,731 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:20:40,732 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:20:40,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-07 19:20:40,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-07 19:20:40,947 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:20:40,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:20:40,948 INFO L85 PathProgramCache]: Analyzing trace with hash 612727057, now seen corresponding path program 1 times [2022-04-07 19:20:40,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:20:40,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082315016] [2022-04-07 19:20:40,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:40,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:20:40,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:20:40,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [592603880] [2022-04-07 19:20:40,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:40,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:40,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:20:40,964 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:20:40,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-07 19:20:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:41,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 86 conjunts are in the unsatisfiable core [2022-04-07 19:20:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:41,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:20:43,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {52170#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {52170#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {52170#true} is VALID [2022-04-07 19:20:43,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {52170#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52170#true} {52170#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {52170#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {52170#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {52170#true} is VALID [2022-04-07 19:20:43,350 INFO L272 TraceCheckUtils]: 6: Hoare triple {52170#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {52170#true} is VALID [2022-04-07 19:20:43,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {52170#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {52170#true} is VALID [2022-04-07 19:20:43,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {52170#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {52170#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,350 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {52170#true} {52170#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {52170#true} is VALID [2022-04-07 19:20:43,350 INFO L272 TraceCheckUtils]: 11: Hoare triple {52170#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {52170#true} is VALID [2022-04-07 19:20:43,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {52170#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {52170#true} is VALID [2022-04-07 19:20:43,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {52170#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {52170#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,350 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {52170#true} {52170#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {52170#true} is VALID [2022-04-07 19:20:43,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {52170#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {52223#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 19:20:43,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {52223#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {52223#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 19:20:43,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {52223#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {52223#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 19:20:43,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {52223#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {52233#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-07 19:20:43,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {52233#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {52233#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-07 19:20:43,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {52233#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {52233#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-07 19:20:43,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {52233#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {52243#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-07 19:20:43,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {52243#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {52247#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-07 19:20:43,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {52247#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {52247#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-07 19:20:43,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {52247#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {52247#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-07 19:20:43,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {52247#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {52257#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-07 19:20:43,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {52257#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {52257#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-07 19:20:43,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {52257#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {52257#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-07 19:20:43,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {52257#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-07 19:20:43,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-07 19:20:43,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-07 19:20:43,359 INFO L272 TraceCheckUtils]: 32: Hoare triple {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {52170#true} is VALID [2022-04-07 19:20:43,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {52170#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52170#true} is VALID [2022-04-07 19:20:43,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {52170#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {52170#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,360 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {52170#true} {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-07 19:20:43,360 INFO L272 TraceCheckUtils]: 37: Hoare triple {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {52170#true} is VALID [2022-04-07 19:20:43,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {52170#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52170#true} is VALID [2022-04-07 19:20:43,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {52170#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {52170#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,362 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {52170#true} {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-07 19:20:43,362 INFO L272 TraceCheckUtils]: 42: Hoare triple {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {52170#true} is VALID [2022-04-07 19:20:43,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {52170#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52170#true} is VALID [2022-04-07 19:20:43,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {52170#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {52170#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,363 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {52170#true} {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-07 19:20:43,363 INFO L272 TraceCheckUtils]: 47: Hoare triple {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {52170#true} is VALID [2022-04-07 19:20:43,363 INFO L290 TraceCheckUtils]: 48: Hoare triple {52170#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52170#true} is VALID [2022-04-07 19:20:43,363 INFO L290 TraceCheckUtils]: 49: Hoare triple {52170#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,363 INFO L290 TraceCheckUtils]: 50: Hoare triple {52170#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,364 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {52170#true} {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-07 19:20:43,365 INFO L290 TraceCheckUtils]: 52: Hoare triple {52267#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [150] L52-->L48-3: Formula: (let ((.cse0 (* v_main_~v~0_7 2))) (and (<= .cse0 v_main_~c~0_10) (= v_main_~v~0_6 .cse0) (= v_main_~d~0_5 (* v_main_~d~0_6 2)))) InVars {main_~c~0=v_main_~c~0_10, main_~v~0=v_main_~v~0_7, main_~d~0=v_main_~d~0_6} OutVars{main_~c~0=v_main_~c~0_10, main_~v~0=v_main_~v~0_6, main_~d~0=v_main_~d~0_5} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {52337#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} is VALID [2022-04-07 19:20:43,366 INFO L290 TraceCheckUtils]: 53: Hoare triple {52337#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {52337#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} is VALID [2022-04-07 19:20:43,366 INFO L290 TraceCheckUtils]: 54: Hoare triple {52337#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {52337#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} is VALID [2022-04-07 19:20:43,367 INFO L272 TraceCheckUtils]: 55: Hoare triple {52337#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {52170#true} is VALID [2022-04-07 19:20:43,367 INFO L290 TraceCheckUtils]: 56: Hoare triple {52170#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52350#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:20:43,367 INFO L290 TraceCheckUtils]: 57: Hoare triple {52350#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:20:43,368 INFO L290 TraceCheckUtils]: 58: Hoare triple {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:20:43,370 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} {52337#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {52361#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:20:43,370 INFO L272 TraceCheckUtils]: 60: Hoare triple {52361#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {52170#true} is VALID [2022-04-07 19:20:43,371 INFO L290 TraceCheckUtils]: 61: Hoare triple {52170#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52350#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:20:43,371 INFO L290 TraceCheckUtils]: 62: Hoare triple {52350#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:20:43,371 INFO L290 TraceCheckUtils]: 63: Hoare triple {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:20:43,373 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} {52361#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {52377#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:20:43,373 INFO L272 TraceCheckUtils]: 65: Hoare triple {52377#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {52170#true} is VALID [2022-04-07 19:20:43,373 INFO L290 TraceCheckUtils]: 66: Hoare triple {52170#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52170#true} is VALID [2022-04-07 19:20:43,373 INFO L290 TraceCheckUtils]: 67: Hoare triple {52170#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,373 INFO L290 TraceCheckUtils]: 68: Hoare triple {52170#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:20:43,374 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {52170#true} {52377#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {52377#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:20:43,374 INFO L272 TraceCheckUtils]: 70: Hoare triple {52377#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {52170#true} is VALID [2022-04-07 19:20:43,375 INFO L290 TraceCheckUtils]: 71: Hoare triple {52170#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52350#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:20:43,375 INFO L290 TraceCheckUtils]: 72: Hoare triple {52350#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:20:43,375 INFO L290 TraceCheckUtils]: 73: Hoare triple {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:20:43,376 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} {52377#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {52377#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:20:43,377 INFO L290 TraceCheckUtils]: 75: Hoare triple {52377#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {52377#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:20:43,378 INFO L290 TraceCheckUtils]: 76: Hoare triple {52377#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {52414#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:20:43,379 INFO L290 TraceCheckUtils]: 77: Hoare triple {52414#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {52414#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:20:43,380 INFO L290 TraceCheckUtils]: 78: Hoare triple {52414#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {52414#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:20:43,381 INFO L290 TraceCheckUtils]: 79: Hoare triple {52414#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {52424#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (< main_~c~0 main_~b~0) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-07 19:20:43,383 INFO L290 TraceCheckUtils]: 80: Hoare triple {52424#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (< main_~c~0 main_~b~0) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {52428#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-07 19:20:43,383 INFO L290 TraceCheckUtils]: 81: Hoare triple {52428#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {52428#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-07 19:20:43,384 INFO L290 TraceCheckUtils]: 82: Hoare triple {52428#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {52428#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-07 19:20:43,385 INFO L290 TraceCheckUtils]: 83: Hoare triple {52428#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {52438#(and (= main_~r~0 0) (= main_~y~0 (* 2 (* main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-07 19:20:43,387 INFO L272 TraceCheckUtils]: 84: Hoare triple {52438#(and (= main_~r~0 0) (= main_~y~0 (* 2 (* main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {52442#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:20:43,387 INFO L290 TraceCheckUtils]: 85: Hoare triple {52442#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52446#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:20:43,387 INFO L290 TraceCheckUtils]: 86: Hoare triple {52446#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {52171#false} is VALID [2022-04-07 19:20:43,388 INFO L290 TraceCheckUtils]: 87: Hoare triple {52171#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52171#false} is VALID [2022-04-07 19:20:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 52 proven. 35 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-04-07 19:20:43,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:22:06,049 INFO L290 TraceCheckUtils]: 87: Hoare triple {52171#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52171#false} is VALID [2022-04-07 19:22:06,049 INFO L290 TraceCheckUtils]: 86: Hoare triple {52446#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {52171#false} is VALID [2022-04-07 19:22:06,049 INFO L290 TraceCheckUtils]: 85: Hoare triple {52442#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52446#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:22:06,050 INFO L272 TraceCheckUtils]: 84: Hoare triple {52462#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {52442#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:22:06,051 INFO L290 TraceCheckUtils]: 83: Hoare triple {52466#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {52462#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:22:06,051 INFO L290 TraceCheckUtils]: 82: Hoare triple {52466#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {52466#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-07 19:22:06,052 INFO L290 TraceCheckUtils]: 81: Hoare triple {52466#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {52466#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-07 19:22:06,368 INFO L290 TraceCheckUtils]: 80: Hoare triple {52476#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {52466#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-07 19:22:06,369 INFO L290 TraceCheckUtils]: 79: Hoare triple {52480#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {52476#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:22:06,369 INFO L290 TraceCheckUtils]: 78: Hoare triple {52480#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {52480#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:22:06,370 INFO L290 TraceCheckUtils]: 77: Hoare triple {52480#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {52480#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:22:06,502 INFO L290 TraceCheckUtils]: 76: Hoare triple {52490#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {52480#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:22:06,503 INFO L290 TraceCheckUtils]: 75: Hoare triple {52490#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {52490#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:22:06,504 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} {52497#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {52490#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:22:06,504 INFO L290 TraceCheckUtils]: 73: Hoare triple {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:22:06,504 INFO L290 TraceCheckUtils]: 72: Hoare triple {52507#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:22:06,505 INFO L290 TraceCheckUtils]: 71: Hoare triple {52170#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52507#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:22:06,505 INFO L272 TraceCheckUtils]: 70: Hoare triple {52497#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {52170#true} is VALID [2022-04-07 19:22:06,506 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {52170#true} {52497#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {52497#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:22:06,506 INFO L290 TraceCheckUtils]: 68: Hoare triple {52170#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,506 INFO L290 TraceCheckUtils]: 67: Hoare triple {52170#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,506 INFO L290 TraceCheckUtils]: 66: Hoare triple {52170#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52170#true} is VALID [2022-04-07 19:22:06,506 INFO L272 TraceCheckUtils]: 65: Hoare triple {52497#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {52170#true} is VALID [2022-04-07 19:22:06,507 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} {52529#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {52497#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:22:06,507 INFO L290 TraceCheckUtils]: 63: Hoare triple {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:22:06,507 INFO L290 TraceCheckUtils]: 62: Hoare triple {52507#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:22:06,508 INFO L290 TraceCheckUtils]: 61: Hoare triple {52170#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52507#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:22:06,508 INFO L272 TraceCheckUtils]: 60: Hoare triple {52529#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {52170#true} is VALID [2022-04-07 19:22:06,509 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} {52545#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {52529#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:22:06,509 INFO L290 TraceCheckUtils]: 58: Hoare triple {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:22:06,510 INFO L290 TraceCheckUtils]: 57: Hoare triple {52507#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {52354#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:22:06,510 INFO L290 TraceCheckUtils]: 56: Hoare triple {52170#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52507#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:22:06,510 INFO L272 TraceCheckUtils]: 55: Hoare triple {52545#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {52170#true} is VALID [2022-04-07 19:22:06,511 INFO L290 TraceCheckUtils]: 54: Hoare triple {52545#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {52545#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:22:06,511 INFO L290 TraceCheckUtils]: 53: Hoare triple {52545#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {52545#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:22:06,574 INFO L290 TraceCheckUtils]: 52: Hoare triple {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [150] L52-->L48-3: Formula: (let ((.cse0 (* v_main_~v~0_7 2))) (and (<= .cse0 v_main_~c~0_10) (= v_main_~v~0_6 .cse0) (= v_main_~d~0_5 (* v_main_~d~0_6 2)))) InVars {main_~c~0=v_main_~c~0_10, main_~v~0=v_main_~v~0_7, main_~d~0=v_main_~d~0_6} OutVars{main_~c~0=v_main_~c~0_10, main_~v~0=v_main_~v~0_6, main_~d~0=v_main_~d~0_5} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {52545#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:22:06,575 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {52170#true} {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-07 19:22:06,575 INFO L290 TraceCheckUtils]: 50: Hoare triple {52170#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,575 INFO L290 TraceCheckUtils]: 49: Hoare triple {52170#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,575 INFO L290 TraceCheckUtils]: 48: Hoare triple {52170#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52170#true} is VALID [2022-04-07 19:22:06,575 INFO L272 TraceCheckUtils]: 47: Hoare triple {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {52170#true} is VALID [2022-04-07 19:22:06,576 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {52170#true} {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-07 19:22:06,576 INFO L290 TraceCheckUtils]: 45: Hoare triple {52170#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,576 INFO L290 TraceCheckUtils]: 44: Hoare triple {52170#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,576 INFO L290 TraceCheckUtils]: 43: Hoare triple {52170#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52170#true} is VALID [2022-04-07 19:22:06,576 INFO L272 TraceCheckUtils]: 42: Hoare triple {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {52170#true} is VALID [2022-04-07 19:22:06,577 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {52170#true} {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-07 19:22:06,577 INFO L290 TraceCheckUtils]: 40: Hoare triple {52170#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,577 INFO L290 TraceCheckUtils]: 39: Hoare triple {52170#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {52170#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52170#true} is VALID [2022-04-07 19:22:06,577 INFO L272 TraceCheckUtils]: 37: Hoare triple {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {52170#true} is VALID [2022-04-07 19:22:06,578 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {52170#true} {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-07 19:22:06,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {52170#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {52170#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {52170#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52170#true} is VALID [2022-04-07 19:22:06,578 INFO L272 TraceCheckUtils]: 32: Hoare triple {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {52170#true} is VALID [2022-04-07 19:22:06,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-07 19:22:06,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-07 19:22:06,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {52637#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {52567#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-07 19:22:06,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {52637#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {52637#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-07 19:22:06,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {52637#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {52637#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-07 19:22:06,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {52170#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {52637#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-07 19:22:06,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {52170#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {52170#true} is VALID [2022-04-07 19:22:06,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {52170#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {52170#true} is VALID [2022-04-07 19:22:06,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {52170#true} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {52170#true} is VALID [2022-04-07 19:22:06,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {52170#true} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {52170#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {52170#true} is VALID [2022-04-07 19:22:06,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {52170#true} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {52170#true} is VALID [2022-04-07 19:22:06,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {52170#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {52170#true} is VALID [2022-04-07 19:22:06,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {52170#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {52170#true} is VALID [2022-04-07 19:22:06,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {52170#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {52170#true} is VALID [2022-04-07 19:22:06,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {52170#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {52170#true} is VALID [2022-04-07 19:22:06,584 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {52170#true} {52170#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {52170#true} is VALID [2022-04-07 19:22:06,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {52170#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {52170#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {52170#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {52170#true} is VALID [2022-04-07 19:22:06,584 INFO L272 TraceCheckUtils]: 11: Hoare triple {52170#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {52170#true} is VALID [2022-04-07 19:22:06,584 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {52170#true} {52170#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {52170#true} is VALID [2022-04-07 19:22:06,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {52170#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {52170#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {52170#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {52170#true} is VALID [2022-04-07 19:22:06,584 INFO L272 TraceCheckUtils]: 6: Hoare triple {52170#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {52170#true} is VALID [2022-04-07 19:22:06,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {52170#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {52170#true} is VALID [2022-04-07 19:22:06,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {52170#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52170#true} {52170#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {52170#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {52170#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {52170#true} is VALID [2022-04-07 19:22:06,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {52170#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52170#true} is VALID [2022-04-07 19:22:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 65 proven. 19 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-04-07 19:22:06,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:22:06,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082315016] [2022-04-07 19:22:06,585 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:22:06,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592603880] [2022-04-07 19:22:06,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592603880] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:22:06,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:22:06,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2022-04-07 19:22:06,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868625844] [2022-04-07 19:22:06,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:22:06,586 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) Word has length 88 [2022-04-07 19:22:06,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:22:06,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-07 19:22:08,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 111 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 19:22:08,834 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-07 19:22:08,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:22:08,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-07 19:22:08,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-04-07 19:22:08,835 INFO L87 Difference]: Start difference. First operand 1416 states and 1904 transitions. Second operand has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-07 19:22:26,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:22:33,237 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:22:47,596 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:22:52,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:23:01,313 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:23:07,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:23:11,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:23:20,762 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:23:22,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:23:26,854 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:23:43,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:23:52,760 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:23:57,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:24:02,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:24:02,911 INFO L93 Difference]: Finished difference Result 2064 states and 2888 transitions. [2022-04-07 19:24:02,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-07 19:24:02,912 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) Word has length 88 [2022-04-07 19:24:02,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:24:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-07 19:24:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 481 transitions. [2022-04-07 19:24:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-07 19:24:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 481 transitions. [2022-04-07 19:24:02,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 481 transitions. [2022-04-07 19:24:26,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 481 edges. 474 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-07 19:24:26,284 INFO L225 Difference]: With dead ends: 2064 [2022-04-07 19:24:26,284 INFO L226 Difference]: Without dead ends: 2055 [2022-04-07 19:24:26,287 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4379 ImplicationChecksByTransitivity, 45.5s TimeCoverageRelationStatistics Valid=2197, Invalid=10459, Unknown=0, NotChecked=0, Total=12656 [2022-04-07 19:24:26,287 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 393 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 2195 mSolverCounterSat, 479 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 2684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 2195 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:24:26,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 1006 Invalid, 2684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 2195 Invalid, 10 Unknown, 0 Unchecked, 45.1s Time] [2022-04-07 19:24:26,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2022-04-07 19:24:26,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1839. [2022-04-07 19:24:26,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:24:26,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2055 states. Second operand has 1839 states, 1271 states have (on average 1.3202202989771834) internal successors, (1678), 1280 states have internal predecessors, (1678), 470 states have call successors, (470), 99 states have call predecessors, (470), 97 states have return successors, (467), 459 states have call predecessors, (467), 467 states have call successors, (467) [2022-04-07 19:24:26,325 INFO L74 IsIncluded]: Start isIncluded. First operand 2055 states. Second operand has 1839 states, 1271 states have (on average 1.3202202989771834) internal successors, (1678), 1280 states have internal predecessors, (1678), 470 states have call successors, (470), 99 states have call predecessors, (470), 97 states have return successors, (467), 459 states have call predecessors, (467), 467 states have call successors, (467) [2022-04-07 19:24:26,327 INFO L87 Difference]: Start difference. First operand 2055 states. Second operand has 1839 states, 1271 states have (on average 1.3202202989771834) internal successors, (1678), 1280 states have internal predecessors, (1678), 470 states have call successors, (470), 99 states have call predecessors, (470), 97 states have return successors, (467), 459 states have call predecessors, (467), 467 states have call successors, (467) [2022-04-07 19:24:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:24:26,537 INFO L93 Difference]: Finished difference Result 2055 states and 2871 transitions. [2022-04-07 19:24:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2871 transitions. [2022-04-07 19:24:26,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:24:26,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:24:26,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 1839 states, 1271 states have (on average 1.3202202989771834) internal successors, (1678), 1280 states have internal predecessors, (1678), 470 states have call successors, (470), 99 states have call predecessors, (470), 97 states have return successors, (467), 459 states have call predecessors, (467), 467 states have call successors, (467) Second operand 2055 states. [2022-04-07 19:24:26,546 INFO L87 Difference]: Start difference. First operand has 1839 states, 1271 states have (on average 1.3202202989771834) internal successors, (1678), 1280 states have internal predecessors, (1678), 470 states have call successors, (470), 99 states have call predecessors, (470), 97 states have return successors, (467), 459 states have call predecessors, (467), 467 states have call successors, (467) Second operand 2055 states. [2022-04-07 19:24:26,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:24:26,748 INFO L93 Difference]: Finished difference Result 2055 states and 2871 transitions. [2022-04-07 19:24:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2871 transitions. [2022-04-07 19:24:26,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:24:26,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:24:26,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:24:26,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:24:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1271 states have (on average 1.3202202989771834) internal successors, (1678), 1280 states have internal predecessors, (1678), 470 states have call successors, (470), 99 states have call predecessors, (470), 97 states have return successors, (467), 459 states have call predecessors, (467), 467 states have call successors, (467) [2022-04-07 19:24:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2615 transitions. [2022-04-07 19:24:26,934 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2615 transitions. Word has length 88 [2022-04-07 19:24:26,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:24:26,934 INFO L478 AbstractCegarLoop]: Abstraction has 1839 states and 2615 transitions. [2022-04-07 19:24:26,934 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-07 19:24:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2615 transitions. [2022-04-07 19:24:26,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-07 19:24:26,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:24:26,936 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:24:26,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-07 19:24:27,157 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-07 19:24:27,157 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:24:27,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:24:27,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2096647522, now seen corresponding path program 1 times [2022-04-07 19:24:27,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:24:27,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360562282] [2022-04-07 19:24:27,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:24:27,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:24:27,173 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:24:27,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [513436836] [2022-04-07 19:24:27,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:24:27,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:24:27,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:24:27,175 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:24:27,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-07 19:24:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:24:27,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 19:24:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:24:27,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:24:27,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {60928#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:27,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {60928#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:27,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {60936#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:27,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60936#(<= ~counter~0 0)} {60928#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:27,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {60936#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:27,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {60936#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:27,808 INFO L272 TraceCheckUtils]: 6: Hoare triple {60936#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:27,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {60936#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:27,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {60936#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:27,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {60936#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:27,809 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60936#(<= ~counter~0 0)} {60936#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:27,809 INFO L272 TraceCheckUtils]: 11: Hoare triple {60936#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:27,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {60936#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:27,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {60936#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:27,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {60936#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:27,810 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60936#(<= ~counter~0 0)} {60936#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:27,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {60936#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:27,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {60936#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {60985#(<= ~counter~0 1)} is VALID [2022-04-07 19:24:27,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {60985#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {60985#(<= ~counter~0 1)} is VALID [2022-04-07 19:24:27,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {60985#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {60985#(<= ~counter~0 1)} is VALID [2022-04-07 19:24:27,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {60985#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {60995#(<= ~counter~0 2)} is VALID [2022-04-07 19:24:27,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {60995#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {60995#(<= ~counter~0 2)} is VALID [2022-04-07 19:24:27,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {60995#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {60995#(<= ~counter~0 2)} is VALID [2022-04-07 19:24:27,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {60995#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {60995#(<= ~counter~0 2)} is VALID [2022-04-07 19:24:27,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {60995#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {61008#(<= ~counter~0 3)} is VALID [2022-04-07 19:24:27,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {61008#(<= ~counter~0 3)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {61008#(<= ~counter~0 3)} is VALID [2022-04-07 19:24:27,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {61008#(<= ~counter~0 3)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {61008#(<= ~counter~0 3)} is VALID [2022-04-07 19:24:27,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {61008#(<= ~counter~0 3)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {61018#(<= ~counter~0 4)} is VALID [2022-04-07 19:24:27,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {61018#(<= ~counter~0 4)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {61018#(<= ~counter~0 4)} is VALID [2022-04-07 19:24:27,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {61018#(<= ~counter~0 4)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {61018#(<= ~counter~0 4)} is VALID [2022-04-07 19:24:27,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {61018#(<= ~counter~0 4)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {61028#(<= ~counter~0 5)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,821 INFO L272 TraceCheckUtils]: 32: Hoare triple {61028#(<= ~counter~0 5)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {61028#(<= ~counter~0 5)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,821 INFO L290 TraceCheckUtils]: 34: Hoare triple {61028#(<= ~counter~0 5)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,821 INFO L290 TraceCheckUtils]: 35: Hoare triple {61028#(<= ~counter~0 5)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,822 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {61028#(<= ~counter~0 5)} {61028#(<= ~counter~0 5)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,823 INFO L272 TraceCheckUtils]: 37: Hoare triple {61028#(<= ~counter~0 5)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {61028#(<= ~counter~0 5)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {61028#(<= ~counter~0 5)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,823 INFO L290 TraceCheckUtils]: 40: Hoare triple {61028#(<= ~counter~0 5)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,824 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {61028#(<= ~counter~0 5)} {61028#(<= ~counter~0 5)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,824 INFO L272 TraceCheckUtils]: 42: Hoare triple {61028#(<= ~counter~0 5)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {61028#(<= ~counter~0 5)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {61028#(<= ~counter~0 5)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,825 INFO L290 TraceCheckUtils]: 45: Hoare triple {61028#(<= ~counter~0 5)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,826 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {61028#(<= ~counter~0 5)} {61028#(<= ~counter~0 5)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,826 INFO L272 TraceCheckUtils]: 47: Hoare triple {61028#(<= ~counter~0 5)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,826 INFO L290 TraceCheckUtils]: 48: Hoare triple {61028#(<= ~counter~0 5)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,827 INFO L290 TraceCheckUtils]: 49: Hoare triple {61028#(<= ~counter~0 5)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,827 INFO L290 TraceCheckUtils]: 50: Hoare triple {61028#(<= ~counter~0 5)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,827 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {61028#(<= ~counter~0 5)} {61028#(<= ~counter~0 5)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,828 INFO L290 TraceCheckUtils]: 52: Hoare triple {61028#(<= ~counter~0 5)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,828 INFO L290 TraceCheckUtils]: 53: Hoare triple {61028#(<= ~counter~0 5)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:27,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {61028#(<= ~counter~0 5)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {61101#(<= ~counter~0 6)} is VALID [2022-04-07 19:24:27,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {61101#(<= ~counter~0 6)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {61101#(<= ~counter~0 6)} is VALID [2022-04-07 19:24:27,829 INFO L290 TraceCheckUtils]: 56: Hoare triple {61101#(<= ~counter~0 6)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {61101#(<= ~counter~0 6)} is VALID [2022-04-07 19:24:27,830 INFO L290 TraceCheckUtils]: 57: Hoare triple {61101#(<= ~counter~0 6)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {61101#(<= ~counter~0 6)} is VALID [2022-04-07 19:24:27,830 INFO L290 TraceCheckUtils]: 58: Hoare triple {61101#(<= ~counter~0 6)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {61114#(<= ~counter~0 7)} is VALID [2022-04-07 19:24:27,830 INFO L290 TraceCheckUtils]: 59: Hoare triple {61114#(<= ~counter~0 7)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {61114#(<= ~counter~0 7)} is VALID [2022-04-07 19:24:27,831 INFO L290 TraceCheckUtils]: 60: Hoare triple {61114#(<= ~counter~0 7)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {61114#(<= ~counter~0 7)} is VALID [2022-04-07 19:24:27,831 INFO L290 TraceCheckUtils]: 61: Hoare triple {61114#(<= ~counter~0 7)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {61124#(<= ~counter~0 8)} is VALID [2022-04-07 19:24:27,832 INFO L290 TraceCheckUtils]: 62: Hoare triple {61124#(<= ~counter~0 8)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {61124#(<= ~counter~0 8)} is VALID [2022-04-07 19:24:27,832 INFO L290 TraceCheckUtils]: 63: Hoare triple {61124#(<= ~counter~0 8)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {61124#(<= ~counter~0 8)} is VALID [2022-04-07 19:24:27,833 INFO L290 TraceCheckUtils]: 64: Hoare triple {61124#(<= ~counter~0 8)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,833 INFO L290 TraceCheckUtils]: 65: Hoare triple {61134#(<= ~counter~0 9)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,834 INFO L272 TraceCheckUtils]: 66: Hoare triple {61134#(<= ~counter~0 9)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,834 INFO L290 TraceCheckUtils]: 67: Hoare triple {61134#(<= ~counter~0 9)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,834 INFO L290 TraceCheckUtils]: 68: Hoare triple {61134#(<= ~counter~0 9)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,834 INFO L290 TraceCheckUtils]: 69: Hoare triple {61134#(<= ~counter~0 9)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,835 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {61134#(<= ~counter~0 9)} {61134#(<= ~counter~0 9)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,835 INFO L272 TraceCheckUtils]: 71: Hoare triple {61134#(<= ~counter~0 9)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,836 INFO L290 TraceCheckUtils]: 72: Hoare triple {61134#(<= ~counter~0 9)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,836 INFO L290 TraceCheckUtils]: 73: Hoare triple {61134#(<= ~counter~0 9)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,836 INFO L290 TraceCheckUtils]: 74: Hoare triple {61134#(<= ~counter~0 9)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,837 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {61134#(<= ~counter~0 9)} {61134#(<= ~counter~0 9)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,837 INFO L272 TraceCheckUtils]: 76: Hoare triple {61134#(<= ~counter~0 9)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,837 INFO L290 TraceCheckUtils]: 77: Hoare triple {61134#(<= ~counter~0 9)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,838 INFO L290 TraceCheckUtils]: 78: Hoare triple {61134#(<= ~counter~0 9)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,838 INFO L290 TraceCheckUtils]: 79: Hoare triple {61134#(<= ~counter~0 9)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,838 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {61134#(<= ~counter~0 9)} {61134#(<= ~counter~0 9)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,839 INFO L272 TraceCheckUtils]: 81: Hoare triple {61134#(<= ~counter~0 9)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,843 INFO L290 TraceCheckUtils]: 82: Hoare triple {61134#(<= ~counter~0 9)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,843 INFO L290 TraceCheckUtils]: 83: Hoare triple {61134#(<= ~counter~0 9)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,844 INFO L290 TraceCheckUtils]: 84: Hoare triple {61134#(<= ~counter~0 9)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,844 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {61134#(<= ~counter~0 9)} {61134#(<= ~counter~0 9)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,845 INFO L290 TraceCheckUtils]: 86: Hoare triple {61134#(<= ~counter~0 9)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,845 INFO L290 TraceCheckUtils]: 87: Hoare triple {61134#(<= ~counter~0 9)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:27,846 INFO L290 TraceCheckUtils]: 88: Hoare triple {61134#(<= ~counter~0 9)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {61207#(<= |main_#t~post7| 9)} is VALID [2022-04-07 19:24:27,846 INFO L290 TraceCheckUtils]: 89: Hoare triple {61207#(<= |main_#t~post7| 9)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {60929#false} is VALID [2022-04-07 19:24:27,846 INFO L290 TraceCheckUtils]: 90: Hoare triple {60929#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {60929#false} is VALID [2022-04-07 19:24:27,846 INFO L290 TraceCheckUtils]: 91: Hoare triple {60929#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {60929#false} is VALID [2022-04-07 19:24:27,846 INFO L290 TraceCheckUtils]: 92: Hoare triple {60929#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {60929#false} is VALID [2022-04-07 19:24:27,846 INFO L272 TraceCheckUtils]: 93: Hoare triple {60929#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {60929#false} is VALID [2022-04-07 19:24:27,847 INFO L290 TraceCheckUtils]: 94: Hoare triple {60929#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {60929#false} is VALID [2022-04-07 19:24:27,847 INFO L290 TraceCheckUtils]: 95: Hoare triple {60929#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {60929#false} is VALID [2022-04-07 19:24:27,847 INFO L290 TraceCheckUtils]: 96: Hoare triple {60929#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60929#false} is VALID [2022-04-07 19:24:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 24 proven. 108 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-07 19:24:27,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:24:28,245 INFO L290 TraceCheckUtils]: 96: Hoare triple {60929#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60929#false} is VALID [2022-04-07 19:24:28,245 INFO L290 TraceCheckUtils]: 95: Hoare triple {60929#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {60929#false} is VALID [2022-04-07 19:24:28,245 INFO L290 TraceCheckUtils]: 94: Hoare triple {60929#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {60929#false} is VALID [2022-04-07 19:24:28,245 INFO L272 TraceCheckUtils]: 93: Hoare triple {60929#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {60929#false} is VALID [2022-04-07 19:24:28,245 INFO L290 TraceCheckUtils]: 92: Hoare triple {60929#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {60929#false} is VALID [2022-04-07 19:24:28,245 INFO L290 TraceCheckUtils]: 91: Hoare triple {60929#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {60929#false} is VALID [2022-04-07 19:24:28,245 INFO L290 TraceCheckUtils]: 90: Hoare triple {60929#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {60929#false} is VALID [2022-04-07 19:24:28,246 INFO L290 TraceCheckUtils]: 89: Hoare triple {61207#(<= |main_#t~post7| 9)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {60929#false} is VALID [2022-04-07 19:24:28,246 INFO L290 TraceCheckUtils]: 88: Hoare triple {61134#(<= ~counter~0 9)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {61207#(<= |main_#t~post7| 9)} is VALID [2022-04-07 19:24:28,246 INFO L290 TraceCheckUtils]: 87: Hoare triple {61134#(<= ~counter~0 9)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:28,247 INFO L290 TraceCheckUtils]: 86: Hoare triple {61134#(<= ~counter~0 9)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:28,247 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {60928#true} {61134#(<= ~counter~0 9)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:28,247 INFO L290 TraceCheckUtils]: 84: Hoare triple {60928#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,247 INFO L290 TraceCheckUtils]: 83: Hoare triple {60928#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,247 INFO L290 TraceCheckUtils]: 82: Hoare triple {60928#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {60928#true} is VALID [2022-04-07 19:24:28,247 INFO L272 TraceCheckUtils]: 81: Hoare triple {61134#(<= ~counter~0 9)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {60928#true} is VALID [2022-04-07 19:24:28,248 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {60928#true} {61134#(<= ~counter~0 9)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:28,248 INFO L290 TraceCheckUtils]: 79: Hoare triple {60928#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,248 INFO L290 TraceCheckUtils]: 78: Hoare triple {60928#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,248 INFO L290 TraceCheckUtils]: 77: Hoare triple {60928#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {60928#true} is VALID [2022-04-07 19:24:28,248 INFO L272 TraceCheckUtils]: 76: Hoare triple {61134#(<= ~counter~0 9)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {60928#true} is VALID [2022-04-07 19:24:28,264 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {60928#true} {61134#(<= ~counter~0 9)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:28,264 INFO L290 TraceCheckUtils]: 74: Hoare triple {60928#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,264 INFO L290 TraceCheckUtils]: 73: Hoare triple {60928#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,264 INFO L290 TraceCheckUtils]: 72: Hoare triple {60928#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {60928#true} is VALID [2022-04-07 19:24:28,264 INFO L272 TraceCheckUtils]: 71: Hoare triple {61134#(<= ~counter~0 9)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {60928#true} is VALID [2022-04-07 19:24:28,265 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {60928#true} {61134#(<= ~counter~0 9)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:28,266 INFO L290 TraceCheckUtils]: 69: Hoare triple {60928#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,266 INFO L290 TraceCheckUtils]: 68: Hoare triple {60928#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,266 INFO L290 TraceCheckUtils]: 67: Hoare triple {60928#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {60928#true} is VALID [2022-04-07 19:24:28,266 INFO L272 TraceCheckUtils]: 66: Hoare triple {61134#(<= ~counter~0 9)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {60928#true} is VALID [2022-04-07 19:24:28,266 INFO L290 TraceCheckUtils]: 65: Hoare triple {61134#(<= ~counter~0 9)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:28,268 INFO L290 TraceCheckUtils]: 64: Hoare triple {61124#(<= ~counter~0 8)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {61134#(<= ~counter~0 9)} is VALID [2022-04-07 19:24:28,269 INFO L290 TraceCheckUtils]: 63: Hoare triple {61124#(<= ~counter~0 8)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {61124#(<= ~counter~0 8)} is VALID [2022-04-07 19:24:28,269 INFO L290 TraceCheckUtils]: 62: Hoare triple {61124#(<= ~counter~0 8)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {61124#(<= ~counter~0 8)} is VALID [2022-04-07 19:24:28,270 INFO L290 TraceCheckUtils]: 61: Hoare triple {61114#(<= ~counter~0 7)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {61124#(<= ~counter~0 8)} is VALID [2022-04-07 19:24:28,271 INFO L290 TraceCheckUtils]: 60: Hoare triple {61114#(<= ~counter~0 7)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {61114#(<= ~counter~0 7)} is VALID [2022-04-07 19:24:28,271 INFO L290 TraceCheckUtils]: 59: Hoare triple {61114#(<= ~counter~0 7)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {61114#(<= ~counter~0 7)} is VALID [2022-04-07 19:24:28,272 INFO L290 TraceCheckUtils]: 58: Hoare triple {61101#(<= ~counter~0 6)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {61114#(<= ~counter~0 7)} is VALID [2022-04-07 19:24:28,273 INFO L290 TraceCheckUtils]: 57: Hoare triple {61101#(<= ~counter~0 6)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {61101#(<= ~counter~0 6)} is VALID [2022-04-07 19:24:28,273 INFO L290 TraceCheckUtils]: 56: Hoare triple {61101#(<= ~counter~0 6)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {61101#(<= ~counter~0 6)} is VALID [2022-04-07 19:24:28,274 INFO L290 TraceCheckUtils]: 55: Hoare triple {61101#(<= ~counter~0 6)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {61101#(<= ~counter~0 6)} is VALID [2022-04-07 19:24:28,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {61028#(<= ~counter~0 5)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {61101#(<= ~counter~0 6)} is VALID [2022-04-07 19:24:28,275 INFO L290 TraceCheckUtils]: 53: Hoare triple {61028#(<= ~counter~0 5)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:28,276 INFO L290 TraceCheckUtils]: 52: Hoare triple {61028#(<= ~counter~0 5)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:28,277 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {60928#true} {61028#(<= ~counter~0 5)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:28,277 INFO L290 TraceCheckUtils]: 50: Hoare triple {60928#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,277 INFO L290 TraceCheckUtils]: 49: Hoare triple {60928#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,277 INFO L290 TraceCheckUtils]: 48: Hoare triple {60928#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {60928#true} is VALID [2022-04-07 19:24:28,277 INFO L272 TraceCheckUtils]: 47: Hoare triple {61028#(<= ~counter~0 5)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {60928#true} is VALID [2022-04-07 19:24:28,278 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {60928#true} {61028#(<= ~counter~0 5)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:28,278 INFO L290 TraceCheckUtils]: 45: Hoare triple {60928#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {60928#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,278 INFO L290 TraceCheckUtils]: 43: Hoare triple {60928#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {60928#true} is VALID [2022-04-07 19:24:28,278 INFO L272 TraceCheckUtils]: 42: Hoare triple {61028#(<= ~counter~0 5)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {60928#true} is VALID [2022-04-07 19:24:28,279 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {60928#true} {61028#(<= ~counter~0 5)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:28,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {60928#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {60928#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {60928#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {60928#true} is VALID [2022-04-07 19:24:28,280 INFO L272 TraceCheckUtils]: 37: Hoare triple {61028#(<= ~counter~0 5)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {60928#true} is VALID [2022-04-07 19:24:28,281 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {60928#true} {61028#(<= ~counter~0 5)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:28,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {60928#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {60928#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {60928#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {60928#true} is VALID [2022-04-07 19:24:28,281 INFO L272 TraceCheckUtils]: 32: Hoare triple {61028#(<= ~counter~0 5)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {60928#true} is VALID [2022-04-07 19:24:28,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {61028#(<= ~counter~0 5)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:28,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {61018#(<= ~counter~0 4)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {61028#(<= ~counter~0 5)} is VALID [2022-04-07 19:24:28,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {61018#(<= ~counter~0 4)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {61018#(<= ~counter~0 4)} is VALID [2022-04-07 19:24:28,284 INFO L290 TraceCheckUtils]: 28: Hoare triple {61018#(<= ~counter~0 4)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {61018#(<= ~counter~0 4)} is VALID [2022-04-07 19:24:28,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {61008#(<= ~counter~0 3)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {61018#(<= ~counter~0 4)} is VALID [2022-04-07 19:24:28,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {61008#(<= ~counter~0 3)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {61008#(<= ~counter~0 3)} is VALID [2022-04-07 19:24:28,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {61008#(<= ~counter~0 3)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {61008#(<= ~counter~0 3)} is VALID [2022-04-07 19:24:28,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {60995#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {61008#(<= ~counter~0 3)} is VALID [2022-04-07 19:24:28,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {60995#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {60995#(<= ~counter~0 2)} is VALID [2022-04-07 19:24:28,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {60995#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {60995#(<= ~counter~0 2)} is VALID [2022-04-07 19:24:28,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {60995#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {60995#(<= ~counter~0 2)} is VALID [2022-04-07 19:24:28,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {60985#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {60995#(<= ~counter~0 2)} is VALID [2022-04-07 19:24:28,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {60985#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {60985#(<= ~counter~0 1)} is VALID [2022-04-07 19:24:28,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {60985#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {60985#(<= ~counter~0 1)} is VALID [2022-04-07 19:24:28,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {60936#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {60985#(<= ~counter~0 1)} is VALID [2022-04-07 19:24:28,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {60936#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:28,290 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60928#true} {60936#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:28,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {60928#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {60928#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {60928#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {60928#true} is VALID [2022-04-07 19:24:28,291 INFO L272 TraceCheckUtils]: 11: Hoare triple {60936#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {60928#true} is VALID [2022-04-07 19:24:28,291 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60928#true} {60936#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:28,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {60928#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {60928#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {60928#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {60928#true} is VALID [2022-04-07 19:24:28,292 INFO L272 TraceCheckUtils]: 6: Hoare triple {60936#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {60928#true} is VALID [2022-04-07 19:24:28,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {60936#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:28,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {60936#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:28,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60936#(<= ~counter~0 0)} {60928#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:28,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {60936#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:28,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {60928#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {60936#(<= ~counter~0 0)} is VALID [2022-04-07 19:24:28,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {60928#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60928#true} is VALID [2022-04-07 19:24:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 24 proven. 44 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-07 19:24:28,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:24:28,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360562282] [2022-04-07 19:24:28,294 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:24:28,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513436836] [2022-04-07 19:24:28,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513436836] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:24:28,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:24:28,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-07 19:24:28,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570993966] [2022-04-07 19:24:28,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:24:28,296 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 97 [2022-04-07 19:24:28,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:24:28,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-07 19:24:28,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:24:28,419 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-07 19:24:28,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:24:28,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-07 19:24:28,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-07 19:24:28,420 INFO L87 Difference]: Start difference. First operand 1839 states and 2615 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-07 19:24:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:24:29,375 INFO L93 Difference]: Finished difference Result 1868 states and 2633 transitions. [2022-04-07 19:24:29,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-07 19:24:29,376 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 97 [2022-04-07 19:24:29,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:24:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-07 19:24:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 227 transitions. [2022-04-07 19:24:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-07 19:24:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 227 transitions. [2022-04-07 19:24:29,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 227 transitions. [2022-04-07 19:24:29,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:24:29,789 INFO L225 Difference]: With dead ends: 1868 [2022-04-07 19:24:29,789 INFO L226 Difference]: Without dead ends: 1868 [2022-04-07 19:24:29,790 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2022-04-07 19:24:29,790 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 157 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:24:29,790 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 340 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 19:24:29,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2022-04-07 19:24:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1855. [2022-04-07 19:24:29,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:24:29,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1868 states. Second operand has 1855 states, 1287 states have (on average 1.3092463092463091) internal successors, (1685), 1296 states have internal predecessors, (1685), 470 states have call successors, (470), 99 states have call predecessors, (470), 97 states have return successors, (467), 459 states have call predecessors, (467), 467 states have call successors, (467) [2022-04-07 19:24:29,827 INFO L74 IsIncluded]: Start isIncluded. First operand 1868 states. Second operand has 1855 states, 1287 states have (on average 1.3092463092463091) internal successors, (1685), 1296 states have internal predecessors, (1685), 470 states have call successors, (470), 99 states have call predecessors, (470), 97 states have return successors, (467), 459 states have call predecessors, (467), 467 states have call successors, (467) [2022-04-07 19:24:29,828 INFO L87 Difference]: Start difference. First operand 1868 states. Second operand has 1855 states, 1287 states have (on average 1.3092463092463091) internal successors, (1685), 1296 states have internal predecessors, (1685), 470 states have call successors, (470), 99 states have call predecessors, (470), 97 states have return successors, (467), 459 states have call predecessors, (467), 467 states have call successors, (467) [2022-04-07 19:24:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:24:30,009 INFO L93 Difference]: Finished difference Result 1868 states and 2633 transitions. [2022-04-07 19:24:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2633 transitions. [2022-04-07 19:24:30,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:24:30,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:24:30,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 1855 states, 1287 states have (on average 1.3092463092463091) internal successors, (1685), 1296 states have internal predecessors, (1685), 470 states have call successors, (470), 99 states have call predecessors, (470), 97 states have return successors, (467), 459 states have call predecessors, (467), 467 states have call successors, (467) Second operand 1868 states. [2022-04-07 19:24:30,022 INFO L87 Difference]: Start difference. First operand has 1855 states, 1287 states have (on average 1.3092463092463091) internal successors, (1685), 1296 states have internal predecessors, (1685), 470 states have call successors, (470), 99 states have call predecessors, (470), 97 states have return successors, (467), 459 states have call predecessors, (467), 467 states have call successors, (467) Second operand 1868 states. [2022-04-07 19:24:30,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:24:30,201 INFO L93 Difference]: Finished difference Result 1868 states and 2633 transitions. [2022-04-07 19:24:30,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2633 transitions. [2022-04-07 19:24:30,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:24:30,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:24:30,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:24:30,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:24:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1855 states, 1287 states have (on average 1.3092463092463091) internal successors, (1685), 1296 states have internal predecessors, (1685), 470 states have call successors, (470), 99 states have call predecessors, (470), 97 states have return successors, (467), 459 states have call predecessors, (467), 467 states have call successors, (467) [2022-04-07 19:24:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 2622 transitions. [2022-04-07 19:24:30,358 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 2622 transitions. Word has length 97 [2022-04-07 19:24:30,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:24:30,358 INFO L478 AbstractCegarLoop]: Abstraction has 1855 states and 2622 transitions. [2022-04-07 19:24:30,359 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-07 19:24:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2622 transitions. [2022-04-07 19:24:30,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-07 19:24:30,360 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:24:30,360 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:24:30,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-07 19:24:30,581 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:24:30,581 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:24:30,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:24:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1189405093, now seen corresponding path program 3 times [2022-04-07 19:24:30,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:24:30,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059148182] [2022-04-07 19:24:30,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:24:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:24:30,600 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:24:30,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364852548] [2022-04-07 19:24:30,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 19:24:30,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:24:30,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:24:30,602 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:24:30,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-07 19:24:30,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 19:24:30,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 19:24:30,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 19:24:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:24:30,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:24:31,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {68995#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {68995#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {69003#(<= 0 ~counter~0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69003#(<= 0 ~counter~0)} {68995#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {69003#(<= 0 ~counter~0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {69003#(<= 0 ~counter~0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,208 INFO L272 TraceCheckUtils]: 6: Hoare triple {69003#(<= 0 ~counter~0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {69003#(<= 0 ~counter~0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {69003#(<= 0 ~counter~0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {69003#(<= 0 ~counter~0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,209 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69003#(<= 0 ~counter~0)} {69003#(<= 0 ~counter~0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,209 INFO L272 TraceCheckUtils]: 11: Hoare triple {69003#(<= 0 ~counter~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {69003#(<= 0 ~counter~0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {69003#(<= 0 ~counter~0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {69003#(<= 0 ~counter~0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,210 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69003#(<= 0 ~counter~0)} {69003#(<= 0 ~counter~0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {69003#(<= 0 ~counter~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {69003#(<= 0 ~counter~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {69052#(<= 1 ~counter~0)} is VALID [2022-04-07 19:24:31,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {69052#(<= 1 ~counter~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {69052#(<= 1 ~counter~0)} is VALID [2022-04-07 19:24:31,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {69052#(<= 1 ~counter~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {69052#(<= 1 ~counter~0)} is VALID [2022-04-07 19:24:31,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {69052#(<= 1 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {69062#(<= 2 ~counter~0)} is VALID [2022-04-07 19:24:31,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {69062#(<= 2 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {69062#(<= 2 ~counter~0)} is VALID [2022-04-07 19:24:31,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {69062#(<= 2 ~counter~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {69062#(<= 2 ~counter~0)} is VALID [2022-04-07 19:24:31,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {69062#(<= 2 ~counter~0)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {69072#(<= 3 ~counter~0)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,215 INFO L272 TraceCheckUtils]: 25: Hoare triple {69072#(<= 3 ~counter~0)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {69072#(<= 3 ~counter~0)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {69072#(<= 3 ~counter~0)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {69072#(<= 3 ~counter~0)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,217 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {69072#(<= 3 ~counter~0)} {69072#(<= 3 ~counter~0)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,217 INFO L272 TraceCheckUtils]: 30: Hoare triple {69072#(<= 3 ~counter~0)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {69072#(<= 3 ~counter~0)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {69072#(<= 3 ~counter~0)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {69072#(<= 3 ~counter~0)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,218 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {69072#(<= 3 ~counter~0)} {69072#(<= 3 ~counter~0)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,219 INFO L272 TraceCheckUtils]: 35: Hoare triple {69072#(<= 3 ~counter~0)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {69072#(<= 3 ~counter~0)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,219 INFO L290 TraceCheckUtils]: 37: Hoare triple {69072#(<= 3 ~counter~0)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {69072#(<= 3 ~counter~0)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,220 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69072#(<= 3 ~counter~0)} {69072#(<= 3 ~counter~0)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,221 INFO L272 TraceCheckUtils]: 40: Hoare triple {69072#(<= 3 ~counter~0)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {69072#(<= 3 ~counter~0)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {69072#(<= 3 ~counter~0)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {69072#(<= 3 ~counter~0)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,222 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {69072#(<= 3 ~counter~0)} {69072#(<= 3 ~counter~0)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {69072#(<= 3 ~counter~0)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,222 INFO L290 TraceCheckUtils]: 46: Hoare triple {69072#(<= 3 ~counter~0)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,223 INFO L290 TraceCheckUtils]: 47: Hoare triple {69072#(<= 3 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {69145#(<= 4 ~counter~0)} is VALID [2022-04-07 19:24:31,223 INFO L290 TraceCheckUtils]: 48: Hoare triple {69145#(<= 4 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {69145#(<= 4 ~counter~0)} is VALID [2022-04-07 19:24:31,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {69145#(<= 4 ~counter~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {69145#(<= 4 ~counter~0)} is VALID [2022-04-07 19:24:31,224 INFO L290 TraceCheckUtils]: 50: Hoare triple {69145#(<= 4 ~counter~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {69145#(<= 4 ~counter~0)} is VALID [2022-04-07 19:24:31,225 INFO L290 TraceCheckUtils]: 51: Hoare triple {69145#(<= 4 ~counter~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {69158#(<= 5 ~counter~0)} is VALID [2022-04-07 19:24:31,225 INFO L290 TraceCheckUtils]: 52: Hoare triple {69158#(<= 5 ~counter~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {69158#(<= 5 ~counter~0)} is VALID [2022-04-07 19:24:31,225 INFO L290 TraceCheckUtils]: 53: Hoare triple {69158#(<= 5 ~counter~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {69158#(<= 5 ~counter~0)} is VALID [2022-04-07 19:24:31,226 INFO L290 TraceCheckUtils]: 54: Hoare triple {69158#(<= 5 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {69168#(<= 6 ~counter~0)} is VALID [2022-04-07 19:24:31,226 INFO L290 TraceCheckUtils]: 55: Hoare triple {69168#(<= 6 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {69168#(<= 6 ~counter~0)} is VALID [2022-04-07 19:24:31,226 INFO L290 TraceCheckUtils]: 56: Hoare triple {69168#(<= 6 ~counter~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {69168#(<= 6 ~counter~0)} is VALID [2022-04-07 19:24:31,227 INFO L290 TraceCheckUtils]: 57: Hoare triple {69168#(<= 6 ~counter~0)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,227 INFO L290 TraceCheckUtils]: 58: Hoare triple {69178#(<= 7 ~counter~0)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,228 INFO L272 TraceCheckUtils]: 59: Hoare triple {69178#(<= 7 ~counter~0)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,228 INFO L290 TraceCheckUtils]: 60: Hoare triple {69178#(<= 7 ~counter~0)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,228 INFO L290 TraceCheckUtils]: 61: Hoare triple {69178#(<= 7 ~counter~0)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,229 INFO L290 TraceCheckUtils]: 62: Hoare triple {69178#(<= 7 ~counter~0)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,229 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69178#(<= 7 ~counter~0)} {69178#(<= 7 ~counter~0)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,230 INFO L272 TraceCheckUtils]: 64: Hoare triple {69178#(<= 7 ~counter~0)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,230 INFO L290 TraceCheckUtils]: 65: Hoare triple {69178#(<= 7 ~counter~0)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,230 INFO L290 TraceCheckUtils]: 66: Hoare triple {69178#(<= 7 ~counter~0)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,231 INFO L290 TraceCheckUtils]: 67: Hoare triple {69178#(<= 7 ~counter~0)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,231 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {69178#(<= 7 ~counter~0)} {69178#(<= 7 ~counter~0)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,232 INFO L272 TraceCheckUtils]: 69: Hoare triple {69178#(<= 7 ~counter~0)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,232 INFO L290 TraceCheckUtils]: 70: Hoare triple {69178#(<= 7 ~counter~0)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,232 INFO L290 TraceCheckUtils]: 71: Hoare triple {69178#(<= 7 ~counter~0)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,232 INFO L290 TraceCheckUtils]: 72: Hoare triple {69178#(<= 7 ~counter~0)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,233 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {69178#(<= 7 ~counter~0)} {69178#(<= 7 ~counter~0)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,233 INFO L272 TraceCheckUtils]: 74: Hoare triple {69178#(<= 7 ~counter~0)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,234 INFO L290 TraceCheckUtils]: 75: Hoare triple {69178#(<= 7 ~counter~0)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,234 INFO L290 TraceCheckUtils]: 76: Hoare triple {69178#(<= 7 ~counter~0)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,234 INFO L290 TraceCheckUtils]: 77: Hoare triple {69178#(<= 7 ~counter~0)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,235 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {69178#(<= 7 ~counter~0)} {69178#(<= 7 ~counter~0)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,235 INFO L290 TraceCheckUtils]: 79: Hoare triple {69178#(<= 7 ~counter~0)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,235 INFO L290 TraceCheckUtils]: 80: Hoare triple {69178#(<= 7 ~counter~0)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,236 INFO L290 TraceCheckUtils]: 81: Hoare triple {69178#(<= 7 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {69251#(<= 8 ~counter~0)} is VALID [2022-04-07 19:24:31,236 INFO L290 TraceCheckUtils]: 82: Hoare triple {69251#(<= 8 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {69251#(<= 8 ~counter~0)} is VALID [2022-04-07 19:24:31,237 INFO L290 TraceCheckUtils]: 83: Hoare triple {69251#(<= 8 ~counter~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {69251#(<= 8 ~counter~0)} is VALID [2022-04-07 19:24:31,237 INFO L290 TraceCheckUtils]: 84: Hoare triple {69251#(<= 8 ~counter~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {69251#(<= 8 ~counter~0)} is VALID [2022-04-07 19:24:31,237 INFO L290 TraceCheckUtils]: 85: Hoare triple {69251#(<= 8 ~counter~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {69264#(<= 9 ~counter~0)} is VALID [2022-04-07 19:24:31,238 INFO L290 TraceCheckUtils]: 86: Hoare triple {69264#(<= 9 ~counter~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {69264#(<= 9 ~counter~0)} is VALID [2022-04-07 19:24:31,239 INFO L290 TraceCheckUtils]: 87: Hoare triple {69264#(<= 9 ~counter~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {69264#(<= 9 ~counter~0)} is VALID [2022-04-07 19:24:31,240 INFO L290 TraceCheckUtils]: 88: Hoare triple {69264#(<= 9 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {69274#(<= 10 ~counter~0)} is VALID [2022-04-07 19:24:31,240 INFO L290 TraceCheckUtils]: 89: Hoare triple {69274#(<= 10 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {69274#(<= 10 ~counter~0)} is VALID [2022-04-07 19:24:31,241 INFO L290 TraceCheckUtils]: 90: Hoare triple {69274#(<= 10 ~counter~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {69274#(<= 10 ~counter~0)} is VALID [2022-04-07 19:24:31,241 INFO L290 TraceCheckUtils]: 91: Hoare triple {69274#(<= 10 ~counter~0)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {69284#(<= 10 |main_#t~post8|)} is VALID [2022-04-07 19:24:31,242 INFO L290 TraceCheckUtils]: 92: Hoare triple {69284#(<= 10 |main_#t~post8|)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {68996#false} is VALID [2022-04-07 19:24:31,242 INFO L272 TraceCheckUtils]: 93: Hoare triple {68996#false} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {68996#false} is VALID [2022-04-07 19:24:31,242 INFO L290 TraceCheckUtils]: 94: Hoare triple {68996#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {68996#false} is VALID [2022-04-07 19:24:31,242 INFO L290 TraceCheckUtils]: 95: Hoare triple {68996#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {68996#false} is VALID [2022-04-07 19:24:31,242 INFO L290 TraceCheckUtils]: 96: Hoare triple {68996#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68996#false} is VALID [2022-04-07 19:24:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-07 19:24:31,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:24:31,659 INFO L290 TraceCheckUtils]: 96: Hoare triple {68996#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68996#false} is VALID [2022-04-07 19:24:31,659 INFO L290 TraceCheckUtils]: 95: Hoare triple {68996#false} [134] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {68996#false} is VALID [2022-04-07 19:24:31,659 INFO L290 TraceCheckUtils]: 94: Hoare triple {68996#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {68996#false} is VALID [2022-04-07 19:24:31,659 INFO L272 TraceCheckUtils]: 93: Hoare triple {68996#false} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {68996#false} is VALID [2022-04-07 19:24:31,659 INFO L290 TraceCheckUtils]: 92: Hoare triple {69284#(<= 10 |main_#t~post8|)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {68996#false} is VALID [2022-04-07 19:24:31,660 INFO L290 TraceCheckUtils]: 91: Hoare triple {69274#(<= 10 ~counter~0)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {69284#(<= 10 |main_#t~post8|)} is VALID [2022-04-07 19:24:31,660 INFO L290 TraceCheckUtils]: 90: Hoare triple {69274#(<= 10 ~counter~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {69274#(<= 10 ~counter~0)} is VALID [2022-04-07 19:24:31,660 INFO L290 TraceCheckUtils]: 89: Hoare triple {69274#(<= 10 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {69274#(<= 10 ~counter~0)} is VALID [2022-04-07 19:24:31,662 INFO L290 TraceCheckUtils]: 88: Hoare triple {69264#(<= 9 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {69274#(<= 10 ~counter~0)} is VALID [2022-04-07 19:24:31,662 INFO L290 TraceCheckUtils]: 87: Hoare triple {69264#(<= 9 ~counter~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {69264#(<= 9 ~counter~0)} is VALID [2022-04-07 19:24:31,662 INFO L290 TraceCheckUtils]: 86: Hoare triple {69264#(<= 9 ~counter~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {69264#(<= 9 ~counter~0)} is VALID [2022-04-07 19:24:31,663 INFO L290 TraceCheckUtils]: 85: Hoare triple {69251#(<= 8 ~counter~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {69264#(<= 9 ~counter~0)} is VALID [2022-04-07 19:24:31,663 INFO L290 TraceCheckUtils]: 84: Hoare triple {69251#(<= 8 ~counter~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {69251#(<= 8 ~counter~0)} is VALID [2022-04-07 19:24:31,664 INFO L290 TraceCheckUtils]: 83: Hoare triple {69251#(<= 8 ~counter~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {69251#(<= 8 ~counter~0)} is VALID [2022-04-07 19:24:31,664 INFO L290 TraceCheckUtils]: 82: Hoare triple {69251#(<= 8 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {69251#(<= 8 ~counter~0)} is VALID [2022-04-07 19:24:31,665 INFO L290 TraceCheckUtils]: 81: Hoare triple {69178#(<= 7 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {69251#(<= 8 ~counter~0)} is VALID [2022-04-07 19:24:31,665 INFO L290 TraceCheckUtils]: 80: Hoare triple {69178#(<= 7 ~counter~0)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,665 INFO L290 TraceCheckUtils]: 79: Hoare triple {69178#(<= 7 ~counter~0)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,666 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {68995#true} {69178#(<= 7 ~counter~0)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,666 INFO L290 TraceCheckUtils]: 77: Hoare triple {68995#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,666 INFO L290 TraceCheckUtils]: 76: Hoare triple {68995#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,666 INFO L290 TraceCheckUtils]: 75: Hoare triple {68995#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {68995#true} is VALID [2022-04-07 19:24:31,666 INFO L272 TraceCheckUtils]: 74: Hoare triple {69178#(<= 7 ~counter~0)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {68995#true} is VALID [2022-04-07 19:24:31,666 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {68995#true} {69178#(<= 7 ~counter~0)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,666 INFO L290 TraceCheckUtils]: 72: Hoare triple {68995#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,666 INFO L290 TraceCheckUtils]: 71: Hoare triple {68995#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,667 INFO L290 TraceCheckUtils]: 70: Hoare triple {68995#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {68995#true} is VALID [2022-04-07 19:24:31,667 INFO L272 TraceCheckUtils]: 69: Hoare triple {69178#(<= 7 ~counter~0)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {68995#true} is VALID [2022-04-07 19:24:31,667 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {68995#true} {69178#(<= 7 ~counter~0)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,667 INFO L290 TraceCheckUtils]: 67: Hoare triple {68995#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,667 INFO L290 TraceCheckUtils]: 66: Hoare triple {68995#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,667 INFO L290 TraceCheckUtils]: 65: Hoare triple {68995#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {68995#true} is VALID [2022-04-07 19:24:31,667 INFO L272 TraceCheckUtils]: 64: Hoare triple {69178#(<= 7 ~counter~0)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {68995#true} is VALID [2022-04-07 19:24:31,668 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {68995#true} {69178#(<= 7 ~counter~0)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,668 INFO L290 TraceCheckUtils]: 62: Hoare triple {68995#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,668 INFO L290 TraceCheckUtils]: 61: Hoare triple {68995#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,668 INFO L290 TraceCheckUtils]: 60: Hoare triple {68995#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {68995#true} is VALID [2022-04-07 19:24:31,668 INFO L272 TraceCheckUtils]: 59: Hoare triple {69178#(<= 7 ~counter~0)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {68995#true} is VALID [2022-04-07 19:24:31,669 INFO L290 TraceCheckUtils]: 58: Hoare triple {69178#(<= 7 ~counter~0)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,669 INFO L290 TraceCheckUtils]: 57: Hoare triple {69168#(<= 6 ~counter~0)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {69178#(<= 7 ~counter~0)} is VALID [2022-04-07 19:24:31,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {69168#(<= 6 ~counter~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {69168#(<= 6 ~counter~0)} is VALID [2022-04-07 19:24:31,670 INFO L290 TraceCheckUtils]: 55: Hoare triple {69168#(<= 6 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {69168#(<= 6 ~counter~0)} is VALID [2022-04-07 19:24:31,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {69158#(<= 5 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {69168#(<= 6 ~counter~0)} is VALID [2022-04-07 19:24:31,671 INFO L290 TraceCheckUtils]: 53: Hoare triple {69158#(<= 5 ~counter~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {69158#(<= 5 ~counter~0)} is VALID [2022-04-07 19:24:31,671 INFO L290 TraceCheckUtils]: 52: Hoare triple {69158#(<= 5 ~counter~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {69158#(<= 5 ~counter~0)} is VALID [2022-04-07 19:24:31,672 INFO L290 TraceCheckUtils]: 51: Hoare triple {69145#(<= 4 ~counter~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {69158#(<= 5 ~counter~0)} is VALID [2022-04-07 19:24:31,672 INFO L290 TraceCheckUtils]: 50: Hoare triple {69145#(<= 4 ~counter~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {69145#(<= 4 ~counter~0)} is VALID [2022-04-07 19:24:31,672 INFO L290 TraceCheckUtils]: 49: Hoare triple {69145#(<= 4 ~counter~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {69145#(<= 4 ~counter~0)} is VALID [2022-04-07 19:24:31,673 INFO L290 TraceCheckUtils]: 48: Hoare triple {69145#(<= 4 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {69145#(<= 4 ~counter~0)} is VALID [2022-04-07 19:24:31,673 INFO L290 TraceCheckUtils]: 47: Hoare triple {69072#(<= 3 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {69145#(<= 4 ~counter~0)} is VALID [2022-04-07 19:24:31,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {69072#(<= 3 ~counter~0)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {69072#(<= 3 ~counter~0)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,674 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {68995#true} {69072#(<= 3 ~counter~0)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {68995#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {68995#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,675 INFO L290 TraceCheckUtils]: 41: Hoare triple {68995#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {68995#true} is VALID [2022-04-07 19:24:31,675 INFO L272 TraceCheckUtils]: 40: Hoare triple {69072#(<= 3 ~counter~0)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {68995#true} is VALID [2022-04-07 19:24:31,675 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {68995#true} {69072#(<= 3 ~counter~0)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {68995#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {68995#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {68995#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {68995#true} is VALID [2022-04-07 19:24:31,675 INFO L272 TraceCheckUtils]: 35: Hoare triple {69072#(<= 3 ~counter~0)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {68995#true} is VALID [2022-04-07 19:24:31,676 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {68995#true} {69072#(<= 3 ~counter~0)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {68995#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {68995#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {68995#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {68995#true} is VALID [2022-04-07 19:24:31,676 INFO L272 TraceCheckUtils]: 30: Hoare triple {69072#(<= 3 ~counter~0)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {68995#true} is VALID [2022-04-07 19:24:31,677 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {68995#true} {69072#(<= 3 ~counter~0)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {68995#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {68995#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {68995#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {68995#true} is VALID [2022-04-07 19:24:31,677 INFO L272 TraceCheckUtils]: 25: Hoare triple {69072#(<= 3 ~counter~0)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {68995#true} is VALID [2022-04-07 19:24:31,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {69072#(<= 3 ~counter~0)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {69062#(<= 2 ~counter~0)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {69072#(<= 3 ~counter~0)} is VALID [2022-04-07 19:24:31,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {69062#(<= 2 ~counter~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {69062#(<= 2 ~counter~0)} is VALID [2022-04-07 19:24:31,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {69062#(<= 2 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {69062#(<= 2 ~counter~0)} is VALID [2022-04-07 19:24:31,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {69052#(<= 1 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {69062#(<= 2 ~counter~0)} is VALID [2022-04-07 19:24:31,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {69052#(<= 1 ~counter~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {69052#(<= 1 ~counter~0)} is VALID [2022-04-07 19:24:31,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {69052#(<= 1 ~counter~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {69052#(<= 1 ~counter~0)} is VALID [2022-04-07 19:24:31,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {69003#(<= 0 ~counter~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {69052#(<= 1 ~counter~0)} is VALID [2022-04-07 19:24:31,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {69003#(<= 0 ~counter~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,681 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {68995#true} {69003#(<= 0 ~counter~0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {68995#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {68995#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {68995#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {68995#true} is VALID [2022-04-07 19:24:31,681 INFO L272 TraceCheckUtils]: 11: Hoare triple {69003#(<= 0 ~counter~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {68995#true} is VALID [2022-04-07 19:24:31,683 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {68995#true} {69003#(<= 0 ~counter~0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {68995#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {68995#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {68995#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {68995#true} is VALID [2022-04-07 19:24:31,684 INFO L272 TraceCheckUtils]: 6: Hoare triple {69003#(<= 0 ~counter~0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {68995#true} is VALID [2022-04-07 19:24:31,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {69003#(<= 0 ~counter~0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {69003#(<= 0 ~counter~0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69003#(<= 0 ~counter~0)} {68995#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {69003#(<= 0 ~counter~0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {68995#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {69003#(<= 0 ~counter~0)} is VALID [2022-04-07 19:24:31,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {68995#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68995#true} is VALID [2022-04-07 19:24:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-07 19:24:31,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:24:31,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059148182] [2022-04-07 19:24:31,686 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:24:31,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364852548] [2022-04-07 19:24:31,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364852548] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:24:31,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:24:31,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2022-04-07 19:24:31,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079559756] [2022-04-07 19:24:31,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:24:31,687 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 97 [2022-04-07 19:24:31,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:24:31,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-07 19:24:31,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:24:31,789 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 19:24:31,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:24:31,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 19:24:31,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-07 19:24:31,790 INFO L87 Difference]: Start difference. First operand 1855 states and 2622 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-07 19:24:32,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:24:32,693 INFO L93 Difference]: Finished difference Result 1243 states and 1501 transitions. [2022-04-07 19:24:32,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 19:24:32,693 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 97 [2022-04-07 19:24:32,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:24:32,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-07 19:24:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 225 transitions. [2022-04-07 19:24:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-07 19:24:32,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 225 transitions. [2022-04-07 19:24:32,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 225 transitions. [2022-04-07 19:24:32,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:24:32,948 INFO L225 Difference]: With dead ends: 1243 [2022-04-07 19:24:32,948 INFO L226 Difference]: Without dead ends: 1243 [2022-04-07 19:24:32,949 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2022-04-07 19:24:32,949 INFO L913 BasicCegarLoop]: 156 mSDtfsCounter, 195 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 19:24:32,949 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 469 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 19:24:32,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2022-04-07 19:24:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 935. [2022-04-07 19:24:32,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:24:32,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1243 states. Second operand has 935 states, 667 states have (on average 1.1229385307346327) internal successors, (749), 675 states have internal predecessors, (749), 171 states have call successors, (171), 98 states have call predecessors, (171), 96 states have return successors, (168), 161 states have call predecessors, (168), 168 states have call successors, (168) [2022-04-07 19:24:32,968 INFO L74 IsIncluded]: Start isIncluded. First operand 1243 states. Second operand has 935 states, 667 states have (on average 1.1229385307346327) internal successors, (749), 675 states have internal predecessors, (749), 171 states have call successors, (171), 98 states have call predecessors, (171), 96 states have return successors, (168), 161 states have call predecessors, (168), 168 states have call successors, (168) [2022-04-07 19:24:32,968 INFO L87 Difference]: Start difference. First operand 1243 states. Second operand has 935 states, 667 states have (on average 1.1229385307346327) internal successors, (749), 675 states have internal predecessors, (749), 171 states have call successors, (171), 98 states have call predecessors, (171), 96 states have return successors, (168), 161 states have call predecessors, (168), 168 states have call successors, (168) [2022-04-07 19:24:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:24:33,030 INFO L93 Difference]: Finished difference Result 1243 states and 1501 transitions. [2022-04-07 19:24:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1501 transitions. [2022-04-07 19:24:33,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:24:33,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:24:33,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 935 states, 667 states have (on average 1.1229385307346327) internal successors, (749), 675 states have internal predecessors, (749), 171 states have call successors, (171), 98 states have call predecessors, (171), 96 states have return successors, (168), 161 states have call predecessors, (168), 168 states have call successors, (168) Second operand 1243 states. [2022-04-07 19:24:33,033 INFO L87 Difference]: Start difference. First operand has 935 states, 667 states have (on average 1.1229385307346327) internal successors, (749), 675 states have internal predecessors, (749), 171 states have call successors, (171), 98 states have call predecessors, (171), 96 states have return successors, (168), 161 states have call predecessors, (168), 168 states have call successors, (168) Second operand 1243 states. [2022-04-07 19:24:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:24:33,100 INFO L93 Difference]: Finished difference Result 1243 states and 1501 transitions. [2022-04-07 19:24:33,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1501 transitions. [2022-04-07 19:24:33,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:24:33,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:24:33,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:24:33,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:24:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 667 states have (on average 1.1229385307346327) internal successors, (749), 675 states have internal predecessors, (749), 171 states have call successors, (171), 98 states have call predecessors, (171), 96 states have return successors, (168), 161 states have call predecessors, (168), 168 states have call successors, (168) [2022-04-07 19:24:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1088 transitions. [2022-04-07 19:24:33,137 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1088 transitions. Word has length 97 [2022-04-07 19:24:33,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:24:33,138 INFO L478 AbstractCegarLoop]: Abstraction has 935 states and 1088 transitions. [2022-04-07 19:24:33,138 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-07 19:24:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1088 transitions. [2022-04-07 19:24:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-07 19:24:33,139 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:24:33,139 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:24:33,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-07 19:24:33,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:24:33,359 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:24:33,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:24:33,360 INFO L85 PathProgramCache]: Analyzing trace with hash 672019267, now seen corresponding path program 2 times [2022-04-07 19:24:33,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:24:33,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165910610] [2022-04-07 19:24:33,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:24:33,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:24:33,374 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:24:33,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807796952] [2022-04-07 19:24:33,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 19:24:33,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:24:33,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:24:33,376 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:24:33,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-07 19:24:33,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 19:24:33,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-07 19:24:33,453 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 19:24:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 19:24:33,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 19:24:33,526 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 19:24:33,527 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 19:24:33,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-07 19:24:33,743 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-07 19:24:33,746 INFO L719 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:24:33,748 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 19:24:33,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:24:33 BasicIcfg [2022-04-07 19:24:33,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 19:24:33,808 INFO L158 Benchmark]: Toolchain (without parser) took 423161.05ms. Allocated memory was 176.2MB in the beginning and 355.5MB in the end (delta: 179.3MB). Free memory was 121.3MB in the beginning and 213.4MB in the end (delta: -92.1MB). Peak memory consumption was 88.7MB. Max. memory is 8.0GB. [2022-04-07 19:24:33,808 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 19:24:33,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.75ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 121.1MB in the beginning and 213.6MB in the end (delta: -92.4MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2022-04-07 19:24:33,808 INFO L158 Benchmark]: Boogie Preprocessor took 41.00ms. Allocated memory is still 243.3MB. Free memory was 213.6MB in the beginning and 212.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 19:24:33,808 INFO L158 Benchmark]: RCFGBuilder took 328.72ms. Allocated memory is still 243.3MB. Free memory was 212.0MB in the beginning and 198.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 19:24:33,808 INFO L158 Benchmark]: IcfgTransformer took 56.71ms. Allocated memory is still 243.3MB. Free memory was 198.9MB in the beginning and 196.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 19:24:33,809 INFO L158 Benchmark]: TraceAbstraction took 422422.91ms. Allocated memory was 243.3MB in the beginning and 355.5MB in the end (delta: 112.2MB). Free memory was 196.3MB in the beginning and 213.4MB in the end (delta: -17.2MB). Peak memory consumption was 96.6MB. Max. memory is 8.0GB. [2022-04-07 19:24:33,809 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 299.75ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 121.1MB in the beginning and 213.6MB in the end (delta: -92.4MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.00ms. Allocated memory is still 243.3MB. Free memory was 213.6MB in the beginning and 212.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 328.72ms. Allocated memory is still 243.3MB. Free memory was 212.0MB in the beginning and 198.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 56.71ms. Allocated memory is still 243.3MB. Free memory was 198.9MB in the beginning and 196.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 422422.91ms. Allocated memory was 243.3MB in the beginning and 355.5MB in the end (delta: 112.2MB). Free memory was 196.3MB in the beginning and 213.4MB in the end (delta: -17.2MB). Peak memory consumption was 96.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=13, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=3, y=5] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=3, y=5] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=3, b=5, counter=0, p=1, q=0, r=0, s=1, x=3, y=5] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=5, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=3, y=5] [L34] COND TRUE counter++<10 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=3, b=5, c=3, counter=1, k=0, p=1, q=0, r=0, s=1, x=3, y=5] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=5, c=3, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=3, y=5] [L41] COND TRUE counter++<10 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=3, b=5, c=3, counter=2, k=0, p=1, q=0, r=0, s=1, x=3, y=5] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=5, b=3, c=3, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=3, y=5] [L34] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=3, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=3, y=5] [L34] COND TRUE counter++<10 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=5, b=3, c=5, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=3, y=5] [L41] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=3, y=5] [L41] COND TRUE counter++<10 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=5, b=3, c=5, counter=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L48] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=5, counter++=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L48] COND TRUE counter++<10 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=5, b=3, c=5, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=5, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=5, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=5, b=3, c=5, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=5, b=3, c=5, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=5, b=3, c=2, counter=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L41] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=2, counter=6, counter++=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L41] COND TRUE counter++<10 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=5, b=3, c=2, counter=6, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=3, b=2, c=2, counter=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=3, x=3, y=5] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=2, counter=7, counter++=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=3, x=3, y=5] [L34] COND TRUE counter++<10 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=3, b=2, c=3, counter=7, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=3, x=3, y=5] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=8, counter++=7, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=3, x=3, y=5] [L41] COND TRUE counter++<10 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=3, b=2, c=3, counter=8, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L48] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=9, counter++=8, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L48] COND TRUE counter++<10 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=3, b=2, c=3, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=2, c=3, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=3, b=2, c=3, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=3, b=2, c=3, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=3, b=2, c=3, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=3, b=2, c=1, counter=9, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=1, counter=10, counter++=9, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L41] COND TRUE counter++<10 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=3, b=2, c=1, counter=10, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=2, b=1, c=1, counter=10, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=2, x=3, y=5] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=11, counter++=10, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=2, x=3, y=5] [L34] COND FALSE !(counter++<10) [L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 422.3s, OverallIterations: 25, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 209.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 2555 SdHoareTripleChecker+Valid, 69.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2488 mSDsluCounter, 7282 SdHoareTripleChecker+Invalid, 69.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5847 mSDsCounter, 1754 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7075 IncrementalHoareTripleChecker+Invalid, 8840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1754 mSolverCounterUnsat, 1435 mSDtfsCounter, 7075 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2121 GetRequests, 1707 SyntacticMatches, 12 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5558 ImplicationChecksByTransitivity, 55.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1855occurred in iteration=23, InterpolantAutomatonStates: 364, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 1439 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 197.6s InterpolantComputationTime, 1264 NumberOfCodeBlocks, 1239 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1898 ConstructedInterpolants, 0 QuantifiedInterpolants, 10640 SizeOfPredicates, 119 NumberOfNonLiveVariables, 3998 ConjunctsInSsa, 488 ConjunctsInUnsatCore, 37 InterpolantComputations, 12 PerfectInterpolantSequences, 1581/1997 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-07 19:24:33,910 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...