/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-e106359-m [2022-04-15 02:07:01,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 02:07:01,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 02:07:02,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 02:07:02,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 02:07:02,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 02:07:02,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 02:07:02,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 02:07:02,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 02:07:02,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 02:07:02,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 02:07:02,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 02:07:02,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 02:07:02,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 02:07:02,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 02:07:02,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 02:07:02,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 02:07:02,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 02:07:02,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 02:07:02,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 02:07:02,033 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 02:07:02,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 02:07:02,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 02:07:02,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 02:07:02,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 02:07:02,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 02:07:02,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 02:07:02,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 02:07:02,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 02:07:02,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 02:07:02,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 02:07:02,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 02:07:02,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 02:07:02,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 02:07:02,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 02:07:02,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 02:07:02,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 02:07:02,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 02:07:02,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 02:07:02,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 02:07:02,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 02:07:02,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 02:07:02,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 02:07:02,072 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 02:07:02,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 02:07:02,073 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 02:07:02,073 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 02:07:02,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 02:07:02,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 02:07:02,074 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 02:07:02,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 02:07:02,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 02:07:02,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 02:07:02,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 02:07:02,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 02:07:02,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 02:07:02,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 02:07:02,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 02:07:02,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 02:07:02,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 02:07:02,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 02:07:02,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 02:07:02,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 02:07:02,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 02:07:02,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 02:07:02,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 02:07:02,077 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 02:07:02,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 02:07:02,077 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 02:07:02,077 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 02:07:02,077 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 02:07:02,078 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 02:07:02,078 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-15 02:07:02,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 02:07:02,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 02:07:02,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 02:07:02,258 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 02:07:02,260 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 02:07:02,261 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-15 02:07:02,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec4193584/80bcc59a281a42af93a527efa38f7dc1/FLAGf24c58a88 [2022-04-15 02:07:02,638 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 02:07:02,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound2.c [2022-04-15 02:07:02,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec4193584/80bcc59a281a42af93a527efa38f7dc1/FLAGf24c58a88 [2022-04-15 02:07:02,654 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec4193584/80bcc59a281a42af93a527efa38f7dc1 [2022-04-15 02:07:02,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 02:07:02,657 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 02:07:02,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 02:07:02,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 02:07:02,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 02:07:02,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:07:02" (1/1) ... [2022-04-15 02:07:02,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c1c4aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:02, skipping insertion in model container [2022-04-15 02:07:02,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:07:02" (1/1) ... [2022-04-15 02:07:02,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 02:07:02,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 02:07:02,807 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-15 02:07:02,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 02:07:02,836 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 02:07:02,844 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-15 02:07:02,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 02:07:02,860 INFO L208 MainTranslator]: Completed translation [2022-04-15 02:07:02,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:02 WrapperNode [2022-04-15 02:07:02,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 02:07:02,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 02:07:02,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 02:07:02,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 02:07:02,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:02" (1/1) ... [2022-04-15 02:07:02,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:02" (1/1) ... [2022-04-15 02:07:02,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:02" (1/1) ... [2022-04-15 02:07:02,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:02" (1/1) ... [2022-04-15 02:07:02,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:02" (1/1) ... [2022-04-15 02:07:02,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:02" (1/1) ... [2022-04-15 02:07:02,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:02" (1/1) ... [2022-04-15 02:07:02,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 02:07:02,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 02:07:02,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 02:07:02,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 02:07:02,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:02" (1/1) ... [2022-04-15 02:07:02,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 02:07:02,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:07:02,919 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-15 02:07:02,937 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-15 02:07:02,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 02:07:02,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 02:07:02,949 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 02:07:02,949 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 02:07:02,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 02:07:02,949 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 02:07:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 02:07:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 02:07:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 02:07:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 02:07:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 02:07:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 02:07:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 02:07:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 02:07:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 02:07:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 02:07:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 02:07:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 02:07:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 02:07:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 02:07:02,998 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 02:07:02,999 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 02:07:03,112 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 02:07:03,117 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 02:07:03,117 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 02:07:03,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:07:03 BoogieIcfgContainer [2022-04-15 02:07:03,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 02:07:03,119 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 02:07:03,119 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 02:07:03,120 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 02:07:03,122 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:07:03" (1/1) ... [2022-04-15 02:07:03,123 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 02:07:03,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 02:07:03 BasicIcfg [2022-04-15 02:07:03,161 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 02:07:03,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 02:07:03,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 02:07:03,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 02:07:03,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:07:02" (1/4) ... [2022-04-15 02:07:03,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76416a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:07:03, skipping insertion in model container [2022-04-15 02:07:03,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:02" (2/4) ... [2022-04-15 02:07:03,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76416a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:07:03, skipping insertion in model container [2022-04-15 02:07:03,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:07:03" (3/4) ... [2022-04-15 02:07:03,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76416a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:07:03, skipping insertion in model container [2022-04-15 02:07:03,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 02:07:03" (4/4) ... [2022-04-15 02:07:03,166 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound2.cqvasr [2022-04-15 02:07:03,169 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 02:07:03,169 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 02:07:03,214 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 02:07:03,219 INFO L340 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 [2022-04-15 02:07:03,219 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 02:07:03,238 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-15 02:07:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 02:07:03,242 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:07:03,243 INFO L499 BasicCegarLoop]: 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-15 02:07:03,244 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:07:03,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:07:03,251 INFO L85 PathProgramCache]: Analyzing trace with hash 795680375, now seen corresponding path program 1 times [2022-04-15 02:07:03,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:07:03,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318256713] [2022-04-15 02:07:03,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:03,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:07:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:03,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 02:07:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:03,471 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-15 02:07:03,472 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-15 02:07:03,472 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-15 02:07:03,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 02:07:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:03,478 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-15 02:07:03,478 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-15 02:07:03,478 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-15 02:07:03,478 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-15 02:07:03,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 02:07:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:03,483 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-15 02:07:03,483 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-15 02:07:03,483 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-15 02:07:03,484 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-15 02:07:03,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 02:07:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:03,492 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-15 02:07:03,493 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-15 02:07:03,493 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-15 02:07:03,493 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-15 02:07:03,494 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-15 02:07:03,494 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-15 02:07:03,494 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-15 02:07:03,495 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-15 02:07:03,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-15 02:07:03,495 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-15 02:07:03,495 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-15 02:07:03,495 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-15 02:07:03,496 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-15 02:07:03,496 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-15 02:07:03,496 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-15 02:07:03,496 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-15 02:07:03,496 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-15 02:07:03,496 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-15 02:07:03,497 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-15 02:07:03,497 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-15 02:07:03,497 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-15 02:07:03,497 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-15 02:07:03,497 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-15 02:07:03,498 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-15 02:07:03,498 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-15 02:07:03,498 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-15 02:07:03,498 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-15 02:07:03,499 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-15 02:07:03,499 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-15 02:07:03,499 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-15 02:07:03,499 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-15 02:07:03,499 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-15 02:07:03,500 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-15 02:07:03,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:07:03,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318256713] [2022-04-15 02:07:03,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318256713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:07:03,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:07:03,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 02:07:03,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331602650] [2022-04-15 02:07:03,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:07:03,506 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-15 02:07:03,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:07:03,509 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-15 02:07:03,553 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-15 02:07:03,556 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 02:07:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:07:03,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 02:07:03,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 02:07:03,574 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-15 02:07:03,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:03,738 INFO L93 Difference]: Finished difference Result 71 states and 110 transitions. [2022-04-15 02:07:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 02:07:03,739 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-15 02:07:03,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:07:03,743 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-15 02:07:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-15 02:07:03,757 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-15 02:07:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-15 02:07:03,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-04-15 02:07:03,893 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-15 02:07:03,904 INFO L225 Difference]: With dead ends: 71 [2022-04-15 02:07:03,904 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 02:07:03,907 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 02:07:03,912 INFO L913 BasicCegarLoop]: 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-15 02:07:03,913 INFO L914 BasicCegarLoop]: 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-15 02:07:03,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 02:07:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 02:07:03,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:07:03,945 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-15 02:07:03,946 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-15 02:07:03,947 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-15 02:07:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:03,961 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 02:07:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 02:07:03,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:03,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:03,962 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-15 02:07:03,963 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-15 02:07:03,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:03,965 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 02:07:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 02:07:03,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:03,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:03,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:07:03,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:07:03,967 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-15 02:07:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-15 02:07:03,970 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 28 [2022-04-15 02:07:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:07:03,970 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-15 02:07:03,973 INFO L479 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-15 02:07:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 02:07:03,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 02:07:03,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:07:03,974 INFO L499 BasicCegarLoop]: 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-15 02:07:03,974 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 02:07:03,974 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:07:03,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:07:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash 797557208, now seen corresponding path program 1 times [2022-04-15 02:07:03,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:07:03,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481780890] [2022-04-15 02:07:03,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:03,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:07:04,007 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:07:04,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1860142907] [2022-04-15 02:07:04,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:04,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:07:04,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:07:04,012 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-15 02:07:04,062 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-15 02:07:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:04,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 02:07:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:04,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:07:04,413 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-15 02:07:04,413 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-15 02:07:04,413 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-15 02:07:04,414 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-15 02:07:04,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {284#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {284#true} is VALID [2022-04-15 02:07:04,416 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-15 02:07:04,417 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-15 02:07:04,417 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-15 02:07:04,417 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-15 02:07:04,417 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-15 02:07:04,418 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-15 02:07:04,418 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-15 02:07:04,420 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-15 02:07:04,420 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-15 02:07:04,421 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-15 02:07:04,421 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-15 02:07:04,422 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-15 02:07:04,422 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-15 02:07:04,423 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-15 02:07:04,423 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-15 02:07:04,423 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-15 02:07:04,424 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-15 02:07:04,424 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-15 02:07:04,425 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-15 02:07:04,425 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-15 02:07:04,426 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-15 02:07:04,426 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-15 02:07:04,427 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-15 02:07:04,427 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-15 02:07:04,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:07:04,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:07:04,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481780890] [2022-04-15 02:07:04,428 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:07:04,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860142907] [2022-04-15 02:07:04,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860142907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:07:04,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:07:04,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 02:07:04,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254423542] [2022-04-15 02:07:04,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:07:04,434 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-15 02:07:04,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:07:04,434 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-15 02:07:04,450 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-15 02:07:04,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 02:07:04,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:07:04,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 02:07:04,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 02:07:04,452 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-15 02:07:04,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:04,821 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 02:07:04,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 02:07:04,821 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-15 02:07:04,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:07:04,822 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-15 02:07:04,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-15 02:07:04,824 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-15 02:07:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-15 02:07:04,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-15 02:07:04,864 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-15 02:07:04,865 INFO L225 Difference]: With dead ends: 45 [2022-04-15 02:07:04,866 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 02:07:04,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 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-15 02:07:04,867 INFO L913 BasicCegarLoop]: 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-15 02:07:04,867 INFO L914 BasicCegarLoop]: 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-15 02:07:04,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 02:07:04,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-15 02:07:04,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:07:04,883 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-15 02:07:04,884 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-15 02:07:04,884 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-15 02:07:04,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:04,886 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-15 02:07:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-15 02:07:04,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:04,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:04,888 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-15 02:07:04,888 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-15 02:07:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:04,890 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-15 02:07:04,890 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-15 02:07:04,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:04,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:04,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:07:04,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:07:04,892 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-15 02:07:04,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-15 02:07:04,894 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 28 [2022-04-15 02:07:04,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:07:04,894 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-15 02:07:04,894 INFO L479 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-15 02:07:04,894 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-15 02:07:04,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 02:07:04,895 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:07:04,895 INFO L499 BasicCegarLoop]: 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-15 02:07:04,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 02:07:05,101 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:07:05,102 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:07:05,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:07:05,102 INFO L85 PathProgramCache]: Analyzing trace with hash 648866686, now seen corresponding path program 1 times [2022-04-15 02:07:05,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:07:05,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904388715] [2022-04-15 02:07:05,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:07:05,121 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:07:05,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633056368] [2022-04-15 02:07:05,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:05,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:07:05,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:07:05,125 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-15 02:07:05,125 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-15 02:07:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:05,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 02:07:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:05,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:07:05,393 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-15 02:07:05,393 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-15 02:07:05,394 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-15 02:07:05,394 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-15 02:07:05,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {595#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {595#true} is VALID [2022-04-15 02:07:05,394 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-15 02:07:05,394 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-15 02:07:05,394 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-15 02:07:05,395 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-15 02:07:05,395 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-15 02:07:05,395 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-15 02:07:05,395 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-15 02:07:05,395 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-15 02:07:05,396 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-15 02:07:05,396 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-15 02:07:05,396 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-15 02:07:05,397 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-15 02:07:05,397 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-15 02:07:05,398 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-15 02:07:05,398 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-15 02:07:05,398 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-15 02:07:05,399 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-15 02:07:05,400 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-15 02:07:05,400 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-15 02:07:05,400 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-15 02:07:05,400 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-15 02:07:05,401 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-15 02:07:05,401 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-15 02:07:05,401 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-15 02:07:05,402 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-15 02:07:05,403 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-15 02:07:05,403 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-15 02:07:05,403 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-15 02:07:05,403 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-15 02:07:05,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:07:05,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:07:05,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904388715] [2022-04-15 02:07:05,404 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:07:05,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633056368] [2022-04-15 02:07:05,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633056368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:07:05,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:07:05,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 02:07:05,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530485147] [2022-04-15 02:07:05,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:07:05,405 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-15 02:07:05,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:07:05,405 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-15 02:07:05,425 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-15 02:07:05,425 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 02:07:05,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:07:05,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 02:07:05,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 02:07:05,426 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-15 02:07:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:05,821 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-15 02:07:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 02:07:05,821 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-15 02:07:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:07:05,822 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-15 02:07:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-15 02:07:05,823 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-15 02:07:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-15 02:07:05,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-04-15 02:07:05,882 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-15 02:07:05,884 INFO L225 Difference]: With dead ends: 57 [2022-04-15 02:07:05,885 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 02:07:05,885 INFO L912 BasicCegarLoop]: 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-15 02:07:05,886 INFO L913 BasicCegarLoop]: 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-15 02:07:05,886 INFO L914 BasicCegarLoop]: 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-15 02:07:05,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 02:07:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-15 02:07:05,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:07:05,908 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-15 02:07:05,908 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-15 02:07:05,909 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-15 02:07:05,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:05,911 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-15 02:07:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-15 02:07:05,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:05,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:05,912 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-15 02:07:05,913 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-15 02:07:05,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:05,916 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-15 02:07:05,916 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-15 02:07:05,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:05,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:05,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:07:05,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:07:05,918 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-15 02:07:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-15 02:07:05,920 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 33 [2022-04-15 02:07:05,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:07:05,920 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-04-15 02:07:05,920 INFO L479 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-15 02:07:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-15 02:07:05,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 02:07:05,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:07:05,921 INFO L499 BasicCegarLoop]: 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-15 02:07:05,953 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-15 02:07:06,121 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 02:07:06,122 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:07:06,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:07:06,122 INFO L85 PathProgramCache]: Analyzing trace with hash 619469170, now seen corresponding path program 1 times [2022-04-15 02:07:06,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:07:06,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213711377] [2022-04-15 02:07:06,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:06,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:07:06,138 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:07:06,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1097033015] [2022-04-15 02:07:06,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:06,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:07:06,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:07:06,140 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-15 02:07:06,144 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-15 02:07:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:06,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 02:07:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:06,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:07:06,493 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-15 02:07:06,493 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-15 02:07:06,494 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-15 02:07:06,494 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-15 02:07:06,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {981#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-15 02:07:06,494 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-15 02:07:06,494 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-15 02:07:06,495 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-15 02:07:06,495 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-15 02:07:06,495 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-15 02:07:06,496 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-15 02:07:06,497 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-15 02:07:06,497 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-15 02:07:06,497 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-15 02:07:06,498 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-15 02:07:06,498 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-15 02:07:06,500 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-15 02:07:06,500 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-15 02:07:06,502 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-15 02:07:06,503 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-15 02:07:06,503 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-15 02:07:06,504 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-15 02:07:06,511 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-15 02:07:06,512 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-15 02:07:06,512 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-15 02:07:06,512 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-15 02:07:06,512 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-15 02:07:06,513 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-15 02:07:06,513 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-15 02:07:06,513 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-15 02:07:06,513 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-15 02:07:06,514 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-15 02:07:06,514 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-15 02:07:06,514 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-15 02:07:06,515 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-15 02:07:06,515 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-15 02:07:06,516 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-15 02:07:06,516 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-15 02:07:06,517 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-15 02:07:06,517 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-15 02:07:06,517 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-15 02:07:06,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:07:06,793 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-15 02:07:06,794 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-15 02:07:06,794 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-15 02:07:06,795 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-15 02:07:06,795 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-15 02:07:06,796 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-15 02:07:06,796 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-15 02:07:06,796 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-15 02:07:06,796 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-15 02:07:06,796 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-15 02:07:06,796 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-15 02:07:06,796 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-15 02:07:06,797 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-15 02:07:06,797 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-15 02:07:06,797 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-15 02:07:06,797 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-15 02:07:06,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {981#true} [118] L38-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-15 02:07:06,797 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-15 02:07:06,797 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-15 02:07:06,798 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-15 02:07:06,798 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-15 02:07:06,798 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-15 02:07:06,798 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-15 02:07:06,798 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-15 02:07:06,799 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-15 02:07:06,799 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-15 02:07:06,799 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-15 02:07:06,799 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-15 02:07:06,799 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-15 02:07:06,799 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-15 02:07:06,799 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-15 02:07:06,800 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-15 02:07:06,800 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-15 02:07:06,800 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-15 02:07:06,801 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-15 02:07:06,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {981#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-15 02:07:06,801 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-15 02:07:06,801 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-15 02:07:06,801 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-15 02:07:06,801 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-15 02:07:06,802 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-15 02:07:06,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:07:06,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213711377] [2022-04-15 02:07:06,802 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:07:06,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097033015] [2022-04-15 02:07:06,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097033015] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 02:07:06,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 02:07:06,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-15 02:07:06,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594200982] [2022-04-15 02:07:06,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:07:06,805 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-15 02:07:06,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:07:06,805 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-15 02:07:06,826 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-15 02:07:06,826 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:07:06,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:07:06,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:07:06,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-15 02:07:06,828 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-15 02:07:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:07,015 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-04-15 02:07:07,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:07:07,015 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-15 02:07:07,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:07:07,016 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-15 02:07:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 02:07:07,017 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-15 02:07:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 02:07:07,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-15 02:07:07,052 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-15 02:07:07,053 INFO L225 Difference]: With dead ends: 59 [2022-04-15 02:07:07,053 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 02:07:07,054 INFO L912 BasicCegarLoop]: 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-15 02:07:07,054 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 02:07:07,054 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 102 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 02:07:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 02:07:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-15 02:07:07,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:07:07,094 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-15 02:07:07,094 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-15 02:07:07,094 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-15 02:07:07,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:07,105 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-04-15 02:07:07,105 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-15 02:07:07,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:07,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:07,106 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-15 02:07:07,106 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-15 02:07:07,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:07,108 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-04-15 02:07:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-15 02:07:07,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:07,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:07,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:07:07,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:07:07,109 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-15 02:07:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-04-15 02:07:07,111 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 40 [2022-04-15 02:07:07,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:07:07,111 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-04-15 02:07:07,112 INFO L479 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-15 02:07:07,112 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-15 02:07:07,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 02:07:07,112 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:07:07,113 INFO L499 BasicCegarLoop]: 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-15 02:07:07,129 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-15 02:07:07,326 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:07:07,326 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:07:07,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:07:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash -574143214, now seen corresponding path program 1 times [2022-04-15 02:07:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:07:07,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924306720] [2022-04-15 02:07:07,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:07,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:07:07,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:07:07,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979008666] [2022-04-15 02:07:07,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:07,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:07:07,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:07:07,363 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-15 02:07:07,364 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-15 02:07:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:07,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 02:07:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:07,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:07:07,584 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-15 02:07:07,584 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-15 02:07:07,585 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-15 02:07:07,585 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-15 02:07:07,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {1521#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1521#true} is VALID [2022-04-15 02:07:07,585 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-15 02:07:07,585 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-15 02:07:07,585 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-15 02:07:07,585 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-15 02:07:07,585 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-15 02:07:07,586 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-15 02:07:07,586 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-15 02:07:07,586 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-15 02:07:07,586 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-15 02:07:07,586 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-15 02:07:07,586 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-15 02:07:07,586 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-15 02:07:07,586 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-15 02:07:07,587 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-15 02:07:07,587 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-15 02:07:07,588 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-15 02:07:07,588 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-15 02:07:07,588 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-15 02:07:07,589 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-15 02:07:07,589 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-15 02:07:07,589 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-15 02:07:07,589 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-15 02:07:07,589 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-15 02:07:07,590 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-15 02:07:07,590 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-15 02:07:07,590 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-15 02:07:07,590 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-15 02:07:07,590 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-15 02:07:07,591 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-15 02:07:07,591 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-15 02:07:07,592 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-15 02:07:07,592 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-15 02:07:07,592 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-15 02:07:07,592 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-15 02:07:07,592 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-15 02:07:07,594 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-15 02:07:07,594 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-15 02:07:07,594 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-15 02:07:07,594 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-15 02:07:07,594 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-15 02:07:07,595 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-15 02:07:07,595 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-15 02:07:07,596 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-15 02:07:07,596 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-15 02:07:07,596 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-15 02:07:07,597 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-15 02:07:07,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:07:07,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:07:07,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924306720] [2022-04-15 02:07:07,597 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:07:07,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979008666] [2022-04-15 02:07:07,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979008666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:07:07,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:07:07,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 02:07:07,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293972597] [2022-04-15 02:07:07,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:07:07,598 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-15 02:07:07,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:07:07,598 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-15 02:07:07,624 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-15 02:07:07,624 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 02:07:07,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:07:07,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 02:07:07,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 02:07:07,625 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-15 02:07:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:07,917 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-15 02:07:07,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 02:07:07,918 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-15 02:07:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:07:07,918 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-15 02:07:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-15 02:07:07,919 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-15 02:07:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-15 02:07:07,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-15 02:07:07,960 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-15 02:07:07,962 INFO L225 Difference]: With dead ends: 63 [2022-04-15 02:07:07,962 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 02:07:07,963 INFO L912 BasicCegarLoop]: 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-15 02:07:07,963 INFO L913 BasicCegarLoop]: 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-15 02:07:07,963 INFO L914 BasicCegarLoop]: 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-15 02:07:07,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 02:07:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-15 02:07:07,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:07:07,997 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-15 02:07:07,997 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-15 02:07:07,997 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-15 02:07:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:08,000 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-15 02:07:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-15 02:07:08,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:08,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:08,001 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-15 02:07:08,001 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-15 02:07:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:08,003 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-15 02:07:08,003 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-15 02:07:08,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:08,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:08,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:07:08,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:07:08,004 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-15 02:07:08,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-04-15 02:07:08,007 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 50 [2022-04-15 02:07:08,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:07:08,007 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-04-15 02:07:08,007 INFO L479 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-15 02:07:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-15 02:07:08,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 02:07:08,008 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:07:08,008 INFO L499 BasicCegarLoop]: 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-15 02:07:08,046 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-15 02:07:08,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:07:08,231 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:07:08,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:07:08,231 INFO L85 PathProgramCache]: Analyzing trace with hash -810208713, now seen corresponding path program 1 times [2022-04-15 02:07:08,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:07:08,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830711369] [2022-04-15 02:07:08,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:08,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:07:08,247 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:07:08,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50732978] [2022-04-15 02:07:08,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:08,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:07:08,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:07:08,248 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-15 02:07:08,255 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-15 02:07:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:08,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 02:07:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:08,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:07:08,537 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-15 02:07:08,537 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-15 02:07:08,537 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-15 02:07:08,537 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-15 02:07:08,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {1990#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-15 02:07:08,538 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-15 02:07:08,538 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-15 02:07:08,538 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-15 02:07:08,538 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-15 02:07:08,538 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-15 02:07:08,538 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-15 02:07:08,538 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-15 02:07:08,538 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-15 02:07:08,539 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-15 02:07:08,539 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-15 02:07:08,539 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-15 02:07:08,539 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-15 02:07:08,539 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-15 02:07:08,539 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-15 02:07:08,539 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-15 02:07:08,539 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-15 02:07:08,540 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-15 02:07:08,540 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-15 02:07:08,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {1990#true} [118] L38-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-15 02:07:08,540 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-15 02:07:08,540 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-15 02:07:08,540 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-15 02:07:08,540 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-15 02:07:08,540 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-15 02:07:08,540 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-15 02:07:08,541 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-15 02:07:08,541 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-15 02:07:08,541 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-15 02:07:08,541 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-15 02:07:08,541 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-15 02:07:08,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {1990#true} [134] L47-2-->L48: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-15 02:07:08,541 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-15 02:07:08,544 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-15 02:07:08,544 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-15 02:07:08,544 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-15 02:07:08,545 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-15 02:07:08,545 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-15 02:07:08,545 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-15 02:07:08,545 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-15 02:07:08,545 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-15 02:07:08,546 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-15 02:07:08,546 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-15 02:07:08,546 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-15 02:07:08,546 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-15 02:07:08,546 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-15 02:07:08,547 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-15 02:07:08,548 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-15 02:07:08,548 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-15 02:07:08,548 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-15 02:07:08,549 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-15 02:07:08,549 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-15 02:07:08,549 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-15 02:07:08,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:07:16,976 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-15 02:07:16,976 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-15 02:07:16,977 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-15 02:07:16,978 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-15 02:07:16,978 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-15 02:07:16,979 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-15 02:07:16,979 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-15 02:07:16,979 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-15 02:07:16,979 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-15 02:07:16,979 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-15 02:07:16,980 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-15 02:07:16,980 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-15 02:07:16,980 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-15 02:07:16,981 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-15 02:07:16,981 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-15 02:07:16,982 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-15 02:07:16,982 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-15 02:07:16,983 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-15 02:07:16,983 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-15 02:07:16,983 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-15 02:07:16,983 INFO L290 TraceCheckUtils]: 35: Hoare triple {1990#true} [134] L47-2-->L48: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-15 02:07:16,983 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-15 02:07:16,984 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-15 02:07:16,984 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-15 02:07:16,984 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-15 02:07:16,984 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-15 02:07:16,984 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-15 02:07:16,984 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-15 02:07:16,984 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-15 02:07:16,985 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-15 02:07:16,985 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-15 02:07:16,985 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-15 02:07:16,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {1990#true} [118] L38-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-15 02:07:16,985 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-15 02:07:16,985 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-15 02:07:16,985 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-15 02:07:16,986 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-15 02:07:16,986 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-15 02:07:16,986 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-15 02:07:16,986 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-15 02:07:16,986 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-15 02:07:16,986 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-15 02:07:16,986 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-15 02:07:16,987 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-15 02:07:16,987 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-15 02:07:16,987 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-15 02:07:16,987 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-15 02:07:16,987 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-15 02:07:16,987 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-15 02:07:16,987 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-15 02:07:16,988 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-15 02:07:16,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {1990#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1990#true} is VALID [2022-04-15 02:07:16,988 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-15 02:07:16,988 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-15 02:07:16,988 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-15 02:07:16,988 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-15 02:07:16,989 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-15 02:07:16,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:07:16,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830711369] [2022-04-15 02:07:16,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:07:16,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50732978] [2022-04-15 02:07:16,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50732978] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:07:16,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 02:07:16,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 02:07:16,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114560599] [2022-04-15 02:07:16,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 02:07:16,990 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-15 02:07:16,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:07:16,991 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-15 02:07:17,023 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-15 02:07:17,023 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 02:07:17,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:07:17,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 02:07:17,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 02:07:17,024 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-15 02:07:17,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:17,406 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-15 02:07:17,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 02:07:17,407 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-15 02:07:17,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:07:17,407 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-15 02:07:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-15 02:07:17,408 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-15 02:07:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-15 02:07:17,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-15 02:07:17,451 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-15 02:07:17,452 INFO L225 Difference]: With dead ends: 67 [2022-04-15 02:07:17,452 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 02:07:17,453 INFO L912 BasicCegarLoop]: 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-15 02:07:17,453 INFO L913 BasicCegarLoop]: 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-15 02:07:17,453 INFO L914 BasicCegarLoop]: 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-15 02:07:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 02:07:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 02:07:17,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:07:17,486 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-15 02:07:17,486 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-15 02:07:17,486 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-15 02:07:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:17,488 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-15 02:07:17,488 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-15 02:07:17,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:17,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:17,489 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-15 02:07:17,489 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-15 02:07:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:17,491 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-15 02:07:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-15 02:07:17,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:17,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:17,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:07:17,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:07:17,495 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-15 02:07:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-04-15 02:07:17,497 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 56 [2022-04-15 02:07:17,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:07:17,498 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-04-15 02:07:17,498 INFO L479 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-15 02:07:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-15 02:07:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 02:07:17,499 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:07:17,499 INFO L499 BasicCegarLoop]: 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-15 02:07:17,517 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-15 02:07:17,717 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:07:17,717 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:07:17,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:07:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1603019557, now seen corresponding path program 1 times [2022-04-15 02:07:17,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:07:17,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671810614] [2022-04-15 02:07:17,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:17,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:07:17,729 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:07:17,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1698314421] [2022-04-15 02:07:17,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:17,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:07:17,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:07:17,730 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-15 02:07:17,740 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-15 02:07:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:17,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 02:07:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:17,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:07:18,160 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-15 02:07:18,160 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-15 02:07:18,160 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-15 02:07:18,160 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-15 02:07:18,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {2665#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-15 02:07:18,161 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-15 02:07:18,161 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-15 02:07:18,161 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-15 02:07:18,161 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-15 02:07:18,161 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-15 02:07:18,161 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-15 02:07:18,161 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-15 02:07:18,162 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-15 02:07:18,162 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-15 02:07:18,162 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-15 02:07:18,162 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-15 02:07:18,162 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-15 02:07:18,162 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-15 02:07:18,162 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-15 02:07:18,162 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-15 02:07:18,162 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-15 02:07:18,163 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-15 02:07:18,163 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-15 02:07:18,163 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-15 02:07:18,163 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-15 02:07:18,164 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-15 02:07:18,164 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-15 02:07:18,165 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-15 02:07:18,168 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-15 02:07:18,169 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-15 02:07:18,169 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-15 02:07:18,169 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-15 02:07:18,170 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-15 02:07:18,170 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-15 02:07:18,172 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-15 02:07:18,174 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-15 02:07:18,174 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-15 02:07:18,177 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-15 02:07:18,177 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-15 02:07:18,177 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-15 02:07:18,178 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-15 02:07:18,178 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-15 02:07:18,178 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-15 02:07:18,178 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-15 02:07:18,178 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-15 02:07:18,178 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-15 02:07:18,179 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-15 02:07:18,179 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-15 02:07:18,179 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-15 02:07:18,179 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-15 02:07:18,182 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-15 02:07:18,183 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-15 02:07:18,184 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-15 02:07:18,184 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-15 02:07:18,184 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-15 02:07:18,184 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-15 02:07:18,184 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-15 02:07:18,184 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-15 02:07:18,185 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-15 02:07:18,186 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-15 02:07:18,186 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-15 02:07:18,186 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-15 02:07:18,187 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-15 02:07:18,187 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-15 02:07:18,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:07:18,513 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-15 02:07:18,514 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-15 02:07:18,514 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-15 02:07:18,514 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-15 02:07:18,515 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-15 02:07:18,515 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-15 02:07:18,515 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-15 02:07:18,515 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-15 02:07:18,515 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-15 02:07:18,516 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-15 02:07:18,524 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-15 02:07:18,524 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-15 02:07:18,525 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-15 02:07:18,525 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-15 02:07:18,525 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-15 02:07:18,525 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-15 02:07:18,525 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-15 02:07:18,526 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-15 02:07:18,529 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-15 02:07:18,530 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-15 02:07:18,530 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-15 02:07:18,530 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-15 02:07:18,531 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-15 02:07:18,531 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-15 02:07:18,531 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-15 02:07:18,531 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-15 02:07:18,531 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-15 02:07:18,532 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-15 02:07:18,532 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-15 02:07:18,533 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-15 02:07:18,533 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-15 02:07:18,533 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-15 02:07:18,533 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-15 02:07:18,533 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-15 02:07:18,534 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-15 02:07:18,534 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-15 02:07:18,534 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-15 02:07:18,534 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-15 02:07:18,534 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-15 02:07:18,535 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-15 02:07:18,535 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-15 02:07:18,535 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-15 02:07:18,535 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-15 02:07:18,535 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-15 02:07:18,536 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-15 02:07:18,536 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-15 02:07:18,536 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-15 02:07:18,536 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-15 02:07:18,536 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-15 02:07:18,536 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-15 02:07:18,536 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-15 02:07:18,536 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-15 02:07:18,536 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-15 02:07:18,536 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-15 02:07:18,537 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-15 02:07:18,537 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-15 02:07:18,537 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-15 02:07:18,537 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-15 02:07:18,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {2665#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#true} is VALID [2022-04-15 02:07:18,537 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-15 02:07:18,537 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-15 02:07:18,537 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-15 02:07:18,537 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-15 02:07:18,538 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-15 02:07:18,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:07:18,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671810614] [2022-04-15 02:07:18,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:07:18,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698314421] [2022-04-15 02:07:18,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698314421] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 02:07:18,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 02:07:18,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2022-04-15 02:07:18,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549582815] [2022-04-15 02:07:18,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:07:18,541 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-15 02:07:18,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:07:18,541 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-15 02:07:18,577 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-15 02:07:18,578 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 02:07:18,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:07:18,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 02:07:18,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-04-15 02:07:18,578 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-15 02:07:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:19,045 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-15 02:07:19,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:07:19,045 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-15 02:07:19,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:07:19,045 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-15 02:07:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-15 02:07:19,046 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-15 02:07:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-15 02:07:19,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-04-15 02:07:19,093 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-15 02:07:19,093 INFO L225 Difference]: With dead ends: 65 [2022-04-15 02:07:19,093 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 02:07:19,094 INFO L912 BasicCegarLoop]: 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-15 02:07:19,094 INFO L913 BasicCegarLoop]: 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-15 02:07:19,095 INFO L914 BasicCegarLoop]: 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-15 02:07:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 02:07:19,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 02:07:19,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:07:19,095 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-15 02:07:19,095 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-15 02:07:19,095 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-15 02:07:19,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:19,096 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 02:07:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 02:07:19,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:19,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:19,096 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-15 02:07:19,096 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-15 02:07:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:19,096 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 02:07:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 02:07:19,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:19,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:19,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:07:19,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:07:19,097 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-15 02:07:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 02:07:19,097 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2022-04-15 02:07:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:07:19,097 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 02:07:19,097 INFO L479 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-15 02:07:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 02:07:19,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:19,099 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 02:07:19,121 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-15 02:07:19,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:07:19,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 02:07:19,705 INFO L878 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-15 02:07:19,705 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 02:07:19,705 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 02:07:19,705 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 02:07:19,705 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 02:07:19,706 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 02:07:19,706 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 02:07:19,706 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-15 02:07:19,706 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-15 02:07:19,706 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-15 02:07:19,706 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-15 02:07:19,706 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 66) the Hoare annotation is: true [2022-04-15 02:07:19,706 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-15 02:07:19,706 INFO L882 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-04-15 02:07:19,706 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-15 02:07:19,707 INFO L878 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (and (<= 0 main_~y~0) (<= main_~y~0 2)) [2022-04-15 02:07:19,707 INFO L882 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-04-15 02:07:19,707 INFO L878 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-15 02:07:19,707 INFO L878 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-15 02:07:19,707 INFO L878 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-15 02:07:19,707 INFO L882 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2022-04-15 02:07:19,707 INFO L878 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-15 02:07:19,707 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 22 66) no Hoare annotation was computed. [2022-04-15 02:07:19,707 INFO L882 garLoopResultBuilder]: For program point L40(lines 38 62) no Hoare annotation was computed. [2022-04-15 02:07:19,707 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 22 66) no Hoare annotation was computed. [2022-04-15 02:07:19,708 INFO L878 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-15 02:07:19,708 INFO L882 garLoopResultBuilder]: For program point L47-3(lines 47 59) no Hoare annotation was computed. [2022-04-15 02:07:19,708 INFO L878 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-15 02:07:19,708 INFO L878 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-15 02:07:19,708 INFO L878 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-15 02:07:19,708 INFO L882 garLoopResultBuilder]: For program point L50(lines 47 59) no Hoare annotation was computed. [2022-04-15 02:07:19,708 INFO L882 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2022-04-15 02:07:19,708 INFO L878 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-15 02:07:19,708 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-15 02:07:19,708 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-15 02:07:19,708 INFO L882 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-15 02:07:19,708 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-15 02:07:19,709 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-15 02:07:19,709 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-15 02:07:19,711 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:07:19,712 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 02:07:19,715 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 02:07:19,715 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 02:07:19,715 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 02:07:19,715 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 02:07:19,715 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 02:07:19,715 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:07:19,716 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-15 02:07:19,717 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-15 02:07:19,717 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 02:07:19,717 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 02:07:19,717 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-15 02:07:19,717 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-15 02:07:19,717 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2022-04-15 02:07:19,717 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-04-15 02:07:19,719 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-15 02:07:19,719 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-15 02:07:19,720 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-15 02:07:19,720 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 02:07:19,720 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 02:07:19,720 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 02:07:19,720 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-15 02:07:19,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:07:19 BasicIcfg [2022-04-15 02:07:19,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 02:07:19,731 INFO L158 Benchmark]: Toolchain (without parser) took 17074.71ms. Allocated memory was 174.1MB in the beginning and 251.7MB in the end (delta: 77.6MB). Free memory was 115.6MB in the beginning and 141.9MB in the end (delta: -26.4MB). Peak memory consumption was 52.1MB. Max. memory is 8.0GB. [2022-04-15 02:07:19,732 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 174.1MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 02:07:19,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.00ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 115.4MB in the beginning and 180.7MB in the end (delta: -65.2MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-04-15 02:07:19,732 INFO L158 Benchmark]: Boogie Preprocessor took 35.66ms. Allocated memory is still 209.7MB. Free memory was 180.7MB in the beginning and 179.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 02:07:19,732 INFO L158 Benchmark]: RCFGBuilder took 220.17ms. Allocated memory is still 209.7MB. Free memory was 179.1MB in the beginning and 166.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 02:07:19,732 INFO L158 Benchmark]: IcfgTransformer took 41.83ms. Allocated memory is still 209.7MB. Free memory was 166.5MB in the beginning and 164.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 02:07:19,733 INFO L158 Benchmark]: TraceAbstraction took 16568.58ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 163.9MB in the beginning and 141.9MB in the end (delta: 22.0MB). Peak memory consumption was 64.4MB. Max. memory is 8.0GB. [2022-04-15 02:07:19,735 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.16ms. Allocated memory is still 174.1MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 204.00ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 115.4MB in the beginning and 180.7MB in the end (delta: -65.2MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.66ms. Allocated memory is still 209.7MB. Free memory was 180.7MB in the beginning and 179.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 220.17ms. Allocated memory is still 209.7MB. Free memory was 179.1MB in the beginning and 166.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 41.83ms. Allocated memory is still 209.7MB. Free memory was 166.5MB in the beginning and 164.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 16568.58ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 163.9MB in the beginning and 141.9MB in the end (delta: 22.0MB). Peak memory consumption was 64.4MB. 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.5s, OverallIterations: 7, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 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.3s 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.9s 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-15 02:07:19,763 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...