/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/egcd2-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 23:43:29,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 23:43:29,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 23:43:29,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 23:43:29,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 23:43:29,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 23:43:29,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 23:43:29,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 23:43:29,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 23:43:29,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 23:43:29,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 23:43:29,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 23:43:29,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 23:43:29,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 23:43:29,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 23:43:29,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 23:43:29,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 23:43:29,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 23:43:29,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 23:43:29,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 23:43:29,890 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 23:43:29,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 23:43:29,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 23:43:29,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 23:43:29,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 23:43:29,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 23:43:29,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 23:43:29,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 23:43:29,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 23:43:29,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 23:43:29,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 23:43:29,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 23:43:29,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 23:43:29,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 23:43:29,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 23:43:29,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 23:43:29,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 23:43:29,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 23:43:29,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 23:43:29,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 23:43:29,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 23:43:29,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 23:43:29,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 23:43:29,925 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 23:43:29,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 23:43:29,925 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 23:43:29,925 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 23:43:29,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 23:43:29,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 23:43:29,926 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 23:43:29,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 23:43:29,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 23:43:29,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 23:43:29,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 23:43:29,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 23:43:29,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 23:43:29,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 23:43:29,927 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 23:43:29,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 23:43:29,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 23:43:29,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 23:43:29,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 23:43:29,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:43:29,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 23:43:29,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 23:43:29,927 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 23:43:29,927 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 23:43:29,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 23:43:29,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 23:43:29,928 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 23:43:29,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 23:43:29,928 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 23:43:29,928 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 23:43:30,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 23:43:30,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 23:43:30,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 23:43:30,085 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 23:43:30,086 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 23:43:30,086 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound2.c [2022-04-27 23:43:30,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894b1c0b4/720cf34951f041db9f22cde338d42d8f/FLAG931941742 [2022-04-27 23:43:30,457 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 23:43:30,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound2.c [2022-04-27 23:43:30,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894b1c0b4/720cf34951f041db9f22cde338d42d8f/FLAG931941742 [2022-04-27 23:43:30,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894b1c0b4/720cf34951f041db9f22cde338d42d8f [2022-04-27 23:43:30,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 23:43:30,919 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 23:43:30,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 23:43:30,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 23:43:30,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 23:43:30,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:43:30" (1/1) ... [2022-04-27 23:43:30,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f9ecb2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:30, skipping insertion in model container [2022-04-27 23:43:30,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:43:30" (1/1) ... [2022-04-27 23:43:30,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 23:43:30,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 23:43:31,051 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/egcd2-ll_unwindbound2.c[490,503] [2022-04-27 23:43:31,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:43:31,082 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 23:43:31,089 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/egcd2-ll_unwindbound2.c[490,503] [2022-04-27 23:43:31,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:43:31,105 INFO L208 MainTranslator]: Completed translation [2022-04-27 23:43:31,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:31 WrapperNode [2022-04-27 23:43:31,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 23:43:31,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 23:43:31,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 23:43:31,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 23:43:31,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:31" (1/1) ... [2022-04-27 23:43:31,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:31" (1/1) ... [2022-04-27 23:43:31,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:31" (1/1) ... [2022-04-27 23:43:31,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:31" (1/1) ... [2022-04-27 23:43:31,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:31" (1/1) ... [2022-04-27 23:43:31,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:31" (1/1) ... [2022-04-27 23:43:31,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:31" (1/1) ... [2022-04-27 23:43:31,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 23:43:31,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 23:43:31,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 23:43:31,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 23:43:31,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:31" (1/1) ... [2022-04-27 23:43:31,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:43:31,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:43:31,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 23:43:31,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 23:43:31,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 23:43:31,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 23:43:31,183 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 23:43:31,183 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 23:43:31,183 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 23:43:31,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 23:43:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 23:43:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 23:43:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 23:43:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 23:43:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 23:43:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 23:43:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 23:43:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 23:43:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 23:43:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 23:43:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 23:43:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 23:43:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 23:43:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 23:43:31,226 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 23:43:31,227 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 23:43:31,362 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 23:43:31,377 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 23:43:31,377 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 23:43:31,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:43:31 BoogieIcfgContainer [2022-04-27 23:43:31,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 23:43:31,379 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 23:43:31,379 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 23:43:31,380 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 23:43:31,382 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:43:31" (1/1) ... [2022-04-27 23:43:31,383 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 23:43:31,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:43:31 BasicIcfg [2022-04-27 23:43:31,434 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 23:43:31,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 23:43:31,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 23:43:31,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 23:43:31,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:43:30" (1/4) ... [2022-04-27 23:43:31,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9cbf5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:43:31, skipping insertion in model container [2022-04-27 23:43:31,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:31" (2/4) ... [2022-04-27 23:43:31,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9cbf5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:43:31, skipping insertion in model container [2022-04-27 23:43:31,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:43:31" (3/4) ... [2022-04-27 23:43:31,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9cbf5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:43:31, skipping insertion in model container [2022-04-27 23:43:31,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:43:31" (4/4) ... [2022-04-27 23:43:31,441 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound2.cqvasr [2022-04-27 23:43:31,450 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 23:43:31,450 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 23:43:31,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 23:43:31,487 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@71afce40, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c91277d [2022-04-27 23:43:31,487 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 23:43:31,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 23:43:31,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 23:43:31,497 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:43:31,497 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:43:31,497 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:43:31,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:43:31,501 INFO L85 PathProgramCache]: Analyzing trace with hash -282167495, now seen corresponding path program 1 times [2022-04-27 23:43:31,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:43:31,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748240589] [2022-04-27 23:43:31,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:43:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:43:31,571 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:43:31,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [61797738] [2022-04-27 23:43:31,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:43:31,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:43:31,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:43:31,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:43:31,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 23:43:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:43:31,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 23:43:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:43:31,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:43:31,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:43:31,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {42#true} is VALID [2022-04-27 23:43:31,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:43:31,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:43:31,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:43:31,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {42#true} is VALID [2022-04-27 23:43:31,778 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:43:31,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 23:43:31,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:43:31,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:43:31,779 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#true} {42#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:43:31,779 INFO L272 TraceCheckUtils]: 11: Hoare triple {42#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:43:31,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 23:43:31,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:43:31,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:43:31,780 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#true} {42#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:43:31,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#true} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {42#true} is VALID [2022-04-27 23:43:31,781 INFO L272 TraceCheckUtils]: 17: Hoare triple {42#true} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:43:31,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 23:43:31,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:43:31,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:43:31,782 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {42#true} {42#true} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:43:31,783 INFO L272 TraceCheckUtils]: 22: Hoare triple {42#true} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:43:31,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 23:43:31,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:43:31,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:43:31,784 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {42#true} {42#true} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:43:31,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {42#true} [116] L40-2-->L40-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:43:31,785 INFO L272 TraceCheckUtils]: 28: Hoare triple {43#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {43#false} is VALID [2022-04-27 23:43:31,786 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {43#false} is VALID [2022-04-27 23:43:31,786 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:43:31,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:43:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 23:43:31,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:43:31,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:43:31,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748240589] [2022-04-27 23:43:31,788 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:43:31,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61797738] [2022-04-27 23:43:31,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61797738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:43:31,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:43:31,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 23:43:31,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079195022] [2022-04-27 23:43:31,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:43:31,796 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-04-27 23:43:31,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:43:31,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 23:43:31,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:43:31,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 23:43:31,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:43:31,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 23:43:31,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 23:43:31,860 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 23:43:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:31,934 INFO L93 Difference]: Finished difference Result 71 states and 110 transitions. [2022-04-27 23:43:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 23:43:31,934 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-04-27 23:43:31,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:43:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 23:43:31,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2022-04-27 23:43:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 23:43:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2022-04-27 23:43:31,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 110 transitions. [2022-04-27 23:43:32,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:43:32,077 INFO L225 Difference]: With dead ends: 71 [2022-04-27 23:43:32,080 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 23:43:32,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 23:43:32,086 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:43:32,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:43:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 23:43:32,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 23:43:32,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:43:32,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:32,116 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:32,117 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:32,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:32,122 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-27 23:43:32,123 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-27 23:43:32,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:43:32,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:43:32,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-27 23:43:32,125 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-27 23:43:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:32,131 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-27 23:43:32,131 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-27 23:43:32,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:43:32,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:43:32,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:43:32,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:43:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-27 23:43:32,137 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-27 23:43:32,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:43:32,138 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-27 23:43:32,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 23:43:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-27 23:43:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 23:43:32,140 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:43:32,141 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:43:32,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 23:43:32,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-27 23:43:32,348 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:43:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:43:32,348 INFO L85 PathProgramCache]: Analyzing trace with hash -127828113, now seen corresponding path program 1 times [2022-04-27 23:43:32,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:43:32,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935477144] [2022-04-27 23:43:32,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:43:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:43:32,383 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:43:32,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1585448102] [2022-04-27 23:43:32,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:43:32,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:43:32,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:43:32,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:43:32,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 23:43:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:43:32,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 23:43:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:43:32,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:43:32,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {361#true} is VALID [2022-04-27 23:43:32,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {369#(<= ~counter~0 0)} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {369#(<= ~counter~0 0)} {361#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {369#(<= ~counter~0 0)} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {369#(<= ~counter~0 0)} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,633 INFO L272 TraceCheckUtils]: 6: Hoare triple {369#(<= ~counter~0 0)} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {369#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {369#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {369#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,637 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {369#(<= ~counter~0 0)} {369#(<= ~counter~0 0)} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,638 INFO L272 TraceCheckUtils]: 11: Hoare triple {369#(<= ~counter~0 0)} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {369#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {369#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {369#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,639 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {369#(<= ~counter~0 0)} {369#(<= ~counter~0 0)} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {369#(<= ~counter~0 0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,643 INFO L272 TraceCheckUtils]: 17: Hoare triple {369#(<= ~counter~0 0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {369#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {369#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {369#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,645 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {369#(<= ~counter~0 0)} {369#(<= ~counter~0 0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,645 INFO L272 TraceCheckUtils]: 22: Hoare triple {369#(<= ~counter~0 0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {369#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {369#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {369#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,648 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {369#(<= ~counter~0 0)} {369#(<= ~counter~0 0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {369#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:32,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {369#(<= ~counter~0 0)} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {448#(<= |main_#t~post6| 0)} is VALID [2022-04-27 23:43:32,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {448#(<= |main_#t~post6| 0)} [119] L40-->L40-3: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {362#false} is VALID [2022-04-27 23:43:32,650 INFO L272 TraceCheckUtils]: 29: Hoare triple {362#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {362#false} is VALID [2022-04-27 23:43:32,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {362#false} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {362#false} is VALID [2022-04-27 23:43:32,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {362#false} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {362#false} is VALID [2022-04-27 23:43:32,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {362#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {362#false} is VALID [2022-04-27 23:43:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 23:43:32,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:43:32,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:43:32,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935477144] [2022-04-27 23:43:32,651 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:43:32,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585448102] [2022-04-27 23:43:32,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585448102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:43:32,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:43:32,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 23:43:32,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013222798] [2022-04-27 23:43:32,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:43:32,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 23:43:32,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:43:32,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:43:32,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:43:32,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 23:43:32,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:43:32,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 23:43:32,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 23:43:32,672 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:43:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:32,775 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-27 23:43:32,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 23:43:32,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 23:43:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:43:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:43:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-27 23:43:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:43:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-27 23:43:32,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-27 23:43:32,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:43:32,825 INFO L225 Difference]: With dead ends: 44 [2022-04-27 23:43:32,825 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 23:43:32,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 23:43:32,826 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:43:32,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:43:32,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 23:43:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 23:43:32,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:43:32,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:32,841 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:32,842 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:32,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:32,849 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-27 23:43:32,849 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 23:43:32,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:43:32,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:43:32,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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 36 states. [2022-04-27 23:43:32,854 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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 36 states. [2022-04-27 23:43:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:32,856 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-27 23:43:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 23:43:32,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:43:32,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:43:32,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:43:32,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:43:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:32,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-27 23:43:32,862 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-27 23:43:32,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:43:32,862 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-27 23:43:32,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:43:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 23:43:32,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 23:43:32,864 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:43:32,865 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:43:32,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 23:43:33,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-27 23:43:33,073 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:43:33,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:43:33,073 INFO L85 PathProgramCache]: Analyzing trace with hash 365419517, now seen corresponding path program 1 times [2022-04-27 23:43:33,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:43:33,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928083493] [2022-04-27 23:43:33,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:43:33,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:43:33,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:43:33,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806445018] [2022-04-27 23:43:33,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:43:33,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:43:33,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:43:33,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:43:33,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 23:43:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:43:33,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:43:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:43:33,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:43:33,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {656#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {656#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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {656#true} is VALID [2022-04-27 23:43:33,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {656#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {656#true} {656#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {656#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {656#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {656#true} is VALID [2022-04-27 23:43:33,261 INFO L272 TraceCheckUtils]: 6: Hoare triple {656#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {656#true} is VALID [2022-04-27 23:43:33,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {656#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {656#true} is VALID [2022-04-27 23:43:33,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {656#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {656#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {656#true} {656#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {656#true} is VALID [2022-04-27 23:43:33,261 INFO L272 TraceCheckUtils]: 11: Hoare triple {656#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {656#true} is VALID [2022-04-27 23:43:33,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {656#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {697#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:43:33,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {697#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {701#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:43:33,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {701#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:43:33,263 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {701#(not (= |assume_abort_if_not_#in~cond| 0))} {656#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {708#(<= 1 main_~y~0)} is VALID [2022-04-27 23:43:33,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#(<= 1 main_~y~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {712#(<= 1 main_~b~0)} is VALID [2022-04-27 23:43:33,263 INFO L272 TraceCheckUtils]: 17: Hoare triple {712#(<= 1 main_~b~0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {656#true} is VALID [2022-04-27 23:43:33,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {656#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {656#true} is VALID [2022-04-27 23:43:33,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {656#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {656#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,264 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {656#true} {712#(<= 1 main_~b~0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {712#(<= 1 main_~b~0)} is VALID [2022-04-27 23:43:33,264 INFO L272 TraceCheckUtils]: 22: Hoare triple {712#(<= 1 main_~b~0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {656#true} is VALID [2022-04-27 23:43:33,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {656#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {656#true} is VALID [2022-04-27 23:43:33,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {656#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {656#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,265 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {656#true} {712#(<= 1 main_~b~0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {712#(<= 1 main_~b~0)} is VALID [2022-04-27 23:43:33,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(<= 1 main_~b~0)} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {712#(<= 1 main_~b~0)} is VALID [2022-04-27 23:43:33,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {712#(<= 1 main_~b~0)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {712#(<= 1 main_~b~0)} is VALID [2022-04-27 23:43:33,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {712#(<= 1 main_~b~0)} [123] L41-->L40-3: Formula: (= v_main_~b~0_3 0) InVars {main_~b~0=v_main_~b~0_3} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[] {657#false} is VALID [2022-04-27 23:43:33,266 INFO L272 TraceCheckUtils]: 30: Hoare triple {657#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {657#false} is VALID [2022-04-27 23:43:33,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {657#false} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {657#false} is VALID [2022-04-27 23:43:33,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {657#false} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {657#false} is VALID [2022-04-27 23:43:33,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {657#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {657#false} is VALID [2022-04-27 23:43:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 23:43:33,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:43:33,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {657#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {657#false} is VALID [2022-04-27 23:43:33,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {657#false} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {657#false} is VALID [2022-04-27 23:43:33,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {657#false} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {657#false} is VALID [2022-04-27 23:43:33,493 INFO L272 TraceCheckUtils]: 30: Hoare triple {657#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {657#false} is VALID [2022-04-27 23:43:33,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {712#(<= 1 main_~b~0)} [123] L41-->L40-3: Formula: (= v_main_~b~0_3 0) InVars {main_~b~0=v_main_~b~0_3} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[] {657#false} is VALID [2022-04-27 23:43:33,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {712#(<= 1 main_~b~0)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {712#(<= 1 main_~b~0)} is VALID [2022-04-27 23:43:33,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(<= 1 main_~b~0)} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {712#(<= 1 main_~b~0)} is VALID [2022-04-27 23:43:33,495 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {656#true} {712#(<= 1 main_~b~0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {712#(<= 1 main_~b~0)} is VALID [2022-04-27 23:43:33,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {656#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {656#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {656#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {656#true} is VALID [2022-04-27 23:43:33,496 INFO L272 TraceCheckUtils]: 22: Hoare triple {712#(<= 1 main_~b~0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {656#true} is VALID [2022-04-27 23:43:33,499 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {656#true} {712#(<= 1 main_~b~0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {712#(<= 1 main_~b~0)} is VALID [2022-04-27 23:43:33,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {656#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {656#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {656#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {656#true} is VALID [2022-04-27 23:43:33,501 INFO L272 TraceCheckUtils]: 17: Hoare triple {712#(<= 1 main_~b~0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {656#true} is VALID [2022-04-27 23:43:33,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#(<= 1 main_~y~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {712#(<= 1 main_~b~0)} is VALID [2022-04-27 23:43:33,503 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {701#(not (= |assume_abort_if_not_#in~cond| 0))} {656#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {708#(<= 1 main_~y~0)} is VALID [2022-04-27 23:43:33,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {701#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:43:33,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {827#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {701#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:43:33,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {656#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {827#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 23:43:33,515 INFO L272 TraceCheckUtils]: 11: Hoare triple {656#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {656#true} is VALID [2022-04-27 23:43:33,515 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {656#true} {656#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {656#true} is VALID [2022-04-27 23:43:33,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {656#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {656#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {656#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {656#true} is VALID [2022-04-27 23:43:33,515 INFO L272 TraceCheckUtils]: 6: Hoare triple {656#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {656#true} is VALID [2022-04-27 23:43:33,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {656#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {656#true} is VALID [2022-04-27 23:43:33,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {656#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {656#true} {656#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {656#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {656#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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {656#true} is VALID [2022-04-27 23:43:33,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {656#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-27 23:43:33,516 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 23:43:33,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:43:33,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928083493] [2022-04-27 23:43:33,516 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:43:33,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806445018] [2022-04-27 23:43:33,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806445018] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:43:33,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:43:33,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-27 23:43:33,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880148565] [2022-04-27 23:43:33,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:43:33,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) 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), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 23:43:33,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:43:33,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) 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), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:43:33,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:43:33,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 23:43:33,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:43:33,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 23:43:33,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 23:43:33,543 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) 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), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:43:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:33,793 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-27 23:43:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 23:43:33,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) 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), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 23:43:33,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:43:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) 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), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:43:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-27 23:43:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) 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), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:43:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-27 23:43:33,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-27 23:43:33,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:43:33,850 INFO L225 Difference]: With dead ends: 53 [2022-04-27 23:43:33,850 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 23:43:33,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 23:43:33,851 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:43:33,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 135 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:43:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 23:43:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-27 23:43:33,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:43:33,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:33,868 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:33,868 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:33,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:33,870 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-27 23:43:33,870 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-27 23:43:33,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:43:33,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:43:33,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 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 45 states. [2022-04-27 23:43:33,871 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 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 45 states. [2022-04-27 23:43:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:33,872 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-27 23:43:33,872 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-27 23:43:33,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:43:33,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:43:33,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:43:33,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:43:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:33,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-27 23:43:33,874 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-27 23:43:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:43:33,875 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-27 23:43:33,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) 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), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:43:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-27 23:43:33,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 23:43:33,875 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:43:33,875 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:43:33,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 23:43:34,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:43:34,091 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:43:34,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:43:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash 196514290, now seen corresponding path program 1 times [2022-04-27 23:43:34,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:43:34,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751706056] [2022-04-27 23:43:34,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:43:34,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:43:34,120 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:43:34,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1635560370] [2022-04-27 23:43:34,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:43:34,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:43:34,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:43:34,121 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:43:34,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 23:43:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:43:34,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 23:43:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:43:34,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:43:34,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {1096#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {1096#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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1096#true} is VALID [2022-04-27 23:43:34,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {1096#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1096#true} {1096#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {1096#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {1096#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {1096#true} is VALID [2022-04-27 23:43:34,372 INFO L272 TraceCheckUtils]: 6: Hoare triple {1096#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {1096#true} is VALID [2022-04-27 23:43:34,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {1096#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1096#true} is VALID [2022-04-27 23:43:34,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {1096#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {1096#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,372 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1096#true} {1096#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {1096#true} is VALID [2022-04-27 23:43:34,372 INFO L272 TraceCheckUtils]: 11: Hoare triple {1096#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {1096#true} is VALID [2022-04-27 23:43:34,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {1096#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1137#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:43:34,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {1137#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1141#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:43:34,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {1141#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1141#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:43:34,374 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1141#(not (= |assume_abort_if_not_#in~cond| 0))} {1096#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {1148#(<= 1 main_~y~0)} is VALID [2022-04-27 23:43:34,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {1148#(<= 1 main_~y~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1152#(<= 1 main_~b~0)} is VALID [2022-04-27 23:43:34,374 INFO L272 TraceCheckUtils]: 17: Hoare triple {1152#(<= 1 main_~b~0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1096#true} is VALID [2022-04-27 23:43:34,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {1096#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1096#true} is VALID [2022-04-27 23:43:34,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {1096#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {1096#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,375 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1096#true} {1152#(<= 1 main_~b~0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1152#(<= 1 main_~b~0)} is VALID [2022-04-27 23:43:34,375 INFO L272 TraceCheckUtils]: 22: Hoare triple {1152#(<= 1 main_~b~0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1096#true} is VALID [2022-04-27 23:43:34,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {1096#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1096#true} is VALID [2022-04-27 23:43:34,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {1096#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {1096#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,376 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1096#true} {1152#(<= 1 main_~b~0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1152#(<= 1 main_~b~0)} is VALID [2022-04-27 23:43:34,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {1152#(<= 1 main_~b~0)} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1152#(<= 1 main_~b~0)} is VALID [2022-04-27 23:43:34,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {1152#(<= 1 main_~b~0)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1152#(<= 1 main_~b~0)} is VALID [2022-04-27 23:43:34,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {1152#(<= 1 main_~b~0)} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1192#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 23:43:34,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {1192#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1192#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 23:43:34,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {1192#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} [136] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 2) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1192#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 23:43:34,395 INFO L272 TraceCheckUtils]: 32: Hoare triple {1192#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {1202#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:43:34,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {1202#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1206#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:43:34,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {1206#(<= 1 __VERIFIER_assert_~cond)} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1097#false} is VALID [2022-04-27 23:43:34,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {1097#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1097#false} is VALID [2022-04-27 23:43:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 23:43:34,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:43:34,568 INFO L290 TraceCheckUtils]: 35: Hoare triple {1097#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1097#false} is VALID [2022-04-27 23:43:34,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {1206#(<= 1 __VERIFIER_assert_~cond)} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1097#false} is VALID [2022-04-27 23:43:34,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {1202#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1206#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:43:34,570 INFO L272 TraceCheckUtils]: 32: Hoare triple {1222#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {1202#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:43:34,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {1222#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} [136] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 2) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1222#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 23:43:34,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {1222#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1222#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 23:43:34,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {1096#true} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1222#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 23:43:34,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {1096#true} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1096#true} is VALID [2022-04-27 23:43:34,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {1096#true} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1096#true} is VALID [2022-04-27 23:43:34,571 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1096#true} {1096#true} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1096#true} is VALID [2022-04-27 23:43:34,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {1096#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {1096#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {1096#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1096#true} is VALID [2022-04-27 23:43:34,572 INFO L272 TraceCheckUtils]: 22: Hoare triple {1096#true} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1096#true} is VALID [2022-04-27 23:43:34,572 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1096#true} {1096#true} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1096#true} is VALID [2022-04-27 23:43:34,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {1096#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {1096#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {1096#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1096#true} is VALID [2022-04-27 23:43:34,572 INFO L272 TraceCheckUtils]: 17: Hoare triple {1096#true} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1096#true} is VALID [2022-04-27 23:43:34,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {1096#true} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1096#true} is VALID [2022-04-27 23:43:34,572 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1096#true} {1096#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {1096#true} is VALID [2022-04-27 23:43:34,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {1096#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {1096#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {1096#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1096#true} is VALID [2022-04-27 23:43:34,573 INFO L272 TraceCheckUtils]: 11: Hoare triple {1096#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {1096#true} is VALID [2022-04-27 23:43:34,573 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1096#true} {1096#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {1096#true} is VALID [2022-04-27 23:43:34,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {1096#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {1096#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {1096#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1096#true} is VALID [2022-04-27 23:43:34,573 INFO L272 TraceCheckUtils]: 6: Hoare triple {1096#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {1096#true} is VALID [2022-04-27 23:43:34,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {1096#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {1096#true} is VALID [2022-04-27 23:43:34,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {1096#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1096#true} {1096#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {1096#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {1096#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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1096#true} is VALID [2022-04-27 23:43:34,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {1096#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-27 23:43:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 23:43:34,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:43:34,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751706056] [2022-04-27 23:43:34,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:43:34,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635560370] [2022-04-27 23:43:34,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635560370] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 23:43:34,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 23:43:34,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-27 23:43:34,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910983401] [2022-04-27 23:43:34,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:43:34,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-27 23:43:34,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:43:34,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 23:43:34,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:43:34,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:43:34,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:43:34,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:43:34,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-27 23:43:34,605 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 23:43:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:34,791 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-27 23:43:34,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:43:34,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-27 23:43:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:43:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 23:43:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 23:43:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 23:43:34,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 23:43:34,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 23:43:34,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:43:34,830 INFO L225 Difference]: With dead ends: 43 [2022-04-27 23:43:34,830 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 23:43:34,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:43:34,831 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:43:34,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:43:34,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 23:43:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-27 23:43:34,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:43:34,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:34,851 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:34,851 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:34,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:34,853 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-27 23:43:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 23:43:34,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:43:34,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:43:34,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 41 states. [2022-04-27 23:43:34,855 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 41 states. [2022-04-27 23:43:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:34,857 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-27 23:43:34,857 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 23:43:34,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:43:34,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:43:34,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:43:34,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:43:34,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:34,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-04-27 23:43:34,859 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 36 [2022-04-27 23:43:34,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:43:34,859 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-04-27 23:43:34,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 23:43:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 23:43:34,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 23:43:34,860 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:43:34,860 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:43:34,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 23:43:35,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:43:35,074 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:43:35,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:43:35,074 INFO L85 PathProgramCache]: Analyzing trace with hash 56558454, now seen corresponding path program 1 times [2022-04-27 23:43:35,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:43:35,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032727555] [2022-04-27 23:43:35,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:43:35,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:43:35,086 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:43:35,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1680424924] [2022-04-27 23:43:35,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:43:35,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:43:35,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:43:35,088 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:43:35,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 23:43:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:43:35,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:43:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:43:35,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:43:35,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {1529#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 23:43:35,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {1529#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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {1537#(<= ~counter~0 0)} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1537#(<= ~counter~0 0)} {1529#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {1537#(<= ~counter~0 0)} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {1537#(<= ~counter~0 0)} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,300 INFO L272 TraceCheckUtils]: 6: Hoare triple {1537#(<= ~counter~0 0)} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {1537#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {1537#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {1537#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,301 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1537#(<= ~counter~0 0)} {1537#(<= ~counter~0 0)} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,301 INFO L272 TraceCheckUtils]: 11: Hoare triple {1537#(<= ~counter~0 0)} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {1537#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {1537#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {1537#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,303 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1537#(<= ~counter~0 0)} {1537#(<= ~counter~0 0)} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {1537#(<= ~counter~0 0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,303 INFO L272 TraceCheckUtils]: 17: Hoare triple {1537#(<= ~counter~0 0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {1537#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {1537#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {1537#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,306 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1537#(<= ~counter~0 0)} {1537#(<= ~counter~0 0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,306 INFO L272 TraceCheckUtils]: 22: Hoare triple {1537#(<= ~counter~0 0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {1537#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {1537#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {1537#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,307 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1537#(<= ~counter~0 0)} {1537#(<= ~counter~0 0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1537#(<= ~counter~0 0)} is VALID [2022-04-27 23:43:35,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {1537#(<= ~counter~0 0)} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1616#(<= ~counter~0 1)} is VALID [2022-04-27 23:43:35,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {1616#(<= ~counter~0 1)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1616#(<= ~counter~0 1)} is VALID [2022-04-27 23:43:35,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {1616#(<= ~counter~0 1)} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1616#(<= ~counter~0 1)} is VALID [2022-04-27 23:43:35,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {1616#(<= ~counter~0 1)} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1626#(<= |main_#t~post7| 1)} is VALID [2022-04-27 23:43:35,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {1626#(<= |main_#t~post7| 1)} [135] L46-1-->L46-4: Formula: (not (< |v_main_#t~post7_3| 2)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1530#false} is VALID [2022-04-27 23:43:35,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {1530#false} [134] L46-4-->L40-2: Formula: (and (= v_main_~s~0_5 (+ (* (- 1) (* v_main_~k~0_7 v_main_~s~0_6)) v_main_~temp~0_1)) (= v_main_~c~0_8 v_main_~b~0_10) (= v_main_~p~0_5 (+ v_main_~q~0_5 (* v_main_~k~0_7 v_main_~q~0_6))) (= v_main_~p~0_4 v_main_~q~0_6) (= v_main_~r~0_5 v_main_~temp~0_1) (= v_main_~r~0_4 v_main_~s~0_6) (= v_main_~a~0_6 v_main_~b~0_11)) InVars {main_~q~0=v_main_~q~0_6, main_~k~0=v_main_~k~0_7, main_~c~0=v_main_~c~0_8, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_7, main_~c~0=v_main_~c~0_8, main_~b~0=v_main_~b~0_10, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1530#false} is VALID [2022-04-27 23:43:35,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {1530#false} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1530#false} is VALID [2022-04-27 23:43:35,309 INFO L290 TraceCheckUtils]: 34: Hoare triple {1530#false} [119] L40-->L40-3: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1530#false} is VALID [2022-04-27 23:43:35,309 INFO L272 TraceCheckUtils]: 35: Hoare triple {1530#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {1530#false} is VALID [2022-04-27 23:43:35,310 INFO L290 TraceCheckUtils]: 36: Hoare triple {1530#false} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1530#false} is VALID [2022-04-27 23:43:35,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {1530#false} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1530#false} is VALID [2022-04-27 23:43:35,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {1530#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1530#false} is VALID [2022-04-27 23:43:35,310 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 23:43:35,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:43:35,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:43:35,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032727555] [2022-04-27 23:43:35,310 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:43:35,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680424924] [2022-04-27 23:43:35,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680424924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:43:35,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:43:35,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:43:35,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191195411] [2022-04-27 23:43:35,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:43:35,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-27 23:43:35,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:43:35,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:43:35,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:43:35,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:43:35,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:43:35,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:43:35,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:43:35,329 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:43:35,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:35,446 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 23:43:35,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:43:35,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-27 23:43:35,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:43:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:43:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-27 23:43:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:43:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-27 23:43:35,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-27 23:43:35,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:43:35,501 INFO L225 Difference]: With dead ends: 66 [2022-04-27 23:43:35,501 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 23:43:35,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:43:35,502 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:43:35,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 110 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:43:35,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 23:43:35,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 23:43:35,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:43:35,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:35,527 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:35,527 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:35,528 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-27 23:43:35,528 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-27 23:43:35,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:43:35,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:43:35,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 23:43:35,529 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 23:43:35,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:35,530 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-27 23:43:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-27 23:43:35,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:43:35,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:43:35,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:43:35,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:43:35,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:43:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-04-27 23:43:35,531 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 39 [2022-04-27 23:43:35,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:43:35,532 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-04-27 23:43:35,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:43:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-27 23:43:35,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 23:43:35,532 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:43:35,532 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:43:35,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 23:43:35,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:43:35,746 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:43:35,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:43:35,746 INFO L85 PathProgramCache]: Analyzing trace with hash 578094295, now seen corresponding path program 1 times [2022-04-27 23:43:35,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:43:35,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838785343] [2022-04-27 23:43:35,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:43:35,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:43:35,756 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:43:35,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [141268037] [2022-04-27 23:43:35,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:43:35,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:43:35,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:43:35,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:43:35,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 23:43:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:43:35,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 23:43:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:43:35,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:43:36,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {1897#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {1897#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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1897#true} is VALID [2022-04-27 23:43:36,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {1897#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1897#true} {1897#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {1897#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {1897#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {1897#true} is VALID [2022-04-27 23:43:36,014 INFO L272 TraceCheckUtils]: 6: Hoare triple {1897#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {1897#true} is VALID [2022-04-27 23:43:36,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {1897#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1897#true} is VALID [2022-04-27 23:43:36,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {1897#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {1897#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,015 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1897#true} {1897#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {1897#true} is VALID [2022-04-27 23:43:36,015 INFO L272 TraceCheckUtils]: 11: Hoare triple {1897#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {1897#true} is VALID [2022-04-27 23:43:36,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {1897#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1938#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:43:36,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {1938#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1942#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:43:36,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {1942#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1942#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:43:36,018 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1942#(not (= |assume_abort_if_not_#in~cond| 0))} {1897#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {1949#(<= 1 main_~y~0)} is VALID [2022-04-27 23:43:36,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {1949#(<= 1 main_~y~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:43:36,019 INFO L272 TraceCheckUtils]: 17: Hoare triple {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1897#true} is VALID [2022-04-27 23:43:36,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {1897#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1897#true} is VALID [2022-04-27 23:43:36,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {1897#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {1897#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,020 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1897#true} {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:43:36,020 INFO L272 TraceCheckUtils]: 22: Hoare triple {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1897#true} is VALID [2022-04-27 23:43:36,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {1897#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1897#true} is VALID [2022-04-27 23:43:36,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {1897#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {1897#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,021 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1897#true} {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:43:36,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:43:36,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:43:36,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:43:36,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:43:36,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [136] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 2) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:43:36,023 INFO L272 TraceCheckUtils]: 32: Hoare triple {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {1897#true} is VALID [2022-04-27 23:43:36,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {1897#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1897#true} is VALID [2022-04-27 23:43:36,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {1897#true} [127] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {1897#true} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,023 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1897#true} {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [149] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:43:36,024 INFO L272 TraceCheckUtils]: 37: Hoare triple {1953#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [138] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_7) (* v_main_~x~0_12 v_main_~p~0_7)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2017#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:43:36,024 INFO L290 TraceCheckUtils]: 38: Hoare triple {2017#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2021#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:43:36,025 INFO L290 TraceCheckUtils]: 39: Hoare triple {2021#(<= 1 __VERIFIER_assert_~cond)} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1898#false} is VALID [2022-04-27 23:43:36,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {1898#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1898#false} is VALID [2022-04-27 23:43:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 23:43:36,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:43:36,198 INFO L290 TraceCheckUtils]: 40: Hoare triple {1898#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1898#false} is VALID [2022-04-27 23:43:36,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {2021#(<= 1 __VERIFIER_assert_~cond)} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1898#false} is VALID [2022-04-27 23:43:36,199 INFO L290 TraceCheckUtils]: 38: Hoare triple {2017#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2021#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:43:36,199 INFO L272 TraceCheckUtils]: 37: Hoare triple {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [138] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_7) (* v_main_~x~0_12 v_main_~p~0_7)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2017#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:43:36,200 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1897#true} {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [149] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:43:36,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {1897#true} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {1897#true} [127] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {1897#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1897#true} is VALID [2022-04-27 23:43:36,200 INFO L272 TraceCheckUtils]: 32: Hoare triple {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {1897#true} is VALID [2022-04-27 23:43:36,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [136] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 2) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:43:36,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:43:36,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:43:36,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:43:36,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:43:36,202 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1897#true} {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:43:36,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {1897#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {1897#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {1897#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1897#true} is VALID [2022-04-27 23:43:36,203 INFO L272 TraceCheckUtils]: 22: Hoare triple {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1897#true} is VALID [2022-04-27 23:43:36,203 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1897#true} {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:43:36,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {1897#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {1897#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {1897#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1897#true} is VALID [2022-04-27 23:43:36,203 INFO L272 TraceCheckUtils]: 17: Hoare triple {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1897#true} is VALID [2022-04-27 23:43:36,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {1897#true} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2037#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:43:36,205 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1897#true} {1897#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {1897#true} is VALID [2022-04-27 23:43:36,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {1897#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {1897#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {1897#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1897#true} is VALID [2022-04-27 23:43:36,205 INFO L272 TraceCheckUtils]: 11: Hoare triple {1897#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {1897#true} is VALID [2022-04-27 23:43:36,205 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1897#true} {1897#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {1897#true} is VALID [2022-04-27 23:43:36,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {1897#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {1897#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {1897#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1897#true} is VALID [2022-04-27 23:43:36,205 INFO L272 TraceCheckUtils]: 6: Hoare triple {1897#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {1897#true} is VALID [2022-04-27 23:43:36,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {1897#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {1897#true} is VALID [2022-04-27 23:43:36,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {1897#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1897#true} {1897#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {1897#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {1897#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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1897#true} is VALID [2022-04-27 23:43:36,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {1897#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#true} is VALID [2022-04-27 23:43:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 23:43:36,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:43:36,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838785343] [2022-04-27 23:43:36,206 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:43:36,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141268037] [2022-04-27 23:43:36,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141268037] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 23:43:36,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 23:43:36,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 23:43:36,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969593362] [2022-04-27 23:43:36,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:43:36,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-27 23:43:36,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:43:36,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 23:43:36,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:43:36,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:43:36,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:43:36,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:43:36,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 23:43:36,228 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 23:43:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:36,490 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-27 23:43:36,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:43:36,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-27 23:43:36,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:43:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 23:43:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 23:43:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 23:43:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 23:43:36,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 23:43:36,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:43:36,539 INFO L225 Difference]: With dead ends: 57 [2022-04-27 23:43:36,539 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 23:43:36,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 23:43:36,540 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:43:36,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 157 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:43:36,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 23:43:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-27 23:43:36,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:43:36,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 23:43:36,564 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 23:43:36,564 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 23:43:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:36,566 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 23:43:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 23:43:36,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:43:36,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:43:36,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-27 23:43:36,567 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-27 23:43:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:36,568 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 23:43:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 23:43:36,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:43:36,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:43:36,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:43:36,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:43:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 23:43:36,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-27 23:43:36,570 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 41 [2022-04-27 23:43:36,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:43:36,570 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-27 23:43:36,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 23:43:36,570 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-27 23:43:36,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 23:43:36,571 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:43:36,571 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1] [2022-04-27 23:43:36,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 23:43:36,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:43:36,779 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:43:36,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:43:36,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1581112078, now seen corresponding path program 1 times [2022-04-27 23:43:36,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:43:36,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593132366] [2022-04-27 23:43:36,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:43:36,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:43:36,791 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:43:36,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2020747535] [2022-04-27 23:43:36,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:43:36,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:43:36,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:43:36,792 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:43:36,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 23:43:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:43:36,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 23:43:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:43:36,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:43:37,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {2428#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {2428#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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2428#true} is VALID [2022-04-27 23:43:37,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {2428#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2428#true} {2428#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {2428#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {2428#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {2428#true} is VALID [2022-04-27 23:43:37,051 INFO L272 TraceCheckUtils]: 6: Hoare triple {2428#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {2428#true} is VALID [2022-04-27 23:43:37,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {2428#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2454#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:43:37,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {2454#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2458#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:43:37,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {2458#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2458#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:43:37,052 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2458#(not (= |assume_abort_if_not_#in~cond| 0))} {2428#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {2465#(<= 1 main_~x~0)} is VALID [2022-04-27 23:43:37,053 INFO L272 TraceCheckUtils]: 11: Hoare triple {2465#(<= 1 main_~x~0)} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {2428#true} is VALID [2022-04-27 23:43:37,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {2428#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2428#true} is VALID [2022-04-27 23:43:37,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {2428#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {2428#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,053 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2428#true} {2465#(<= 1 main_~x~0)} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {2465#(<= 1 main_~x~0)} is VALID [2022-04-27 23:43:37,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {2465#(<= 1 main_~x~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:43:37,054 INFO L272 TraceCheckUtils]: 17: Hoare triple {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {2428#true} is VALID [2022-04-27 23:43:37,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {2428#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2428#true} is VALID [2022-04-27 23:43:37,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {2428#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {2428#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,055 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2428#true} {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:43:37,055 INFO L272 TraceCheckUtils]: 22: Hoare triple {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {2428#true} is VALID [2022-04-27 23:43:37,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {2428#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2428#true} is VALID [2022-04-27 23:43:37,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {2428#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {2428#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,056 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2428#true} {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:43:37,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:43:37,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:43:37,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:43:37,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:43:37,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [136] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 2) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:43:37,058 INFO L272 TraceCheckUtils]: 32: Hoare triple {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {2428#true} is VALID [2022-04-27 23:43:37,058 INFO L290 TraceCheckUtils]: 33: Hoare triple {2428#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2428#true} is VALID [2022-04-27 23:43:37,058 INFO L290 TraceCheckUtils]: 34: Hoare triple {2428#true} [127] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,058 INFO L290 TraceCheckUtils]: 35: Hoare triple {2428#true} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,059 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2428#true} {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [149] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:43:37,059 INFO L272 TraceCheckUtils]: 37: Hoare triple {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [138] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_7) (* v_main_~x~0_12 v_main_~p~0_7)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2428#true} is VALID [2022-04-27 23:43:37,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {2428#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2428#true} is VALID [2022-04-27 23:43:37,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {2428#true} [127] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {2428#true} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,060 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2428#true} {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [150] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_7) (* v_main_~x~0_12 v_main_~p~0_7)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:43:37,060 INFO L272 TraceCheckUtils]: 42: Hoare triple {2484#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [139] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~x~0_13 v_main_~q~0_8) (* v_main_~y~0_13 v_main_~s~0_8)) v_main_~b~0_13) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_13, main_~b~0=v_main_~b~0_13, main_~s~0=v_main_~s~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2563#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:43:37,061 INFO L290 TraceCheckUtils]: 43: Hoare triple {2563#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2567#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:43:37,061 INFO L290 TraceCheckUtils]: 44: Hoare triple {2567#(<= 1 __VERIFIER_assert_~cond)} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2429#false} is VALID [2022-04-27 23:43:37,061 INFO L290 TraceCheckUtils]: 45: Hoare triple {2429#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2429#false} is VALID [2022-04-27 23:43:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 23:43:37,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:43:37,277 INFO L290 TraceCheckUtils]: 45: Hoare triple {2429#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2429#false} is VALID [2022-04-27 23:43:37,277 INFO L290 TraceCheckUtils]: 44: Hoare triple {2567#(<= 1 __VERIFIER_assert_~cond)} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2429#false} is VALID [2022-04-27 23:43:37,278 INFO L290 TraceCheckUtils]: 43: Hoare triple {2563#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2567#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:43:37,280 INFO L272 TraceCheckUtils]: 42: Hoare triple {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [139] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~x~0_13 v_main_~q~0_8) (* v_main_~y~0_13 v_main_~s~0_8)) v_main_~b~0_13) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_13, main_~b~0=v_main_~b~0_13, main_~s~0=v_main_~s~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2563#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:43:37,280 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2428#true} {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [150] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_7) (* v_main_~x~0_12 v_main_~p~0_7)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:43:37,281 INFO L290 TraceCheckUtils]: 40: Hoare triple {2428#true} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,281 INFO L290 TraceCheckUtils]: 39: Hoare triple {2428#true} [127] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {2428#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2428#true} is VALID [2022-04-27 23:43:37,281 INFO L272 TraceCheckUtils]: 37: Hoare triple {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [138] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_7) (* v_main_~x~0_12 v_main_~p~0_7)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2428#true} is VALID [2022-04-27 23:43:37,282 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2428#true} {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [149] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:43:37,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {2428#true} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {2428#true} [127] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,282 INFO L290 TraceCheckUtils]: 33: Hoare triple {2428#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2428#true} is VALID [2022-04-27 23:43:37,282 INFO L272 TraceCheckUtils]: 32: Hoare triple {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {2428#true} is VALID [2022-04-27 23:43:37,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [136] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 2) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:43:37,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:43:37,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:43:37,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:43:37,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:43:37,292 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2428#true} {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:43:37,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {2428#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {2428#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {2428#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2428#true} is VALID [2022-04-27 23:43:37,292 INFO L272 TraceCheckUtils]: 22: Hoare triple {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {2428#true} is VALID [2022-04-27 23:43:37,292 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2428#true} {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:43:37,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {2428#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {2428#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {2428#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2428#true} is VALID [2022-04-27 23:43:37,293 INFO L272 TraceCheckUtils]: 17: Hoare triple {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {2428#true} is VALID [2022-04-27 23:43:37,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {2428#true} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2583#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:43:37,307 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2428#true} {2428#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {2428#true} is VALID [2022-04-27 23:43:37,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {2428#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {2428#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {2428#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2428#true} is VALID [2022-04-27 23:43:37,308 INFO L272 TraceCheckUtils]: 11: Hoare triple {2428#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {2428#true} is VALID [2022-04-27 23:43:37,308 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2428#true} {2428#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {2428#true} is VALID [2022-04-27 23:43:37,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {2428#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {2428#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {2428#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2428#true} is VALID [2022-04-27 23:43:37,308 INFO L272 TraceCheckUtils]: 6: Hoare triple {2428#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {2428#true} is VALID [2022-04-27 23:43:37,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {2428#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {2428#true} is VALID [2022-04-27 23:43:37,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {2428#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2428#true} {2428#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {2428#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {2428#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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2428#true} is VALID [2022-04-27 23:43:37,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {2428#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 23:43:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 23:43:37,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:43:37,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593132366] [2022-04-27 23:43:37,309 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:43:37,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020747535] [2022-04-27 23:43:37,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020747535] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 23:43:37,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 23:43:37,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 23:43:37,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420648193] [2022-04-27 23:43:37,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:43:37,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-27 23:43:37,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:43:37,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 23:43:37,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:43:37,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:43:37,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:43:37,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:43:37,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 23:43:37,331 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 23:43:37,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:37,537 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-27 23:43:37,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:43:37,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-27 23:43:37,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:43:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 23:43:37,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 23:43:37,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 23:43:37,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 23:43:37,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 23:43:37,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:43:37,584 INFO L225 Difference]: With dead ends: 61 [2022-04-27 23:43:37,584 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 23:43:37,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 23:43:37,585 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:43:37,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:43:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 23:43:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-27 23:43:37,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:43:37,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 23:43:37,609 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 23:43:37,609 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 23:43:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:37,611 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 23:43:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 23:43:37,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:43:37,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:43:37,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-04-27 23:43:37,620 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-04-27 23:43:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:43:37,622 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 23:43:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 23:43:37,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:43:37,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:43:37,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:43:37,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:43:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 23:43:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-27 23:43:37,624 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 46 [2022-04-27 23:43:37,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:43:37,624 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-04-27 23:43:37,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 23:43:37,624 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-27 23:43:37,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 23:43:37,624 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:43:37,625 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:43:37,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-27 23:43:37,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:43:37,843 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:43:37,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:43:37,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1942645143, now seen corresponding path program 1 times [2022-04-27 23:43:37,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:43:37,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331954508] [2022-04-27 23:43:37,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:43:37,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:43:37,853 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:43:37,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1750303738] [2022-04-27 23:43:37,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:43:37,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:43:37,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:43:37,854 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:43:37,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 23:43:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:43:37,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 23:43:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:43:37,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:43:43,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {3007#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3007#true} is VALID [2022-04-27 23:43:43,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {3007#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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {3007#true} is VALID [2022-04-27 23:43:43,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {3007#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3007#true} is VALID [2022-04-27 23:43:43,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3007#true} {3007#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3007#true} is VALID [2022-04-27 23:43:43,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {3007#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3007#true} is VALID [2022-04-27 23:43:43,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {3007#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {3007#true} is VALID [2022-04-27 23:43:43,281 INFO L272 TraceCheckUtils]: 6: Hoare triple {3007#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {3007#true} is VALID [2022-04-27 23:43:43,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {3007#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3007#true} is VALID [2022-04-27 23:43:43,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {3007#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3007#true} is VALID [2022-04-27 23:43:43,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {3007#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3007#true} is VALID [2022-04-27 23:43:43,281 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3007#true} {3007#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} 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] {3007#true} is VALID [2022-04-27 23:43:43,281 INFO L272 TraceCheckUtils]: 11: Hoare triple {3007#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {3007#true} is VALID [2022-04-27 23:43:43,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {3007#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3048#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:43:43,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {3048#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3052#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:43:43,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {3052#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3052#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:43:43,287 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3052#(not (= |assume_abort_if_not_#in~cond| 0))} {3007#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} 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] {3059#(<= 1 main_~y~0)} is VALID [2022-04-27 23:43:43,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {3059#(<= 1 main_~y~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:43:43,287 INFO L272 TraceCheckUtils]: 17: Hoare triple {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {3007#true} is VALID [2022-04-27 23:43:43,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {3007#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3007#true} is VALID [2022-04-27 23:43:43,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {3007#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3007#true} is VALID [2022-04-27 23:43:43,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {3007#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3007#true} is VALID [2022-04-27 23:43:43,288 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3007#true} {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:43:43,288 INFO L272 TraceCheckUtils]: 22: Hoare triple {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {3007#true} is VALID [2022-04-27 23:43:43,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {3007#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3007#true} is VALID [2022-04-27 23:43:43,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {3007#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3007#true} is VALID [2022-04-27 23:43:43,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {3007#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3007#true} is VALID [2022-04-27 23:43:43,289 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3007#true} {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:43:43,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:43:43,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:43:43,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:43:43,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:43:43,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [136] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 2) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:43:43,291 INFO L272 TraceCheckUtils]: 32: Hoare triple {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {3007#true} is VALID [2022-04-27 23:43:43,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {3007#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3007#true} is VALID [2022-04-27 23:43:43,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {3007#true} [127] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3007#true} is VALID [2022-04-27 23:43:43,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {3007#true} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3007#true} is VALID [2022-04-27 23:43:43,292 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3007#true} {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [149] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:43:43,292 INFO L272 TraceCheckUtils]: 37: Hoare triple {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [138] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_7) (* v_main_~x~0_12 v_main_~p~0_7)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3007#true} is VALID [2022-04-27 23:43:43,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {3007#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3130#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:43:43,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {3130#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [127] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3134#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:43:43,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {3134#(not (= |__VERIFIER_assert_#in~cond| 0))} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3134#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:43:43,294 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3134#(not (= |__VERIFIER_assert_#in~cond| 0))} {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [150] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_7) (* v_main_~x~0_12 v_main_~p~0_7)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:43:43,294 INFO L272 TraceCheckUtils]: 42: Hoare triple {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [139] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~x~0_13 v_main_~q~0_8) (* v_main_~y~0_13 v_main_~s~0_8)) v_main_~b~0_13) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_13, main_~b~0=v_main_~b~0_13, main_~s~0=v_main_~s~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3007#true} is VALID [2022-04-27 23:43:43,294 INFO L290 TraceCheckUtils]: 43: Hoare triple {3007#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3130#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:43:43,295 INFO L290 TraceCheckUtils]: 44: Hoare triple {3130#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [127] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3134#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:43:43,295 INFO L290 TraceCheckUtils]: 45: Hoare triple {3134#(not (= |__VERIFIER_assert_#in~cond| 0))} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3134#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:43:43,295 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3134#(not (= |__VERIFIER_assert_#in~cond| 0))} {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [151] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~x~0_13 v_main_~q~0_8) (* v_main_~y~0_13 v_main_~s~0_8)) v_main_~b~0_13) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_13, main_~b~0=v_main_~b~0_13, main_~s~0=v_main_~s~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:43:43,296 INFO L272 TraceCheckUtils]: 47: Hoare triple {3063#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [140] L49-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (+ (* v_main_~xy~0_6 v_main_~q~0_9) (* (- 1) (* v_main_~y~0_14 v_main_~s~0_9)) (* v_main_~yy~0_6 v_main_~s~0_9) (* (- 1) (* v_main_~x~0_14 v_main_~q~0_9)) (* (- 1) (* v_main_~y~0_14 v_main_~b~0_14)) v_main_~b~0_14)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~yy~0=v_main_~yy~0_6, main_~x~0=v_main_~x~0_14, main_~xy~0=v_main_~xy~0_6, main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_14, main_~s~0=v_main_~s~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~xy~0, main_~y~0, main_~b~0, main_~s~0] {3159#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:43:43,297 INFO L290 TraceCheckUtils]: 48: Hoare triple {3159#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3163#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:43:43,297 INFO L290 TraceCheckUtils]: 49: Hoare triple {3163#(<= 1 __VERIFIER_assert_~cond)} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3008#false} is VALID [2022-04-27 23:43:43,297 INFO L290 TraceCheckUtils]: 50: Hoare triple {3008#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3008#false} is VALID [2022-04-27 23:43:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 23:43:43,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:44:28,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:44:28,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331954508] [2022-04-27 23:44:28,136 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:44:28,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750303738] [2022-04-27 23:44:28,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750303738] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 23:44:28,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 23:44:28,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 23:44:28,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435217086] [2022-04-27 23:44:28,137 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 23:44:28,137 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-27 23:44:28,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:44:28,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 23:44:28,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:44:28,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 23:44:28,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:44:28,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 23:44:28,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-27 23:44:28,181 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 23:44:30,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:44:30,040 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-27 23:44:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 23:44:30,040 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-27 23:44:30,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:44:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 23:44:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 23:44:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 23:44:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 23:44:30,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-27 23:44:30,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:44:30,137 INFO L225 Difference]: With dead ends: 65 [2022-04-27 23:44:30,137 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 23:44:30,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-27 23:44:30,138 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 31 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 23:44:30,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 172 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 23:44:30,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 23:44:30,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-27 23:44:30,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:44:30,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 23:44:30,161 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 23:44:30,161 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 23:44:30,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:44:30,162 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-27 23:44:30,162 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 23:44:30,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:44:30,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:44:30,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-27 23:44:30,163 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-27 23:44:30,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:44:30,164 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-27 23:44:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 23:44:30,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:44:30,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:44:30,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:44:30,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:44:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 23:44:30,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-04-27 23:44:30,166 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 51 [2022-04-27 23:44:30,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:44:30,166 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-04-27 23:44:30,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 23:44:30,167 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-04-27 23:44:30,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-27 23:44:30,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:44:30,167 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:44:30,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 23:44:30,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-27 23:44:30,378 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:44:30,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:44:30,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1573186588, now seen corresponding path program 1 times [2022-04-27 23:44:30,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:44:30,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87034193] [2022-04-27 23:44:30,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:44:30,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:44:30,388 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:44:30,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817242563] [2022-04-27 23:44:30,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:44:30,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:44:30,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:44:30,390 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:44:30,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 23:44:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 23:44:30,437 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 23:44:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 23:44:30,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 23:44:30,478 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 23:44:30,479 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 23:44:30,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 23:44:30,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:44:30,694 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:44:30,696 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 23:44:30,732 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 23:44:30,732 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 23:44:30,732 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 23:44:30,732 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 23:44:30,733 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 23:44:30,734 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 23:44:30,734 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 23:44:30,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:44:30 BasicIcfg [2022-04-27 23:44:30,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 23:44:30,736 INFO L158 Benchmark]: Toolchain (without parser) took 59817.33ms. Allocated memory was 200.3MB in the beginning and 246.4MB in the end (delta: 46.1MB). Free memory was 149.4MB in the beginning and 192.5MB in the end (delta: -43.1MB). Peak memory consumption was 4.3MB. Max. memory is 8.0GB. [2022-04-27 23:44:30,736 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 200.3MB. Free memory is still 165.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 23:44:30,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.48ms. Allocated memory is still 200.3MB. Free memory was 149.1MB in the beginning and 175.0MB in the end (delta: -25.9MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-04-27 23:44:30,740 INFO L158 Benchmark]: Boogie Preprocessor took 19.39ms. Allocated memory is still 200.3MB. Free memory was 175.0MB in the beginning and 173.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 23:44:30,740 INFO L158 Benchmark]: RCFGBuilder took 251.48ms. Allocated memory is still 200.3MB. Free memory was 173.4MB in the beginning and 160.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 23:44:30,740 INFO L158 Benchmark]: IcfgTransformer took 55.19ms. Allocated memory is still 200.3MB. Free memory was 160.3MB in the beginning and 158.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 23:44:30,741 INFO L158 Benchmark]: TraceAbstraction took 59299.64ms. Allocated memory was 200.3MB in the beginning and 246.4MB in the end (delta: 46.1MB). Free memory was 158.0MB in the beginning and 192.5MB in the end (delta: -34.5MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2022-04-27 23:44:30,741 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.09ms. Allocated memory is still 200.3MB. Free memory is still 165.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 186.48ms. Allocated memory is still 200.3MB. Free memory was 149.1MB in the beginning and 175.0MB in the end (delta: -25.9MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.39ms. Allocated memory is still 200.3MB. Free memory was 175.0MB in the beginning and 173.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 251.48ms. Allocated memory is still 200.3MB. Free memory was 173.4MB in the beginning and 160.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 55.19ms. Allocated memory is still 200.3MB. Free memory was 160.3MB in the beginning and 158.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 59299.64ms. Allocated memory was 200.3MB in the beginning and 246.4MB in the end (delta: 46.1MB). Free memory was 158.0MB in the beginning and 192.5MB in the end (delta: -34.5MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=5, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s, c, k, xy, yy; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=1, y=2] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=1, y=2] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y VAL [\old(counter)=0, a=1, b=2, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L37] CALL assume_abort_if_not(xy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L37] RET assume_abort_if_not(xy < 2147483647) VAL [\old(counter)=0, a=1, b=2, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L38] CALL assume_abort_if_not(yy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L38] RET assume_abort_if_not(yy < 2147483647) VAL [\old(counter)=0, a=1, b=2, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L40] EXPR counter++ VAL [\old(counter)=0, a=1, b=2, c=0, counter=1, counter++=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L40] COND TRUE counter++<2 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=1, b=2, c=1, counter=1, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L46] EXPR counter++ VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L46] COND TRUE counter++<2 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=2, b=1, c=1, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=1, xy=2, y=2, yy=4] [L40] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=1, xy=2, y=2, yy=4] [L40] COND FALSE !(counter++<2) [L70] CALL __VERIFIER_assert(q*x + s*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.2s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 1013 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 679 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 457 IncrementalHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 334 mSDtfsCounter, 457 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 419 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=8, InterpolantAutomatonStates: 42, 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, 8 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 52.5s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 457 ConstructedInterpolants, 0 QuantifiedInterpolants, 1324 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1121 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 287/328 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 23:44:30,758 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...