/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 23:08:09,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 23:08:09,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 23:08:09,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 23:08:09,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 23:08:09,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 23:08:09,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 23:08:09,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 23:08:09,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 23:08:09,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 23:08:09,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 23:08:09,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 23:08:09,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 23:08:09,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 23:08:09,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 23:08:09,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 23:08:09,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 23:08:09,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 23:08:09,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 23:08:09,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 23:08:09,973 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 23:08:09,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 23:08:09,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 23:08:09,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 23:08:09,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 23:08:09,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 23:08:09,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 23:08:09,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 23:08:09,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 23:08:09,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 23:08:09,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 23:08:09,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 23:08:09,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 23:08:09,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 23:08:09,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 23:08:09,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 23:08:09,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 23:08:09,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 23:08:09,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 23:08:09,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 23:08:09,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 23:08:09,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 23:08:09,997 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 23:08:10,024 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 23:08:10,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 23:08:10,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 23:08:10,025 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 23:08:10,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 23:08:10,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 23:08:10,026 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 23:08:10,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 23:08:10,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 23:08:10,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 23:08:10,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 23:08:10,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 23:08:10,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 23:08:10,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 23:08:10,027 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 23:08:10,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 23:08:10,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 23:08:10,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 23:08:10,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 23:08:10,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:08:10,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 23:08:10,028 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 23:08:10,028 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 23:08:10,028 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 23:08:10,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 23:08:10,029 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 23:08:10,029 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 23:08:10,029 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 23:08:10,029 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 23:08:10,030 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 23:08:10,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 23:08:10,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 23:08:10,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 23:08:10,271 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 23:08:10,271 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 23:08:10,273 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound2.c [2022-04-27 23:08:10,342 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e5e7e07/243c63b9afdc4fc5bf39bc390e39ebd5/FLAG2444cb747 [2022-04-27 23:08:10,706 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 23:08:10,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound2.c [2022-04-27 23:08:10,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e5e7e07/243c63b9afdc4fc5bf39bc390e39ebd5/FLAG2444cb747 [2022-04-27 23:08:10,721 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e5e7e07/243c63b9afdc4fc5bf39bc390e39ebd5 [2022-04-27 23:08:10,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 23:08:10,724 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 23:08:10,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 23:08:10,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 23:08:10,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 23:08:10,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:08:10" (1/1) ... [2022-04-27 23:08:10,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@285b0d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:10, skipping insertion in model container [2022-04-27 23:08:10,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:08:10" (1/1) ... [2022-04-27 23:08:10,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 23:08:10,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 23:08:10,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound2.c[576,589] [2022-04-27 23:08:10,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:08:10,914 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 23:08:10,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound2.c[576,589] [2022-04-27 23:08:10,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:08:10,943 INFO L208 MainTranslator]: Completed translation [2022-04-27 23:08:10,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:10 WrapperNode [2022-04-27 23:08:10,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 23:08:10,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 23:08:10,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 23:08:10,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 23:08:10,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:10" (1/1) ... [2022-04-27 23:08:10,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:10" (1/1) ... [2022-04-27 23:08:10,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:10" (1/1) ... [2022-04-27 23:08:10,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:10" (1/1) ... [2022-04-27 23:08:10,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:10" (1/1) ... [2022-04-27 23:08:10,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:10" (1/1) ... [2022-04-27 23:08:10,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:10" (1/1) ... [2022-04-27 23:08:10,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 23:08:10,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 23:08:10,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 23:08:10,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 23:08:10,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:10" (1/1) ... [2022-04-27 23:08:10,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:08:10,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:11,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 23:08:11,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 23:08:11,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 23:08:11,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 23:08:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 23:08:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 23:08:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 23:08:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 23:08:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 23:08:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 23:08:11,041 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 23:08:11,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 23:08:11,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 23:08:11,041 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 23:08:11,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 23:08:11,041 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 23:08:11,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 23:08:11,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 23:08:11,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 23:08:11,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 23:08:11,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 23:08:11,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 23:08:11,089 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 23:08:11,091 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 23:08:11,291 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 23:08:11,298 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 23:08:11,298 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 23:08:11,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:11 BoogieIcfgContainer [2022-04-27 23:08:11,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 23:08:11,301 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 23:08:11,301 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 23:08:11,302 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 23:08:11,304 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:11" (1/1) ... [2022-04-27 23:08:11,306 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 23:08:11,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:08:11 BasicIcfg [2022-04-27 23:08:11,348 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 23:08:11,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 23:08:11,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 23:08:11,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 23:08:11,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:08:10" (1/4) ... [2022-04-27 23:08:11,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4ebbd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:08:11, skipping insertion in model container [2022-04-27 23:08:11,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:10" (2/4) ... [2022-04-27 23:08:11,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4ebbd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:08:11, skipping insertion in model container [2022-04-27 23:08:11,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:11" (3/4) ... [2022-04-27 23:08:11,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4ebbd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:08:11, skipping insertion in model container [2022-04-27 23:08:11,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:08:11" (4/4) ... [2022-04-27 23:08:11,357 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound2.cqvasr [2022-04-27 23:08:11,367 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 23:08:11,367 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 23:08:11,418 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 23:08:11,424 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@77d28d8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7a000e98 [2022-04-27 23:08:11,424 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 23:08:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 23:08:11,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 23:08:11,440 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:11,440 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:11,441 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:11,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:11,448 INFO L85 PathProgramCache]: Analyzing trace with hash 795680375, now seen corresponding path program 1 times [2022-04-27 23:08:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:11,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409077046] [2022-04-27 23:08:11,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:11,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:11,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:08:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:11,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {59#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {42#true} is VALID [2022-04-27 23:08:11,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,718 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:08:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:11,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 23:08:11,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {42#true} is VALID [2022-04-27 23:08:11,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 23:08:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:11,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 23:08:11,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [145] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:08:11,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 23:08:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:11,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 23:08:11,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [146] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:08:11,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:08:11,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {59#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {42#true} is VALID [2022-04-27 23:08:11,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [105] mainENTRY-->L27: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {42#true} is VALID [2022-04-27 23:08:11,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} [107] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {42#true} is VALID [2022-04-27 23:08:11,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 23:08:11,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#true} {42#true} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {42#true} is VALID [2022-04-27 23:08:11,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#true} [108] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {42#true} is VALID [2022-04-27 23:08:11,772 INFO L272 TraceCheckUtils]: 12: Hoare triple {42#true} [110] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:08:11,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 23:08:11,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,773 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42#true} {42#true} [145] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:08:11,773 INFO L272 TraceCheckUtils]: 17: Hoare triple {42#true} [113] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:08:11,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 23:08:11,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:11,775 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {42#true} {42#true} [146] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:08:11,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#true} [115] L31-->L38-2: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_5)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {42#true} is VALID [2022-04-27 23:08:11,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} [116] L38-2-->L38-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:11,777 INFO L272 TraceCheckUtils]: 24: Hoare triple {43#false} [119] L38-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (= v_main_~x~0_12 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_20))) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_20, main_~x~0=v_main_~x~0_12, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {43#false} is VALID [2022-04-27 23:08:11,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {43#false} is VALID [2022-04-27 23:08:11,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {43#false} [125] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:11,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} [129] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 23:08:11,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:11,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409077046] [2022-04-27 23:08:11,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409077046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:11,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:11,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 23:08:11,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288688771] [2022-04-27 23:08:11,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:11,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-27 23:08:11,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:11,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 23:08:11,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:11,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 23:08:11,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:11,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 23:08:11,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:08:11,862 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 23:08:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:12,064 INFO L93 Difference]: Finished difference Result 71 states and 110 transitions. [2022-04-27 23:08:12,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 23:08:12,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-27 23:08:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 23:08:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-27 23:08:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 23:08:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-27 23:08:12,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-04-27 23:08:12,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:12,215 INFO L225 Difference]: With dead ends: 71 [2022-04-27 23:08:12,215 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 23:08:12,219 INFO L412 NwaCegarLoop]: 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-27 23:08:12,222 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:12,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:08:12,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 23:08:12,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 23:08:12,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:12,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:12,260 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:12,261 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:12,277 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 23:08:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 23:08:12,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:12,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:12,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-27 23:08:12,279 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-27 23:08:12,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:12,286 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 23:08:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 23:08:12,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:12,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:12,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:12,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-27 23:08:12,297 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 28 [2022-04-27 23:08:12,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:12,298 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-27 23:08:12,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 23:08:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 23:08:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 23:08:12,299 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:12,299 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:12,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 23:08:12,300 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:12,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:12,300 INFO L85 PathProgramCache]: Analyzing trace with hash 797557208, now seen corresponding path program 1 times [2022-04-27 23:08:12,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:12,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967804832] [2022-04-27 23:08:12,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:12,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:12,327 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:08:12,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1881653811] [2022-04-27 23:08:12,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:12,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:12,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:12,330 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:08:12,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 23:08:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:12,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 23:08:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:12,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:08:12,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {284#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {284#true} is VALID [2022-04-27 23:08:12,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {284#true} is VALID [2022-04-27 23:08:12,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {284#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {284#true} is VALID [2022-04-27 23:08:12,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {284#true} is VALID [2022-04-27 23:08:12,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {284#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {284#true} is VALID [2022-04-27 23:08:12,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {284#true} [105] mainENTRY-->L27: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {284#true} is VALID [2022-04-27 23:08:12,705 INFO L272 TraceCheckUtils]: 6: Hoare triple {284#true} [107] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {284#true} is VALID [2022-04-27 23:08:12,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {284#true} is VALID [2022-04-27 23:08:12,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {284#true} is VALID [2022-04-27 23:08:12,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {284#true} is VALID [2022-04-27 23:08:12,706 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {284#true} {284#true} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {284#true} is VALID [2022-04-27 23:08:12,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {284#true} [108] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {284#true} is VALID [2022-04-27 23:08:12,706 INFO L272 TraceCheckUtils]: 12: Hoare triple {284#true} [110] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {284#true} is VALID [2022-04-27 23:08:12,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {328#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:08:12,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {332#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:08:12,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {332#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:08:12,709 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {332#(not (= |assume_abort_if_not_#in~cond| 0))} {284#true} [145] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {339#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 23:08:12,709 INFO L272 TraceCheckUtils]: 17: Hoare triple {339#(and (<= 0 main_~y~0) (<= main_~y~0 2))} [113] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {284#true} is VALID [2022-04-27 23:08:12,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {284#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {328#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:08:12,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {328#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {332#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:08:12,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {332#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:08:12,711 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {332#(not (= |assume_abort_if_not_#in~cond| 0))} {339#(and (<= 0 main_~y~0) (<= main_~y~0 2))} [146] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {355#(and (<= main_~y~0 2) (<= 1 main_~y~0))} is VALID [2022-04-27 23:08:12,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {355#(and (<= main_~y~0 2) (<= 1 main_~y~0))} [115] L31-->L38-2: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_5)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {359#(and (= main_~a~0 0) (<= main_~y~0 2) (= main_~b~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:08:12,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {359#(and (= main_~a~0 0) (<= main_~y~0 2) (= main_~b~0 0) (<= 1 main_~y~0))} [118] L38-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {359#(and (= main_~a~0 0) (<= main_~y~0 2) (= main_~b~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:08:12,713 INFO L272 TraceCheckUtils]: 24: Hoare triple {359#(and (= main_~a~0 0) (<= main_~y~0 2) (= main_~b~0 0) (<= 1 main_~y~0))} [120] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {366#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:08:12,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {366#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {370#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:08:12,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {370#(<= 1 __VERIFIER_assert_~cond)} [125] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {285#false} is VALID [2022-04-27 23:08:12,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {285#false} [129] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#false} is VALID [2022-04-27 23:08:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 23:08:12,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:08:12,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:12,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967804832] [2022-04-27 23:08:12,715 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:08:12,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881653811] [2022-04-27 23:08:12,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881653811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:12,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:12,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-27 23:08:12,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073974370] [2022-04-27 23:08:12,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:12,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 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 28 [2022-04-27 23:08:12,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:12,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 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-27 23:08:12,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:12,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 23:08:12,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:12,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 23:08:12,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-27 23:08:12,741 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 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-27 23:08:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:13,137 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 23:08:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 23:08:13,138 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 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 28 [2022-04-27 23:08:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 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-27 23:08:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-27 23:08:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 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-27 23:08:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-27 23:08:13,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-27 23:08:13,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:13,196 INFO L225 Difference]: With dead ends: 45 [2022-04-27 23:08:13,196 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 23:08:13,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:08:13,198 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:13,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 169 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:08:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 23:08:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-27 23:08:13,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:13,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:08:13,219 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:08:13,220 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:08:13,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:13,222 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-27 23:08:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-27 23:08:13,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:13,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:13,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 43 states. [2022-04-27 23:08:13,224 INFO L87 Difference]: Start difference. First operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 43 states. [2022-04-27 23:08:13,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:13,227 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-27 23:08:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-27 23:08:13,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:13,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:13,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:13,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:08:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-27 23:08:13,231 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 28 [2022-04-27 23:08:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:13,231 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-27 23:08:13,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 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-27 23:08:13,232 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-27 23:08:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 23:08:13,233 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:13,233 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:13,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 23:08:13,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:13,453 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:13,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:13,454 INFO L85 PathProgramCache]: Analyzing trace with hash 648866686, now seen corresponding path program 1 times [2022-04-27 23:08:13,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:13,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682905638] [2022-04-27 23:08:13,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:13,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:13,471 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:08:13,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641885679] [2022-04-27 23:08:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:13,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:13,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:13,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:08:13,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 23:08:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:13,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 23:08:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:13,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:08:13,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {595#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {595#true} is VALID [2022-04-27 23:08:13,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {595#true} is VALID [2022-04-27 23:08:13,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {595#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {595#true} is VALID [2022-04-27 23:08:13,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {595#true} {595#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {595#true} is VALID [2022-04-27 23:08:13,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {595#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {595#true} is VALID [2022-04-27 23:08:13,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {595#true} [105] mainENTRY-->L27: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {595#true} is VALID [2022-04-27 23:08:13,785 INFO L272 TraceCheckUtils]: 6: Hoare triple {595#true} [107] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {595#true} is VALID [2022-04-27 23:08:13,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {595#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {595#true} is VALID [2022-04-27 23:08:13,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {595#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {595#true} is VALID [2022-04-27 23:08:13,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {595#true} is VALID [2022-04-27 23:08:13,786 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {595#true} {595#true} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {595#true} is VALID [2022-04-27 23:08:13,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#true} [108] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {595#true} is VALID [2022-04-27 23:08:13,787 INFO L272 TraceCheckUtils]: 12: Hoare triple {595#true} [110] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {595#true} is VALID [2022-04-27 23:08:13,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {595#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:08:13,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:08:13,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {643#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:08:13,792 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {643#(not (= |assume_abort_if_not_#in~cond| 0))} {595#true} [145] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {650#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 23:08:13,793 INFO L272 TraceCheckUtils]: 17: Hoare triple {650#(and (<= 0 main_~y~0) (<= main_~y~0 2))} [113] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {595#true} is VALID [2022-04-27 23:08:13,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {595#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:08:13,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:08:13,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {643#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:08:13,795 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {643#(not (= |assume_abort_if_not_#in~cond| 0))} {650#(and (<= 0 main_~y~0) (<= main_~y~0 2))} [146] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {666#(and (<= main_~y~0 2) (<= 1 main_~y~0))} is VALID [2022-04-27 23:08:13,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {666#(and (<= main_~y~0 2) (<= 1 main_~y~0))} [115] L31-->L38-2: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_5)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {670#(and (= main_~x~0 main_~r~0) (<= main_~y~0 2) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:08:13,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {670#(and (= main_~x~0 main_~r~0) (<= main_~y~0 2) (= main_~q~0 0) (<= 1 main_~y~0))} [118] L38-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#(and (= main_~x~0 main_~r~0) (<= main_~y~0 2) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:08:13,796 INFO L272 TraceCheckUtils]: 24: Hoare triple {670#(and (= main_~x~0 main_~r~0) (<= main_~y~0 2) (= main_~q~0 0) (<= 1 main_~y~0))} [120] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {595#true} is VALID [2022-04-27 23:08:13,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {595#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {595#true} is VALID [2022-04-27 23:08:13,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {595#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {595#true} is VALID [2022-04-27 23:08:13,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {595#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {595#true} is VALID [2022-04-27 23:08:13,797 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {595#true} {670#(and (= main_~x~0 main_~r~0) (<= main_~y~0 2) (= main_~q~0 0) (<= 1 main_~y~0))} [148] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {670#(and (= main_~x~0 main_~r~0) (<= main_~y~0 2) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:08:13,798 INFO L272 TraceCheckUtils]: 29: Hoare triple {670#(and (= main_~x~0 main_~r~0) (<= main_~y~0 2) (= main_~q~0 0) (<= 1 main_~y~0))} [123] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {692#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:08:13,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {692#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {696#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:08:13,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {696#(<= 1 __VERIFIER_assert_~cond)} [125] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {596#false} is VALID [2022-04-27 23:08:13,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {596#false} [129] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {596#false} is VALID [2022-04-27 23:08:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 23:08:13,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:08:13,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:13,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682905638] [2022-04-27 23:08:13,803 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:08:13,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641885679] [2022-04-27 23:08:13,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641885679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:13,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:13,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-27 23:08:13,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919259582] [2022-04-27 23:08:13,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:13,804 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2022-04-27 23:08:13,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:13,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 23:08:13,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:13,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 23:08:13,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:13,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 23:08:13,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-27 23:08:13,836 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 23:08:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:14,280 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-27 23:08:14,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 23:08:14,280 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2022-04-27 23:08:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 23:08:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-27 23:08:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 23:08:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-27 23:08:14,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-04-27 23:08:14,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:14,360 INFO L225 Difference]: With dead ends: 57 [2022-04-27 23:08:14,360 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 23:08:14,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:08:14,361 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 29 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:14,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 180 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:08:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 23:08:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-27 23:08:14,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:14,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:08:14,393 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:08:14,393 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:08:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:14,396 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-27 23:08:14,396 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-27 23:08:14,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:14,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:14,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 54 states. [2022-04-27 23:08:14,398 INFO L87 Difference]: Start difference. First operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 54 states. [2022-04-27 23:08:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:14,401 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-27 23:08:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-27 23:08:14,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:14,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:14,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:14,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:08:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-27 23:08:14,405 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 33 [2022-04-27 23:08:14,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:14,405 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-04-27 23:08:14,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 23:08:14,405 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-27 23:08:14,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 23:08:14,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:14,406 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:14,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 23:08:14,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 23:08:14,620 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:14,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash 619469170, now seen corresponding path program 1 times [2022-04-27 23:08:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:14,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559858473] [2022-04-27 23:08:14,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:14,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:08:14,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798442382] [2022-04-27 23:08:14,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:14,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:14,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:14,645 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:08:14,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 23:08:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:14,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 23:08:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:14,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:08:15,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {981#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {981#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {981#true} is VALID [2022-04-27 23:08:15,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {981#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {981#true} {981#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {981#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {981#true} [105] mainENTRY-->L27: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {981#true} is VALID [2022-04-27 23:08:15,017 INFO L272 TraceCheckUtils]: 6: Hoare triple {981#true} [107] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {981#true} is VALID [2022-04-27 23:08:15,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {981#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1007#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:08:15,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {1007#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1011#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:08:15,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {1011#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1011#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:08:15,019 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1011#(not (= |assume_abort_if_not_#in~cond| 0))} {981#true} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {1018#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 23:08:15,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {1018#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [108] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1018#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 23:08:15,020 INFO L272 TraceCheckUtils]: 12: Hoare triple {1018#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [110] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {981#true} is VALID [2022-04-27 23:08:15,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {981#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {981#true} is VALID [2022-04-27 23:08:15,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {981#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {981#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,023 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {981#true} {1018#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [145] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1018#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 23:08:15,023 INFO L272 TraceCheckUtils]: 17: Hoare triple {1018#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [113] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {981#true} is VALID [2022-04-27 23:08:15,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {981#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1007#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:08:15,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {1007#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1011#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:08:15,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {1011#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1011#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:08:15,026 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1011#(not (= |assume_abort_if_not_#in~cond| 0))} {1018#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [146] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1052#(and (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-27 23:08:15,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {1052#(and (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} [115] L31-->L38-2: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_5)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1056#(and (<= main_~r~0 2) (<= 1 main_~y~0))} is VALID [2022-04-27 23:08:15,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {1056#(and (<= main_~r~0 2) (<= 1 main_~y~0))} [118] L38-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#(and (<= main_~r~0 2) (<= 1 main_~y~0))} is VALID [2022-04-27 23:08:15,035 INFO L272 TraceCheckUtils]: 24: Hoare triple {1056#(and (<= main_~r~0 2) (<= 1 main_~y~0))} [120] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {981#true} is VALID [2022-04-27 23:08:15,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {981#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {981#true} is VALID [2022-04-27 23:08:15,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {981#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {981#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,036 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {981#true} {1056#(and (<= main_~r~0 2) (<= 1 main_~y~0))} [148] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1056#(and (<= main_~r~0 2) (<= 1 main_~y~0))} is VALID [2022-04-27 23:08:15,036 INFO L272 TraceCheckUtils]: 29: Hoare triple {1056#(and (<= main_~r~0 2) (<= 1 main_~y~0))} [123] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {981#true} is VALID [2022-04-27 23:08:15,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {981#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {981#true} is VALID [2022-04-27 23:08:15,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {981#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {981#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,037 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {981#true} {1056#(and (<= main_~r~0 2) (<= 1 main_~y~0))} [149] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1056#(and (<= main_~r~0 2) (<= 1 main_~y~0))} is VALID [2022-04-27 23:08:15,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {1056#(and (<= main_~r~0 2) (<= 1 main_~y~0))} [128] L40-->L47-2: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1093#(and (= main_~a~0 1) (<= main_~y~0 2) (= main_~b~0 main_~y~0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:08:15,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {1093#(and (= main_~a~0 1) (<= main_~y~0 2) (= main_~b~0 main_~y~0) (<= 1 main_~y~0))} [134] L47-2-->L48: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#(and (= main_~a~0 1) (<= main_~y~0 2) (= main_~b~0 main_~y~0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:08:15,043 INFO L272 TraceCheckUtils]: 36: Hoare triple {1093#(and (= main_~a~0 1) (<= main_~y~0 2) (= main_~b~0 main_~y~0) (<= 1 main_~y~0))} [136] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_17 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_17, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1100#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:08:15,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {1100#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1104#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:08:15,044 INFO L290 TraceCheckUtils]: 38: Hoare triple {1104#(<= 1 __VERIFIER_assert_~cond)} [125] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {982#false} is VALID [2022-04-27 23:08:15,044 INFO L290 TraceCheckUtils]: 39: Hoare triple {982#false} [129] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {982#false} is VALID [2022-04-27 23:08:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 23:08:15,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:08:15,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {982#false} [129] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {982#false} is VALID [2022-04-27 23:08:15,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {1104#(<= 1 __VERIFIER_assert_~cond)} [125] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {982#false} is VALID [2022-04-27 23:08:15,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {1100#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1104#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:08:15,344 INFO L272 TraceCheckUtils]: 36: Hoare triple {1120#(= main_~b~0 (* main_~a~0 main_~y~0))} [136] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_17 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_17, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1100#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:08:15,345 INFO L290 TraceCheckUtils]: 35: Hoare triple {1120#(= main_~b~0 (* main_~a~0 main_~y~0))} [134] L47-2-->L48: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1120#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 23:08:15,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {981#true} [128] L40-->L47-2: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1120#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 23:08:15,345 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {981#true} {981#true} [149] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {981#true} is VALID [2022-04-27 23:08:15,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {981#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {981#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {981#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {981#true} is VALID [2022-04-27 23:08:15,346 INFO L272 TraceCheckUtils]: 29: Hoare triple {981#true} [123] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {981#true} is VALID [2022-04-27 23:08:15,346 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {981#true} {981#true} [148] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {981#true} is VALID [2022-04-27 23:08:15,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {981#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {981#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {981#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {981#true} is VALID [2022-04-27 23:08:15,347 INFO L272 TraceCheckUtils]: 24: Hoare triple {981#true} [120] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {981#true} is VALID [2022-04-27 23:08:15,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {981#true} [118] L38-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {981#true} [115] L31-->L38-2: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_5)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {981#true} is VALID [2022-04-27 23:08:15,347 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {981#true} {981#true} [146] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {981#true} is VALID [2022-04-27 23:08:15,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {981#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {981#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {981#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {981#true} is VALID [2022-04-27 23:08:15,347 INFO L272 TraceCheckUtils]: 17: Hoare triple {981#true} [113] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {981#true} is VALID [2022-04-27 23:08:15,348 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {981#true} {981#true} [145] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {981#true} is VALID [2022-04-27 23:08:15,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {981#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {981#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {981#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {981#true} is VALID [2022-04-27 23:08:15,348 INFO L272 TraceCheckUtils]: 12: Hoare triple {981#true} [110] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {981#true} is VALID [2022-04-27 23:08:15,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {981#true} [108] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {981#true} is VALID [2022-04-27 23:08:15,348 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {981#true} {981#true} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {981#true} is VALID [2022-04-27 23:08:15,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {981#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {981#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {981#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {981#true} is VALID [2022-04-27 23:08:15,349 INFO L272 TraceCheckUtils]: 6: Hoare triple {981#true} [107] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {981#true} is VALID [2022-04-27 23:08:15,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {981#true} [105] mainENTRY-->L27: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {981#true} is VALID [2022-04-27 23:08:15,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {981#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {981#true} {981#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {981#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {981#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {981#true} is VALID [2022-04-27 23:08:15,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {981#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 23:08:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 23:08:15,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:15,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559858473] [2022-04-27 23:08:15,350 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:08:15,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798442382] [2022-04-27 23:08:15,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798442382] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 23:08:15,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 23:08:15,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-27 23:08:15,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214676994] [2022-04-27 23:08:15,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:15,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-27 23:08:15,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:15,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 23:08:15,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:15,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:08:15,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:15,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:08:15,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:08:15,385 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 23:08:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:15,569 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-04-27 23:08:15,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:08:15,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-27 23:08:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 23:08:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-27 23:08:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 23:08:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-27 23:08:15,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-27 23:08:15,614 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-27 23:08:15,616 INFO L225 Difference]: With dead ends: 59 [2022-04-27 23:08:15,616 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 23:08:15,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-04-27 23:08:15,617 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:15,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 102 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:08:15,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 23:08:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-27 23:08:15,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:15,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:08:15,655 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:08:15,656 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:08:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:15,659 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-04-27 23:08:15,659 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-27 23:08:15,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:15,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:15,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 57 states. [2022-04-27 23:08:15,661 INFO L87 Difference]: Start difference. First operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 57 states. [2022-04-27 23:08:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:15,664 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-04-27 23:08:15,665 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-27 23:08:15,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:15,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:15,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:15,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:08:15,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-04-27 23:08:15,670 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 40 [2022-04-27 23:08:15,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:15,671 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-04-27 23:08:15,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 23:08:15,671 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-27 23:08:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 23:08:15,673 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:15,673 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:15,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 23:08:15,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:15,888 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:15,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:15,888 INFO L85 PathProgramCache]: Analyzing trace with hash -574143214, now seen corresponding path program 1 times [2022-04-27 23:08:15,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:15,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625811063] [2022-04-27 23:08:15,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:15,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:15,902 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:08:15,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1691585688] [2022-04-27 23:08:15,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:15,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:15,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:15,904 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:08:15,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 23:08:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:15,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:08:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:15,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:08:16,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-27 23:08:16,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1521#true} is VALID [2022-04-27 23:08:16,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {1521#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-27 23:08:16,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-27 23:08:16,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {1521#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-27 23:08:16,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {1521#true} [105] mainENTRY-->L27: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1521#true} is VALID [2022-04-27 23:08:16,164 INFO L272 TraceCheckUtils]: 6: Hoare triple {1521#true} [107] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {1521#true} is VALID [2022-04-27 23:08:16,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {1521#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1521#true} is VALID [2022-04-27 23:08:16,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {1521#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-27 23:08:16,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {1521#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-27 23:08:16,164 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1521#true} {1521#true} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {1521#true} is VALID [2022-04-27 23:08:16,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {1521#true} [108] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1521#true} is VALID [2022-04-27 23:08:16,164 INFO L272 TraceCheckUtils]: 12: Hoare triple {1521#true} [110] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1521#true} is VALID [2022-04-27 23:08:16,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {1521#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1521#true} is VALID [2022-04-27 23:08:16,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {1521#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-27 23:08:16,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {1521#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-27 23:08:16,165 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1521#true} {1521#true} [145] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1521#true} is VALID [2022-04-27 23:08:16,165 INFO L272 TraceCheckUtils]: 17: Hoare triple {1521#true} [113] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1521#true} is VALID [2022-04-27 23:08:16,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {1521#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1580#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:08:16,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {1580#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1584#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:08:16,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {1584#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1584#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:08:16,167 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1584#(not (= |assume_abort_if_not_#in~cond| 0))} {1521#true} [146] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1591#(<= 1 main_~y~0)} is VALID [2022-04-27 23:08:16,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {1591#(<= 1 main_~y~0)} [115] L31-->L38-2: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_5)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1591#(<= 1 main_~y~0)} is VALID [2022-04-27 23:08:16,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {1591#(<= 1 main_~y~0)} [118] L38-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1591#(<= 1 main_~y~0)} is VALID [2022-04-27 23:08:16,167 INFO L272 TraceCheckUtils]: 24: Hoare triple {1591#(<= 1 main_~y~0)} [120] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1521#true} is VALID [2022-04-27 23:08:16,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {1521#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1521#true} is VALID [2022-04-27 23:08:16,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {1521#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-27 23:08:16,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {1521#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-27 23:08:16,168 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1521#true} {1591#(<= 1 main_~y~0)} [148] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1591#(<= 1 main_~y~0)} is VALID [2022-04-27 23:08:16,168 INFO L272 TraceCheckUtils]: 29: Hoare triple {1591#(<= 1 main_~y~0)} [123] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1521#true} is VALID [2022-04-27 23:08:16,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {1521#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1521#true} is VALID [2022-04-27 23:08:16,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {1521#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-27 23:08:16,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {1521#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-27 23:08:16,169 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1521#true} {1591#(<= 1 main_~y~0)} [149] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1591#(<= 1 main_~y~0)} is VALID [2022-04-27 23:08:16,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {1591#(<= 1 main_~y~0)} [128] L40-->L47-2: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1631#(<= 1 main_~r~0)} is VALID [2022-04-27 23:08:16,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {1631#(<= 1 main_~r~0)} [134] L47-2-->L48: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#(<= 1 main_~r~0)} is VALID [2022-04-27 23:08:16,170 INFO L272 TraceCheckUtils]: 36: Hoare triple {1631#(<= 1 main_~r~0)} [136] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_17 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_17, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1521#true} is VALID [2022-04-27 23:08:16,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {1521#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1521#true} is VALID [2022-04-27 23:08:16,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {1521#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-27 23:08:16,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {1521#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-27 23:08:16,173 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1521#true} {1631#(<= 1 main_~r~0)} [150] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_17 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_17, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1631#(<= 1 main_~r~0)} is VALID [2022-04-27 23:08:16,173 INFO L272 TraceCheckUtils]: 41: Hoare triple {1631#(<= 1 main_~r~0)} [137] L48-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (+ v_main_~r~0_15 (* v_main_~y~0_18 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_18, main_~x~0=v_main_~x~0_11, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1521#true} is VALID [2022-04-27 23:08:16,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {1521#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1521#true} is VALID [2022-04-27 23:08:16,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {1521#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-27 23:08:16,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {1521#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-27 23:08:16,174 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1521#true} {1631#(<= 1 main_~r~0)} [151] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (+ v_main_~r~0_15 (* v_main_~y~0_18 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_18, main_~x~0=v_main_~x~0_11, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1631#(<= 1 main_~r~0)} is VALID [2022-04-27 23:08:16,174 INFO L272 TraceCheckUtils]: 46: Hoare triple {1631#(<= 1 main_~r~0)} [138] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:08:16,175 INFO L290 TraceCheckUtils]: 47: Hoare triple {1668#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:08:16,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {1672#(<= 1 __VERIFIER_assert_~cond)} [125] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1522#false} is VALID [2022-04-27 23:08:16,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {1522#false} [129] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1522#false} is VALID [2022-04-27 23:08:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 23:08:16,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:08:16,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:16,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625811063] [2022-04-27 23:08:16,176 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:08:16,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691585688] [2022-04-27 23:08:16,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691585688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:16,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:16,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 23:08:16,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749248040] [2022-04-27 23:08:16,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:16,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2022-04-27 23:08:16,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:16,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 23:08:16,205 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-27 23:08:16,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 23:08:16,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:16,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 23:08:16,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-27 23:08:16,206 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 23:08:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:16,550 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-27 23:08:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 23:08:16,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2022-04-27 23:08:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 23:08:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-27 23:08:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 23:08:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-27 23:08:16,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-27 23:08:16,596 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-27 23:08:16,599 INFO L225 Difference]: With dead ends: 63 [2022-04-27 23:08:16,600 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 23:08:16,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:08:16,601 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:16,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 160 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:08:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 23:08:16,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-27 23:08:16,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:16,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:08:16,675 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:08:16,676 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:08:16,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:16,679 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-27 23:08:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-27 23:08:16,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:16,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:16,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 61 states. [2022-04-27 23:08:16,680 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 61 states. [2022-04-27 23:08:16,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:16,682 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-27 23:08:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-27 23:08:16,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:16,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:16,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:16,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:08:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-04-27 23:08:16,687 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 50 [2022-04-27 23:08:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:16,687 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-04-27 23:08:16,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 23:08:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-27 23:08:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 23:08:16,688 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:16,688 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:16,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 23:08:16,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:16,902 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:16,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:16,902 INFO L85 PathProgramCache]: Analyzing trace with hash -810208713, now seen corresponding path program 1 times [2022-04-27 23:08:16,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:16,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070693685] [2022-04-27 23:08:16,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:16,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:16,920 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:08:16,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [288160216] [2022-04-27 23:08:16,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:16,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:16,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:16,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:08:16,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 23:08:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:16,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:08:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:16,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:08:17,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {1990#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {1990#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1990#true} is VALID [2022-04-27 23:08:17,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {1990#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1990#true} {1990#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {1990#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {1990#true} [105] mainENTRY-->L27: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1990#true} is VALID [2022-04-27 23:08:17,297 INFO L272 TraceCheckUtils]: 6: Hoare triple {1990#true} [107] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {1990#true} is VALID [2022-04-27 23:08:17,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {1990#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1990#true} is VALID [2022-04-27 23:08:17,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {1990#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {1990#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,297 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1990#true} {1990#true} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {1990#true} is VALID [2022-04-27 23:08:17,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {1990#true} [108] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1990#true} is VALID [2022-04-27 23:08:17,298 INFO L272 TraceCheckUtils]: 12: Hoare triple {1990#true} [110] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1990#true} is VALID [2022-04-27 23:08:17,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {1990#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1990#true} is VALID [2022-04-27 23:08:17,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {1990#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {1990#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,298 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1990#true} {1990#true} [145] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1990#true} is VALID [2022-04-27 23:08:17,298 INFO L272 TraceCheckUtils]: 17: Hoare triple {1990#true} [113] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1990#true} is VALID [2022-04-27 23:08:17,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {1990#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1990#true} is VALID [2022-04-27 23:08:17,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {1990#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {1990#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,299 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1990#true} {1990#true} [146] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1990#true} is VALID [2022-04-27 23:08:17,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {1990#true} [115] L31-->L38-2: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_5)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1990#true} is VALID [2022-04-27 23:08:17,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {1990#true} [118] L38-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,299 INFO L272 TraceCheckUtils]: 24: Hoare triple {1990#true} [120] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1990#true} is VALID [2022-04-27 23:08:17,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {1990#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1990#true} is VALID [2022-04-27 23:08:17,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {1990#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {1990#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,300 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1990#true} {1990#true} [148] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1990#true} is VALID [2022-04-27 23:08:17,300 INFO L272 TraceCheckUtils]: 29: Hoare triple {1990#true} [123] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1990#true} is VALID [2022-04-27 23:08:17,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {1990#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1990#true} is VALID [2022-04-27 23:08:17,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {1990#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,300 INFO L290 TraceCheckUtils]: 32: Hoare triple {1990#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,300 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1990#true} {1990#true} [149] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1990#true} is VALID [2022-04-27 23:08:17,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {1990#true} [128] L40-->L47-2: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1990#true} is VALID [2022-04-27 23:08:17,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {1990#true} [134] L47-2-->L48: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,301 INFO L272 TraceCheckUtils]: 36: Hoare triple {1990#true} [136] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_17 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_17, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1990#true} is VALID [2022-04-27 23:08:17,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {1990#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2106#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:08:17,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {2106#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2110#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:08:17,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {2110#(not (= |__VERIFIER_assert_#in~cond| 0))} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2110#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:08:17,305 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2110#(not (= |__VERIFIER_assert_#in~cond| 0))} {1990#true} [150] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_17 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_17, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2117#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 23:08:17,305 INFO L272 TraceCheckUtils]: 41: Hoare triple {2117#(= main_~b~0 (* main_~a~0 main_~y~0))} [137] L48-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (+ v_main_~r~0_15 (* v_main_~y~0_18 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_18, main_~x~0=v_main_~x~0_11, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1990#true} is VALID [2022-04-27 23:08:17,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {1990#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1990#true} is VALID [2022-04-27 23:08:17,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {1990#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {1990#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,306 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1990#true} {2117#(= main_~b~0 (* main_~a~0 main_~y~0))} [151] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (+ v_main_~r~0_15 (* v_main_~y~0_18 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_18, main_~x~0=v_main_~x~0_11, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2117#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 23:08:17,306 INFO L272 TraceCheckUtils]: 46: Hoare triple {2117#(= main_~b~0 (* main_~a~0 main_~y~0))} [138] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1990#true} is VALID [2022-04-27 23:08:17,306 INFO L290 TraceCheckUtils]: 47: Hoare triple {1990#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1990#true} is VALID [2022-04-27 23:08:17,306 INFO L290 TraceCheckUtils]: 48: Hoare triple {1990#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,306 INFO L290 TraceCheckUtils]: 49: Hoare triple {1990#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:17,306 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1990#true} {2117#(= main_~b~0 (* main_~a~0 main_~y~0))} [152] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2117#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 23:08:17,307 INFO L290 TraceCheckUtils]: 51: Hoare triple {2117#(= main_~b~0 (* main_~a~0 main_~y~0))} [140] L50-->L55: Formula: (<= (* v_main_~b~0_7 2) v_main_~r~0_9) InVars {main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2151#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-27 23:08:17,308 INFO L272 TraceCheckUtils]: 52: Hoare triple {2151#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} [142] L55-->__VERIFIER_assertENTRY: Formula: (= (ite (<= (* (* v_main_~y~0_19 v_main_~a~0_12) 2) v_main_~r~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~y~0=v_main_~y~0_19, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {2155#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:08:17,308 INFO L290 TraceCheckUtils]: 53: Hoare triple {2155#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2159#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:08:17,308 INFO L290 TraceCheckUtils]: 54: Hoare triple {2159#(<= 1 __VERIFIER_assert_~cond)} [125] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1991#false} is VALID [2022-04-27 23:08:17,308 INFO L290 TraceCheckUtils]: 55: Hoare triple {1991#false} [129] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1991#false} is VALID [2022-04-27 23:08:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 23:08:17,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:08:24,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {1991#false} [129] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1991#false} is VALID [2022-04-27 23:08:24,856 INFO L290 TraceCheckUtils]: 54: Hoare triple {2159#(<= 1 __VERIFIER_assert_~cond)} [125] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1991#false} is VALID [2022-04-27 23:08:24,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {2155#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2159#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:08:24,857 INFO L272 TraceCheckUtils]: 52: Hoare triple {2151#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} [142] L55-->__VERIFIER_assertENTRY: Formula: (= (ite (<= (* (* v_main_~y~0_19 v_main_~a~0_12) 2) v_main_~r~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~y~0=v_main_~y~0_19, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {2155#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:08:24,858 INFO L290 TraceCheckUtils]: 51: Hoare triple {2178#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [140] L50-->L55: Formula: (<= (* v_main_~b~0_7 2) v_main_~r~0_9) InVars {main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2151#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-27 23:08:24,859 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1990#true} {2178#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [152] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2178#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-27 23:08:24,859 INFO L290 TraceCheckUtils]: 49: Hoare triple {1990#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,859 INFO L290 TraceCheckUtils]: 48: Hoare triple {1990#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,859 INFO L290 TraceCheckUtils]: 47: Hoare triple {1990#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1990#true} is VALID [2022-04-27 23:08:24,859 INFO L272 TraceCheckUtils]: 46: Hoare triple {2178#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [138] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1990#true} is VALID [2022-04-27 23:08:24,860 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1990#true} {2178#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [151] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (+ v_main_~r~0_15 (* v_main_~y~0_18 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_18, main_~x~0=v_main_~x~0_11, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2178#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-27 23:08:24,860 INFO L290 TraceCheckUtils]: 44: Hoare triple {1990#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {1990#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {1990#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1990#true} is VALID [2022-04-27 23:08:24,861 INFO L272 TraceCheckUtils]: 41: Hoare triple {2178#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [137] L48-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (+ v_main_~r~0_15 (* v_main_~y~0_18 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_18, main_~x~0=v_main_~x~0_11, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1990#true} is VALID [2022-04-27 23:08:24,862 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2110#(not (= |__VERIFIER_assert_#in~cond| 0))} {1990#true} [150] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_17 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_17, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2178#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-27 23:08:24,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {2110#(not (= |__VERIFIER_assert_#in~cond| 0))} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2110#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:08:24,863 INFO L290 TraceCheckUtils]: 38: Hoare triple {2221#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2110#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:08:24,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {1990#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2221#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:08:24,864 INFO L272 TraceCheckUtils]: 36: Hoare triple {1990#true} [136] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_17 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_17, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1990#true} is VALID [2022-04-27 23:08:24,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {1990#true} [134] L47-2-->L48: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {1990#true} [128] L40-->L47-2: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1990#true} is VALID [2022-04-27 23:08:24,865 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1990#true} {1990#true} [149] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1990#true} is VALID [2022-04-27 23:08:24,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {1990#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {1990#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {1990#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1990#true} is VALID [2022-04-27 23:08:24,865 INFO L272 TraceCheckUtils]: 29: Hoare triple {1990#true} [123] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1990#true} is VALID [2022-04-27 23:08:24,865 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1990#true} {1990#true} [148] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1990#true} is VALID [2022-04-27 23:08:24,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {1990#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {1990#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {1990#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1990#true} is VALID [2022-04-27 23:08:24,866 INFO L272 TraceCheckUtils]: 24: Hoare triple {1990#true} [120] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1990#true} is VALID [2022-04-27 23:08:24,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {1990#true} [118] L38-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {1990#true} [115] L31-->L38-2: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_5)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1990#true} is VALID [2022-04-27 23:08:24,866 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1990#true} {1990#true} [146] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1990#true} is VALID [2022-04-27 23:08:24,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {1990#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {1990#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {1990#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1990#true} is VALID [2022-04-27 23:08:24,867 INFO L272 TraceCheckUtils]: 17: Hoare triple {1990#true} [113] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1990#true} is VALID [2022-04-27 23:08:24,867 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1990#true} {1990#true} [145] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1990#true} is VALID [2022-04-27 23:08:24,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {1990#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {1990#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {1990#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1990#true} is VALID [2022-04-27 23:08:24,867 INFO L272 TraceCheckUtils]: 12: Hoare triple {1990#true} [110] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1990#true} is VALID [2022-04-27 23:08:24,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {1990#true} [108] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1990#true} is VALID [2022-04-27 23:08:24,868 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1990#true} {1990#true} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {1990#true} is VALID [2022-04-27 23:08:24,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {1990#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {1990#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {1990#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1990#true} is VALID [2022-04-27 23:08:24,868 INFO L272 TraceCheckUtils]: 6: Hoare triple {1990#true} [107] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {1990#true} is VALID [2022-04-27 23:08:24,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {1990#true} [105] mainENTRY-->L27: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1990#true} is VALID [2022-04-27 23:08:24,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {1990#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1990#true} {1990#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {1990#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {1990#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1990#true} is VALID [2022-04-27 23:08:24,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {1990#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-27 23:08:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 23:08:24,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:24,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070693685] [2022-04-27 23:08:24,869 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:08:24,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288160216] [2022-04-27 23:08:24,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288160216] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:08:24,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:08:24,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 23:08:24,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677067671] [2022-04-27 23:08:24,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:08:24,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 56 [2022-04-27 23:08:24,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:24,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-27 23:08:24,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:24,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 23:08:24,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:24,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 23:08:24,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 23:08:24,912 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-27 23:08:25,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:25,305 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-27 23:08:25,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 23:08:25,305 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 56 [2022-04-27 23:08:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:25,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-27 23:08:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-27 23:08:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-27 23:08:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-27 23:08:25,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-27 23:08:25,353 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-27 23:08:25,354 INFO L225 Difference]: With dead ends: 67 [2022-04-27 23:08:25,354 INFO L226 Difference]: Without dead ends: 65 [2022-04-27 23:08:25,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-27 23:08:25,355 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:25,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 136 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:08:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-27 23:08:25,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-27 23:08:25,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:25,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:08:25,402 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:08:25,402 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:08:25,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:25,405 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-27 23:08:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-27 23:08:25,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:25,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:25,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 65 states. [2022-04-27 23:08:25,406 INFO L87 Difference]: Start difference. First operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 65 states. [2022-04-27 23:08:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:25,409 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-27 23:08:25,409 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-27 23:08:25,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:25,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:25,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:25,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:08:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-04-27 23:08:25,414 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 56 [2022-04-27 23:08:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:25,415 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-04-27 23:08:25,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-27 23:08:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-27 23:08:25,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 23:08:25,416 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:25,416 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:25,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 23:08:25,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:25,639 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:25,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:25,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1603019557, now seen corresponding path program 1 times [2022-04-27 23:08:25,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:25,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467265945] [2022-04-27 23:08:25,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:25,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:25,655 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:08:25,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939883573] [2022-04-27 23:08:25,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:25,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:25,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:25,663 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:08:25,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 23:08:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:25,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 23:08:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:25,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:08:26,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {2665#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {2665#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2665#true} is VALID [2022-04-27 23:08:26,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {2665#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2665#true} {2665#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {2665#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {2665#true} [105] mainENTRY-->L27: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {2665#true} is VALID [2022-04-27 23:08:26,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {2665#true} [107] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {2665#true} is VALID [2022-04-27 23:08:26,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {2665#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2665#true} is VALID [2022-04-27 23:08:26,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {2665#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {2665#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2665#true} {2665#true} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {2665#true} is VALID [2022-04-27 23:08:26,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {2665#true} [108] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {2665#true} is VALID [2022-04-27 23:08:26,230 INFO L272 TraceCheckUtils]: 12: Hoare triple {2665#true} [110] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2665#true} is VALID [2022-04-27 23:08:26,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {2665#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2665#true} is VALID [2022-04-27 23:08:26,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {2665#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {2665#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,231 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2665#true} {2665#true} [145] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2665#true} is VALID [2022-04-27 23:08:26,231 INFO L272 TraceCheckUtils]: 17: Hoare triple {2665#true} [113] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2665#true} is VALID [2022-04-27 23:08:26,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {2665#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2665#true} is VALID [2022-04-27 23:08:26,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {2665#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {2665#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,232 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2665#true} {2665#true} [146] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2665#true} is VALID [2022-04-27 23:08:26,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {2665#true} [115] L31-->L38-2: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_5)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {2736#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:26,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {2736#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [118] L38-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2736#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:26,233 INFO L272 TraceCheckUtils]: 24: Hoare triple {2736#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [120] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2665#true} is VALID [2022-04-27 23:08:26,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {2665#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2665#true} is VALID [2022-04-27 23:08:26,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {2665#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {2665#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,234 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2665#true} {2736#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [148] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2736#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:26,234 INFO L272 TraceCheckUtils]: 29: Hoare triple {2736#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [123] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2665#true} is VALID [2022-04-27 23:08:26,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {2665#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2665#true} is VALID [2022-04-27 23:08:26,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {2665#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {2665#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,236 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2665#true} {2736#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [149] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2736#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:26,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {2736#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [128] L40-->L47-2: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2773#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:26,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {2773#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [134] L47-2-->L48: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2773#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:26,237 INFO L272 TraceCheckUtils]: 36: Hoare triple {2773#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [136] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_17 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_17, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2665#true} is VALID [2022-04-27 23:08:26,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {2665#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2665#true} is VALID [2022-04-27 23:08:26,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {2665#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {2665#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,238 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2665#true} {2773#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [150] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_17 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_17, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2773#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:26,238 INFO L272 TraceCheckUtils]: 41: Hoare triple {2773#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [137] L48-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (+ v_main_~r~0_15 (* v_main_~y~0_18 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_18, main_~x~0=v_main_~x~0_11, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2665#true} is VALID [2022-04-27 23:08:26,238 INFO L290 TraceCheckUtils]: 42: Hoare triple {2665#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2665#true} is VALID [2022-04-27 23:08:26,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {2665#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {2665#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,239 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2665#true} {2773#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [151] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (+ v_main_~r~0_15 (* v_main_~y~0_18 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_18, main_~x~0=v_main_~x~0_11, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2773#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:26,240 INFO L272 TraceCheckUtils]: 46: Hoare triple {2773#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [138] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2665#true} is VALID [2022-04-27 23:08:26,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {2665#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2665#true} is VALID [2022-04-27 23:08:26,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {2665#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {2665#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,241 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2665#true} {2773#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [152] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2773#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:26,241 INFO L290 TraceCheckUtils]: 51: Hoare triple {2773#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [139] L50-->L47-3: Formula: (not (<= (* v_main_~b~0_6 2) v_main_~r~0_8)) InVars {main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {2825#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:08:26,242 INFO L290 TraceCheckUtils]: 52: Hoare triple {2825#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [135] L47-3-->L38-2: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {2829#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} is VALID [2022-04-27 23:08:26,243 INFO L290 TraceCheckUtils]: 53: Hoare triple {2829#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} [118] L38-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2829#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} is VALID [2022-04-27 23:08:26,243 INFO L272 TraceCheckUtils]: 54: Hoare triple {2829#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} [120] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2665#true} is VALID [2022-04-27 23:08:26,243 INFO L290 TraceCheckUtils]: 55: Hoare triple {2665#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2665#true} is VALID [2022-04-27 23:08:26,243 INFO L290 TraceCheckUtils]: 56: Hoare triple {2665#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,244 INFO L290 TraceCheckUtils]: 57: Hoare triple {2665#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,244 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {2665#true} {2829#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} [148] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2829#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} is VALID [2022-04-27 23:08:26,245 INFO L272 TraceCheckUtils]: 59: Hoare triple {2829#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} [123] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2851#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:08:26,246 INFO L290 TraceCheckUtils]: 60: Hoare triple {2851#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2855#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:08:26,246 INFO L290 TraceCheckUtils]: 61: Hoare triple {2855#(<= 1 __VERIFIER_assert_~cond)} [125] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2666#false} is VALID [2022-04-27 23:08:26,246 INFO L290 TraceCheckUtils]: 62: Hoare triple {2666#false} [129] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2666#false} is VALID [2022-04-27 23:08:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-27 23:08:26,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:08:26,627 INFO L290 TraceCheckUtils]: 62: Hoare triple {2666#false} [129] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2666#false} is VALID [2022-04-27 23:08:26,628 INFO L290 TraceCheckUtils]: 61: Hoare triple {2855#(<= 1 __VERIFIER_assert_~cond)} [125] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2666#false} is VALID [2022-04-27 23:08:26,628 INFO L290 TraceCheckUtils]: 60: Hoare triple {2851#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2855#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:08:26,629 INFO L272 TraceCheckUtils]: 59: Hoare triple {2871#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [123] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2851#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:08:26,629 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {2665#true} {2871#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [148] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2871#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:08:26,629 INFO L290 TraceCheckUtils]: 57: Hoare triple {2665#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,629 INFO L290 TraceCheckUtils]: 56: Hoare triple {2665#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,630 INFO L290 TraceCheckUtils]: 55: Hoare triple {2665#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2665#true} is VALID [2022-04-27 23:08:26,630 INFO L272 TraceCheckUtils]: 54: Hoare triple {2871#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [120] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2665#true} is VALID [2022-04-27 23:08:26,630 INFO L290 TraceCheckUtils]: 53: Hoare triple {2871#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [118] L38-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2871#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:08:26,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {2893#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [135] L47-3-->L38-2: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {2871#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 23:08:26,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {2897#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [139] L50-->L47-3: Formula: (not (<= (* v_main_~b~0_6 2) v_main_~r~0_8)) InVars {main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {2893#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 23:08:26,642 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2665#true} {2897#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [152] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2897#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-27 23:08:26,642 INFO L290 TraceCheckUtils]: 49: Hoare triple {2665#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,642 INFO L290 TraceCheckUtils]: 48: Hoare triple {2665#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,642 INFO L290 TraceCheckUtils]: 47: Hoare triple {2665#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2665#true} is VALID [2022-04-27 23:08:26,642 INFO L272 TraceCheckUtils]: 46: Hoare triple {2897#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [138] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2665#true} is VALID [2022-04-27 23:08:26,643 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2665#true} {2897#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [151] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (+ v_main_~r~0_15 (* v_main_~y~0_18 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_18, main_~x~0=v_main_~x~0_11, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2897#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-27 23:08:26,647 INFO L290 TraceCheckUtils]: 44: Hoare triple {2665#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,647 INFO L290 TraceCheckUtils]: 43: Hoare triple {2665#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,647 INFO L290 TraceCheckUtils]: 42: Hoare triple {2665#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2665#true} is VALID [2022-04-27 23:08:26,648 INFO L272 TraceCheckUtils]: 41: Hoare triple {2897#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [137] L48-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (+ v_main_~r~0_15 (* v_main_~y~0_18 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_18, main_~x~0=v_main_~x~0_11, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2665#true} is VALID [2022-04-27 23:08:26,648 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2665#true} {2897#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [150] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_17 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_17, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2897#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-27 23:08:26,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {2665#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {2665#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {2665#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2665#true} is VALID [2022-04-27 23:08:26,649 INFO L272 TraceCheckUtils]: 36: Hoare triple {2897#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [136] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_17 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_17, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2665#true} is VALID [2022-04-27 23:08:26,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {2897#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [134] L47-2-->L48: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2897#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-27 23:08:26,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {2949#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} [128] L40-->L47-2: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2897#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-27 23:08:26,650 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2665#true} {2949#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} [149] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2949#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} is VALID [2022-04-27 23:08:26,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {2665#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {2665#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {2665#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2665#true} is VALID [2022-04-27 23:08:26,651 INFO L272 TraceCheckUtils]: 29: Hoare triple {2949#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} [123] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_10 (+ v_main_~r~0_14 (* v_main_~y~0_16 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_16, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2665#true} is VALID [2022-04-27 23:08:26,651 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2665#true} {2949#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} [148] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2949#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} is VALID [2022-04-27 23:08:26,652 INFO L290 TraceCheckUtils]: 27: Hoare triple {2665#true} [131] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {2665#true} [126] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {2665#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2665#true} is VALID [2022-04-27 23:08:26,652 INFO L272 TraceCheckUtils]: 24: Hoare triple {2949#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} [120] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_15 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2665#true} is VALID [2022-04-27 23:08:26,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {2949#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} [118] L38-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2949#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} is VALID [2022-04-27 23:08:26,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {2665#true} [115] L31-->L38-2: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_5)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {2949#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} is VALID [2022-04-27 23:08:26,653 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2665#true} {2665#true} [146] assume_abort_if_notEXIT-->L31: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2665#true} is VALID [2022-04-27 23:08:26,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {2665#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {2665#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {2665#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2665#true} is VALID [2022-04-27 23:08:26,653 INFO L272 TraceCheckUtils]: 17: Hoare triple {2665#true} [113] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_14) 1 0)) InVars {main_~y~0=v_main_~y~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2665#true} is VALID [2022-04-27 23:08:26,653 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2665#true} {2665#true} [145] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2665#true} is VALID [2022-04-27 23:08:26,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {2665#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {2665#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {2665#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2665#true} is VALID [2022-04-27 23:08:26,654 INFO L272 TraceCheckUtils]: 12: Hoare triple {2665#true} [110] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_13) (<= v_main_~y~0_13 2)) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2665#true} is VALID [2022-04-27 23:08:26,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {2665#true} [108] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {2665#true} is VALID [2022-04-27 23:08:26,654 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2665#true} {2665#true} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {2665#true} is VALID [2022-04-27 23:08:26,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {2665#true} [114] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {2665#true} [112] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {2665#true} [109] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2665#true} is VALID [2022-04-27 23:08:26,654 INFO L272 TraceCheckUtils]: 6: Hoare triple {2665#true} [107] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_9) (<= v_main_~x~0_9 2)) 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] {2665#true} is VALID [2022-04-27 23:08:26,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {2665#true} [105] mainENTRY-->L27: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {2665#true} is VALID [2022-04-27 23:08:26,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {2665#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2665#true} {2665#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {2665#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {2665#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2665#true} is VALID [2022-04-27 23:08:26,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {2665#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-27 23:08:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-27 23:08:26,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:26,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467265945] [2022-04-27 23:08:26,656 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:08:26,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939883573] [2022-04-27 23:08:26,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939883573] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 23:08:26,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 23:08:26,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2022-04-27 23:08:26,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241601392] [2022-04-27 23:08:26,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:26,659 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 63 [2022-04-27 23:08:26,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:26,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 23:08:26,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:26,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 23:08:26,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:26,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 23:08:26,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-04-27 23:08:26,705 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 23:08:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:27,124 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-27 23:08:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:08:27,125 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 63 [2022-04-27 23:08:27,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:27,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 23:08:27,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-27 23:08:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 23:08:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-27 23:08:27,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-04-27 23:08:27,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:27,188 INFO L225 Difference]: With dead ends: 65 [2022-04-27 23:08:27,188 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 23:08:27,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-27 23:08:27,189 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:27,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 23:08:27,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 23:08:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 23:08:27,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:27,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 23:08:27,190 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 23:08:27,190 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 23:08:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:27,191 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 23:08:27,191 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 23:08:27,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:27,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:27,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 23:08:27,191 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 23:08:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:27,191 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 23:08:27,191 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 23:08:27,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:27,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:27,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:27,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 23:08:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 23:08:27,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2022-04-27 23:08:27,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:27,192 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 23:08:27,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 23:08:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 23:08:27,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:27,194 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 23:08:27,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 23:08:27,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:27,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 23:08:27,845 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 23:08:27,845 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 23:08:27,845 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 23:08:27,845 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 23:08:27,845 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 23:08:27,845 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 23:08:27,845 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 23:08:27,845 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-27 23:08:27,845 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-27 23:08:27,846 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-27 23:08:27,846 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-27 23:08:27,846 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 66) the Hoare annotation is: true [2022-04-27 23:08:27,846 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-27 23:08:27,846 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-04-27 23:08:27,846 INFO L902 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-27 23:08:27,846 INFO L895 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (and (<= 0 main_~y~0) (<= main_~y~0 2)) [2022-04-27 23:08:27,846 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-04-27 23:08:27,846 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 62) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-27 23:08:27,846 INFO L895 garLoopResultBuilder]: At program point L38-3(lines 38 62) the Hoare annotation is: (let ((.cse0 (<= main_~y~0 2)) (.cse1 (<= 1 main_~y~0))) (or (and (= main_~x~0 main_~r~0) .cse0 (= main_~q~0 0) .cse1) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) .cse0 .cse1 (= main_~b~0 (* main_~a~0 main_~y~0))))) [2022-04-27 23:08:27,846 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-27 23:08:27,846 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2022-04-27 23:08:27,846 INFO L895 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-27 23:08:27,846 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 22 66) no Hoare annotation was computed. [2022-04-27 23:08:27,847 INFO L899 garLoopResultBuilder]: For program point L40(lines 38 62) no Hoare annotation was computed. [2022-04-27 23:08:27,847 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 22 66) no Hoare annotation was computed. [2022-04-27 23:08:27,847 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 47 59) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 2) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-27 23:08:27,847 INFO L899 garLoopResultBuilder]: For program point L47-3(lines 47 59) no Hoare annotation was computed. [2022-04-27 23:08:27,847 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 2) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-27 23:08:27,847 INFO L895 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 2) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-27 23:08:27,847 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 2) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-27 23:08:27,847 INFO L899 garLoopResultBuilder]: For program point L50(lines 47 59) no Hoare annotation was computed. [2022-04-27 23:08:27,847 INFO L899 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2022-04-27 23:08:27,847 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 2) (<= (* 2 .cse0) main_~r~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-27 23:08:27,847 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-27 23:08:27,847 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-27 23:08:27,847 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-27 23:08:27,847 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-27 23:08:27,848 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-27 23:08:27,848 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-27 23:08:27,850 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:27,851 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 23:08:27,857 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 23:08:27,857 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 23:08:27,857 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 23:08:27,857 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 23:08:27,857 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 23:08:27,857 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 23:08:27,857 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 23:08:27,857 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 23:08:27,857 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 23:08:27,857 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 23:08:27,857 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 23:08:27,857 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 23:08:27,857 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 23:08:27,857 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 23:08:27,857 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 23:08:27,858 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 23:08:27,858 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:08:27,858 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:08:27,858 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:08:27,858 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:08:27,858 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:08:27,858 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:08:27,858 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:08:27,858 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 23:08:27,858 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 23:08:27,858 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 23:08:27,858 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 23:08:27,858 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 23:08:27,858 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 23:08:27,858 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2022-04-27 23:08:27,858 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-04-27 23:08:27,861 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-27 23:08:27,861 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-27 23:08:27,862 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-27 23:08:27,862 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 23:08:27,862 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 23:08:27,862 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 23:08:27,862 INFO L163 areAnnotationChecker]: CFG has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 23:08:27,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:08:27 BasicIcfg [2022-04-27 23:08:27,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 23:08:27,875 INFO L158 Benchmark]: Toolchain (without parser) took 17151.12ms. Allocated memory was 175.1MB in the beginning and 292.6MB in the end (delta: 117.4MB). Free memory was 118.9MB in the beginning and 131.3MB in the end (delta: -12.4MB). Peak memory consumption was 105.8MB. Max. memory is 8.0GB. [2022-04-27 23:08:27,875 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 23:08:27,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.65ms. Allocated memory was 175.1MB in the beginning and 243.3MB in the end (delta: 68.2MB). Free memory was 118.7MB in the beginning and 213.9MB in the end (delta: -95.3MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-04-27 23:08:27,876 INFO L158 Benchmark]: Boogie Preprocessor took 26.09ms. Allocated memory is still 243.3MB. Free memory was 213.9MB in the beginning and 212.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 23:08:27,876 INFO L158 Benchmark]: RCFGBuilder took 327.20ms. Allocated memory is still 243.3MB. Free memory was 212.4MB in the beginning and 199.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 23:08:27,876 INFO L158 Benchmark]: IcfgTransformer took 47.32ms. Allocated memory is still 243.3MB. Free memory was 199.8MB in the beginning and 197.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 23:08:27,877 INFO L158 Benchmark]: TraceAbstraction took 16524.40ms. Allocated memory was 243.3MB in the beginning and 292.6MB in the end (delta: 49.3MB). Free memory was 197.2MB in the beginning and 131.3MB in the end (delta: 65.9MB). Peak memory consumption was 115.6MB. Max. memory is 8.0GB. [2022-04-27 23:08:27,879 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.13ms. Allocated memory is still 175.1MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.65ms. Allocated memory was 175.1MB in the beginning and 243.3MB in the end (delta: 68.2MB). Free memory was 118.7MB in the beginning and 213.9MB in the end (delta: -95.3MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.09ms. Allocated memory is still 243.3MB. Free memory was 213.9MB in the beginning and 212.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 327.20ms. Allocated memory is still 243.3MB. Free memory was 212.4MB in the beginning and 199.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 47.32ms. Allocated memory is still 243.3MB. Free memory was 199.8MB in the beginning and 197.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 16524.40ms. Allocated memory was 243.3MB in the beginning and 292.6MB in the end (delta: 49.3MB). Free memory was 197.2MB in the beginning and 131.3MB in the end (delta: 65.9MB). Peak memory consumption was 115.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 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 7, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 147 mSDsluCounter, 886 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 649 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 650 IncrementalHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 237 mSDtfsCounter, 650 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 446 GetRequests, 382 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=6, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 42 PreInvPairs, 62 NumberOfFragments, 228 HoareAnnotationTreeSize, 42 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 530 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 447 ConstructedInterpolants, 0 QuantifiedInterpolants, 1174 SizeOfPredicates, 24 NumberOfNonLiveVariables, 745 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 400/420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((q * y + r == x && y <= 2) && 1 <= y) && b == a * y - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((q * y + r == x && y <= 2) && 1 <= r) && 1 <= y) && b == a * y RESULT: Ultimate proved your program to be correct! [2022-04-27 23:08:27,896 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...