/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/fermat2-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 03:09:15,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 03:09:15,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 03:09:15,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 03:09:15,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 03:09:15,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 03:09:15,867 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 03:09:15,868 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 03:09:15,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 03:09:15,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 03:09:15,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 03:09:15,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 03:09:15,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 03:09:15,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 03:09:15,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 03:09:15,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 03:09:15,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 03:09:15,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 03:09:15,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 03:09:15,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 03:09:15,886 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 03:09:15,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 03:09:15,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 03:09:15,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 03:09:15,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 03:09:15,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 03:09:15,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 03:09:15,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 03:09:15,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 03:09:15,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 03:09:15,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 03:09:15,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 03:09:15,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 03:09:15,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 03:09:15,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 03:09:15,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 03:09:15,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 03:09:15,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 03:09:15,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 03:09:15,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 03:09:15,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 03:09:15,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 03:09:15,907 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 03:09:15,923 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 03:09:15,924 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 03:09:15,924 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 03:09:15,924 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 03:09:15,925 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 03:09:15,925 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 03:09:15,925 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 03:09:15,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 03:09:15,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 03:09:15,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 03:09:15,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 03:09:15,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 03:09:15,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 03:09:15,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 03:09:15,926 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 03:09:15,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 03:09:15,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 03:09:15,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 03:09:15,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 03:09:15,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:09:15,929 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 03:09:15,929 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 03:09:15,929 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 03:09:15,930 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 03:09:15,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 03:09:15,930 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 03:09:15,930 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 03:09:15,930 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 03:09:15,931 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 03:09:15,931 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 03:09:16,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 03:09:16,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 03:09:16,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 03:09:16,142 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 03:09:16,143 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 03:09:16,144 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2022-04-15 03:09:16,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4bb38f2f/8c377d8082944c399ca9e69b3cee1c7d/FLAG3a77b3be8 [2022-04-15 03:09:16,582 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 03:09:16,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2022-04-15 03:09:16,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4bb38f2f/8c377d8082944c399ca9e69b3cee1c7d/FLAG3a77b3be8 [2022-04-15 03:09:16,598 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4bb38f2f/8c377d8082944c399ca9e69b3cee1c7d [2022-04-15 03:09:16,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 03:09:16,601 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 03:09:16,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 03:09:16,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 03:09:16,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 03:09:16,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:09:16" (1/1) ... [2022-04-15 03:09:16,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d0c2fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:16, skipping insertion in model container [2022-04-15 03:09:16,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:09:16" (1/1) ... [2022-04-15 03:09:16,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 03:09:16,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 03:09:16,799 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/fermat2-ll_unwindbound20.c[524,537] [2022-04-15 03:09:16,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:09:16,829 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 03:09:16,848 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/fermat2-ll_unwindbound20.c[524,537] [2022-04-15 03:09:16,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:09:16,871 INFO L208 MainTranslator]: Completed translation [2022-04-15 03:09:16,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:16 WrapperNode [2022-04-15 03:09:16,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 03:09:16,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 03:09:16,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 03:09:16,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 03:09:16,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:16" (1/1) ... [2022-04-15 03:09:16,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:16" (1/1) ... [2022-04-15 03:09:16,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:16" (1/1) ... [2022-04-15 03:09:16,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:16" (1/1) ... [2022-04-15 03:09:16,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:16" (1/1) ... [2022-04-15 03:09:16,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:16" (1/1) ... [2022-04-15 03:09:16,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:16" (1/1) ... [2022-04-15 03:09:16,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 03:09:16,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 03:09:16,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 03:09:16,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 03:09:16,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:16" (1/1) ... [2022-04-15 03:09:16,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:09:16,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:16,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 03:09:16,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 03:09:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 03:09:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 03:09:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 03:09:16,987 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 03:09:16,988 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 03:09:16,988 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 03:09:16,988 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 03:09:16,989 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 03:09:16,989 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 03:09:16,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 03:09:16,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 03:09:16,990 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 03:09:16,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 03:09:16,990 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 03:09:16,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 03:09:16,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 03:09:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 03:09:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 03:09:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 03:09:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 03:09:17,049 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 03:09:17,050 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 03:09:17,198 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 03:09:17,205 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 03:09:17,205 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 03:09:17,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:09:17 BoogieIcfgContainer [2022-04-15 03:09:17,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 03:09:17,209 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 03:09:17,209 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 03:09:17,215 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 03:09:17,218 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:09:17" (1/1) ... [2022-04-15 03:09:17,220 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 03:09:17,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:09:17 BasicIcfg [2022-04-15 03:09:17,248 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 03:09:17,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 03:09:17,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 03:09:17,252 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 03:09:17,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:09:16" (1/4) ... [2022-04-15 03:09:17,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12022e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:09:17, skipping insertion in model container [2022-04-15 03:09:17,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:16" (2/4) ... [2022-04-15 03:09:17,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12022e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:09:17, skipping insertion in model container [2022-04-15 03:09:17,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:09:17" (3/4) ... [2022-04-15 03:09:17,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12022e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:09:17, skipping insertion in model container [2022-04-15 03:09:17,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:09:17" (4/4) ... [2022-04-15 03:09:17,261 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound20.cqvasr [2022-04-15 03:09:17,265 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 03:09:17,265 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 03:09:17,293 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 03:09:17,297 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 03:09:17,298 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 03:09:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 03:09:17,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 03:09:17,321 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:17,321 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:09:17,321 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:17,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:17,325 INFO L85 PathProgramCache]: Analyzing trace with hash 734203501, now seen corresponding path program 1 times [2022-04-15 03:09:17,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:17,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181153341] [2022-04-15 03:09:17,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:17,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:17,422 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:09:17,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [975751313] [2022-04-15 03:09:17,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:17,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:17,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:17,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:09:17,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 03:09:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:17,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-15 03:09:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:17,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:09:17,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 03:09:17,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #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] {33#true} is VALID [2022-04-15 03:09:17,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 03:09:17,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 03:09:17,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 03:09:17,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {33#true} is VALID [2022-04-15 03:09:17,641 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {33#true} is VALID [2022-04-15 03:09:17,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} [78] assume_abort_if_notENTRY-->L9: 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] {33#true} is VALID [2022-04-15 03:09:17,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} [80] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 03:09:17,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 03:09:17,642 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {34#false} is VALID [2022-04-15 03:09:17,643 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-15 03:09:17,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} [78] assume_abort_if_notENTRY-->L9: 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] {34#false} is VALID [2022-04-15 03:09:17,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} [80] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 03:09:17,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 03:09:17,644 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-15 03:09:17,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {34#false} is VALID [2022-04-15 03:09:17,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} [82] L38-2-->L34-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 03:09:17,647 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {34#false} is VALID [2022-04-15 03:09:17,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34#false} is VALID [2022-04-15 03:09:17,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} [92] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 03:09:17,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 03:09:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 03:09:17,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:09:17,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:09:17,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181153341] [2022-04-15 03:09:17,650 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:09:17,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975751313] [2022-04-15 03:09:17,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975751313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:09:17,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:09:17,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 03:09:17,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490351104] [2022-04-15 03:09:17,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:09:17,658 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 03:09:17,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:09:17,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 03:09:17,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:17,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-15 03:09:17,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:09:17,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-15 03:09:17,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 03:09:17,708 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 03:09:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:17,753 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 03:09:17,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-15 03:09:17,753 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 03:09:17,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:09:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 03:09:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-15 03:09:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 03:09:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-15 03:09:17,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2022-04-15 03:09:17,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:17,837 INFO L225 Difference]: With dead ends: 53 [2022-04-15 03:09:17,837 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 03:09:17,840 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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-15 03:09:17,844 INFO L913 BasicCegarLoop]: 34 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, 34 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-15 03:09:17,845 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:09:17,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 03:09:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 03:09:17,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:09:17,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 03:09:17,878 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 03:09:17,878 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 03:09:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:17,889 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 03:09:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 03:09:17,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:17,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:17,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-15 03:09:17,891 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-15 03:09:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:17,895 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 03:09:17,895 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 03:09:17,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:17,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:17,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:09:17,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:09:17,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 03:09:17,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-15 03:09:17,899 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-15 03:09:17,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:09:17,900 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-15 03:09:17,900 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 03:09:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 03:09:17,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 03:09:17,902 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:17,902 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:09:17,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 03:09:18,120 WARN L460 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-15 03:09:18,121 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:18,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:18,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1669026344, now seen corresponding path program 1 times [2022-04-15 03:09:18,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:18,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977006696] [2022-04-15 03:09:18,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:18,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:18,145 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:09:18,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2029318972] [2022-04-15 03:09:18,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:18,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:18,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:18,147 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:09:18,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 03:09:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:18,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 03:09:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:18,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:09:18,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-15 03:09:18,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #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] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:18,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:18,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264#(<= ~counter~0 0)} {256#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:18,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {264#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:18,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {264#(<= ~counter~0 0)} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:18,425 INFO L272 TraceCheckUtils]: 6: Hoare triple {264#(<= ~counter~0 0)} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:18,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L9: 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] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:18,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#(<= ~counter~0 0)} [81] L9-->L9-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[] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:18,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(<= ~counter~0 0)} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:18,427 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:18,428 INFO L272 TraceCheckUtils]: 11: Hoare triple {264#(<= ~counter~0 0)} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:18,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {264#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L9: 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] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:18,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {264#(<= ~counter~0 0)} [81] L9-->L9-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[] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:18,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {264#(<= ~counter~0 0)} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:18,430 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:18,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {264#(<= ~counter~0 0)} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:18,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {264#(<= ~counter~0 0)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {313#(<= |main_#t~post6| 0)} is VALID [2022-04-15 03:09:18,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {313#(<= |main_#t~post6| 0)} [86] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {257#false} is VALID [2022-04-15 03:09:18,433 INFO L272 TraceCheckUtils]: 19: Hoare triple {257#false} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {257#false} is VALID [2022-04-15 03:09:18,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {257#false} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {257#false} is VALID [2022-04-15 03:09:18,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {257#false} [92] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {257#false} is VALID [2022-04-15 03:09:18,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {257#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#false} is VALID [2022-04-15 03:09:18,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 03:09:18,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:09:18,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:09:18,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977006696] [2022-04-15 03:09:18,435 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:09:18,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029318972] [2022-04-15 03:09:18,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029318972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:09:18,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:09:18,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 03:09:18,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545229342] [2022-04-15 03:09:18,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:09:18,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 03:09:18,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:09:18,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 03:09:18,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:18,457 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 03:09:18,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:09:18,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 03:09:18,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 03:09:18,458 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 03:09:18,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:18,522 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 03:09:18,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 03:09:18,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 03:09:18,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:09:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 03:09:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 03:09:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 03:09:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 03:09:18,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-15 03:09:18,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:18,562 INFO L225 Difference]: With dead ends: 34 [2022-04-15 03:09:18,562 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 03:09:18,563 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 03:09:18,564 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:09:18,564 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:09:18,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 03:09:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 03:09:18,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:09:18,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 03:09:18,576 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 03:09:18,577 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 03:09:18,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:18,582 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 03:09:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 03:09:18,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:18,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:18,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-15 03:09:18,584 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-15 03:09:18,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:18,589 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 03:09:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 03:09:18,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:18,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:18,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:09:18,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:09:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 03:09:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-15 03:09:18,600 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-15 03:09:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:09:18,602 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-15 03:09:18,602 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 03:09:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 03:09:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 03:09:18,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:18,604 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:09:18,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 03:09:18,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-15 03:09:18,824 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:18,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:18,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1667953868, now seen corresponding path program 1 times [2022-04-15 03:09:18,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:18,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925815423] [2022-04-15 03:09:18,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:18,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:18,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:09:18,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141343997] [2022-04-15 03:09:18,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:18,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:18,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:18,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:09:18,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 03:09:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:18,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 03:09:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:18,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:09:19,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {469#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#true} is VALID [2022-04-15 03:09:19,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #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] {469#true} is VALID [2022-04-15 03:09:19,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#true} is VALID [2022-04-15 03:09:19,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {469#true} {469#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#true} is VALID [2022-04-15 03:09:19,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {469#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#true} is VALID [2022-04-15 03:09:19,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {469#true} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {469#true} is VALID [2022-04-15 03:09:19,335 INFO L272 TraceCheckUtils]: 6: Hoare triple {469#true} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {469#true} is VALID [2022-04-15 03:09:19,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#true} [78] assume_abort_if_notENTRY-->L9: 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] {469#true} is VALID [2022-04-15 03:09:19,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {469#true} [81] L9-->L9-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[] {469#true} is VALID [2022-04-15 03:09:19,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {469#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#true} is VALID [2022-04-15 03:09:19,335 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {469#true} {469#true} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {469#true} is VALID [2022-04-15 03:09:19,336 INFO L272 TraceCheckUtils]: 11: Hoare triple {469#true} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {469#true} is VALID [2022-04-15 03:09:19,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {469#true} [78] assume_abort_if_notENTRY-->L9: 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] {469#true} is VALID [2022-04-15 03:09:19,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#true} [81] L9-->L9-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[] {469#true} is VALID [2022-04-15 03:09:19,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#true} is VALID [2022-04-15 03:09:19,336 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {469#true} {469#true} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {469#true} is VALID [2022-04-15 03:09:21,342 WARN L290 TraceCheckUtils]: 16: Hoare triple {469#true} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is UNKNOWN [2022-04-15 03:09:21,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-15 03:09:21,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-15 03:09:22,563 INFO L272 TraceCheckUtils]: 19: Hoare triple {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:09:22,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {532#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:09:22,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {536#(<= 1 __VERIFIER_assert_~cond)} [92] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {470#false} is VALID [2022-04-15 03:09:22,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {470#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {470#false} is VALID [2022-04-15 03:09:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 03:09:22,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:09:22,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:09:22,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925815423] [2022-04-15 03:09:22,565 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:09:22,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141343997] [2022-04-15 03:09:22,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141343997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:09:22,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:09:22,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 03:09:22,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872367957] [2022-04-15 03:09:22,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:09:22,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 03:09:22,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:09:22,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 03:09:24,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:24,427 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 03:09:24,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:09:24,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 03:09:24,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 03:09:24,428 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 03:09:26,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 03:09:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:29,533 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-15 03:09:29,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 03:09:29,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 03:09:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:09:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 03:09:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-15 03:09:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 03:09:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-15 03:09:29,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-15 03:09:32,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:32,592 INFO L225 Difference]: With dead ends: 39 [2022-04-15 03:09:32,592 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 03:09:32,592 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 03:09:32,593 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:09:32,593 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 03:09:32,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 03:09:32,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-15 03:09:32,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:09:32,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 03:09:32,613 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 03:09:32,613 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 03:09:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:32,615 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-15 03:09:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-15 03:09:32,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:32,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:32,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-04-15 03:09:32,616 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-04-15 03:09:32,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:32,617 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-15 03:09:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-15 03:09:32,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:32,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:32,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:09:32,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:09:32,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 03:09:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-15 03:09:32,619 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2022-04-15 03:09:32,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:09:32,620 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-15 03:09:32,620 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 03:09:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-15 03:09:32,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 03:09:32,620 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:32,621 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:09:32,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 03:09:32,821 WARN L460 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-15 03:09:32,821 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:32,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:32,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1179905874, now seen corresponding path program 1 times [2022-04-15 03:09:32,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:32,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310140050] [2022-04-15 03:09:32,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:32,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:32,836 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:09:32,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269355335] [2022-04-15 03:09:32,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:32,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:32,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:32,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:09:32,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 03:09:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:32,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 03:09:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:32,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:09:33,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {724#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {724#true} is VALID [2022-04-15 03:09:33,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {724#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #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] {724#true} is VALID [2022-04-15 03:09:33,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {724#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {724#true} is VALID [2022-04-15 03:09:33,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {724#true} is VALID [2022-04-15 03:09:33,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {724#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {724#true} is VALID [2022-04-15 03:09:33,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#true} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {724#true} is VALID [2022-04-15 03:09:33,065 INFO L272 TraceCheckUtils]: 6: Hoare triple {724#true} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {724#true} is VALID [2022-04-15 03:09:33,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {724#true} [78] assume_abort_if_notENTRY-->L9: 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] {724#true} is VALID [2022-04-15 03:09:33,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#true} [81] L9-->L9-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[] {724#true} is VALID [2022-04-15 03:09:33,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {724#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {724#true} is VALID [2022-04-15 03:09:33,066 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {724#true} {724#true} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {724#true} is VALID [2022-04-15 03:09:33,066 INFO L272 TraceCheckUtils]: 11: Hoare triple {724#true} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {724#true} is VALID [2022-04-15 03:09:33,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#true} [78] assume_abort_if_notENTRY-->L9: 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] {724#true} is VALID [2022-04-15 03:09:33,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#true} [81] L9-->L9-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[] {724#true} is VALID [2022-04-15 03:09:33,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {724#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {724#true} is VALID [2022-04-15 03:09:33,067 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {724#true} {724#true} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {724#true} is VALID [2022-04-15 03:09:33,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {724#true} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {724#true} is VALID [2022-04-15 03:09:33,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {724#true} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {724#true} is VALID [2022-04-15 03:09:33,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {724#true} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {724#true} is VALID [2022-04-15 03:09:33,069 INFO L272 TraceCheckUtils]: 19: Hoare triple {724#true} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {724#true} is VALID [2022-04-15 03:09:33,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {724#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {789#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:09:33,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {789#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [93] L12-->L12-2: Formula: (not (= 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[] {793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:09:33,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {793#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:09:33,071 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {793#(not (= |__VERIFIER_assert_#in~cond| 0))} {724#true} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {800#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-15 03:09:33,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {800#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} [94] L35-1-->L34-3: Formula: (= v_main_~r~0_8 0) InVars {main_~r~0=v_main_~r~0_8} OutVars{main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {804#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-15 03:09:33,072 INFO L272 TraceCheckUtils]: 25: Hoare triple {804#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {808#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:09:33,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {808#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {812#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:09:33,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {812#(<= 1 __VERIFIER_assert_~cond)} [92] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {725#false} is VALID [2022-04-15 03:09:33,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {725#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {725#false} is VALID [2022-04-15 03:09:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 03:09:33,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:09:33,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {725#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {725#false} is VALID [2022-04-15 03:09:33,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {812#(<= 1 __VERIFIER_assert_~cond)} [92] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {725#false} is VALID [2022-04-15 03:09:33,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {808#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {812#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:09:33,496 INFO L272 TraceCheckUtils]: 25: Hoare triple {804#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {808#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:09:33,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {831#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} [94] L35-1-->L34-3: Formula: (= v_main_~r~0_8 0) InVars {main_~r~0=v_main_~r~0_8} OutVars{main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {804#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-15 03:09:33,498 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {793#(not (= |__VERIFIER_assert_#in~cond| 0))} {724#true} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {831#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-15 03:09:33,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {793#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:09:33,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {844#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [93] L12-->L12-2: Formula: (not (= 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[] {793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:09:33,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {724#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {844#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 03:09:33,501 INFO L272 TraceCheckUtils]: 19: Hoare triple {724#true} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {724#true} is VALID [2022-04-15 03:09:33,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {724#true} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {724#true} is VALID [2022-04-15 03:09:33,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {724#true} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {724#true} is VALID [2022-04-15 03:09:33,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {724#true} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {724#true} is VALID [2022-04-15 03:09:33,501 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {724#true} {724#true} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {724#true} is VALID [2022-04-15 03:09:33,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {724#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {724#true} is VALID [2022-04-15 03:09:33,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#true} [81] L9-->L9-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[] {724#true} is VALID [2022-04-15 03:09:33,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#true} [78] assume_abort_if_notENTRY-->L9: 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] {724#true} is VALID [2022-04-15 03:09:33,502 INFO L272 TraceCheckUtils]: 11: Hoare triple {724#true} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {724#true} is VALID [2022-04-15 03:09:33,502 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {724#true} {724#true} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {724#true} is VALID [2022-04-15 03:09:33,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {724#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {724#true} is VALID [2022-04-15 03:09:33,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#true} [81] L9-->L9-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[] {724#true} is VALID [2022-04-15 03:09:33,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {724#true} [78] assume_abort_if_notENTRY-->L9: 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] {724#true} is VALID [2022-04-15 03:09:33,503 INFO L272 TraceCheckUtils]: 6: Hoare triple {724#true} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {724#true} is VALID [2022-04-15 03:09:33,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#true} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {724#true} is VALID [2022-04-15 03:09:33,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {724#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {724#true} is VALID [2022-04-15 03:09:33,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {724#true} is VALID [2022-04-15 03:09:33,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {724#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {724#true} is VALID [2022-04-15 03:09:33,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {724#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #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] {724#true} is VALID [2022-04-15 03:09:33,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {724#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {724#true} is VALID [2022-04-15 03:09:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 03:09:33,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:09:33,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310140050] [2022-04-15 03:09:33,504 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:09:33,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269355335] [2022-04-15 03:09:33,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269355335] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:09:33,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:09:33,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 03:09:33,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011656057] [2022-04-15 03:09:33,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:09:33,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-15 03:09:33,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:09:33,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 03:09:33,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:33,538 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 03:09:33,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:09:33,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 03:09:33,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 03:09:33,539 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 03:09:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:33,799 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-15 03:09:33,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 03:09:33,800 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-15 03:09:33,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:09:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 03:09:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-15 03:09:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 03:09:33,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-15 03:09:33,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-15 03:09:33,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:33,844 INFO L225 Difference]: With dead ends: 43 [2022-04-15 03:09:33,844 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 03:09:33,845 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 03:09:33,845 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 03:09:33,846 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 109 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 03:09:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 03:09:33,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2022-04-15 03:09:33,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:09:33,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 03:09:33,862 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 03:09:33,862 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 03:09:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:33,866 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-15 03:09:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-15 03:09:33,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:33,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:33,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 38 states. [2022-04-15 03:09:33,871 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 38 states. [2022-04-15 03:09:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:33,875 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-15 03:09:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-15 03:09:33,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:33,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:33,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:09:33,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:09:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 03:09:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-15 03:09:33,876 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-15 03:09:33,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:09:33,876 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-15 03:09:33,877 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 03:09:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 03:09:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 03:09:33,878 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:33,879 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:09:33,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 03:09:34,087 WARN L460 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-15 03:09:34,087 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:34,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:34,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1668946595, now seen corresponding path program 1 times [2022-04-15 03:09:34,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:34,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958060248] [2022-04-15 03:09:34,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:34,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:34,098 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:09:34,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1268685640] [2022-04-15 03:09:34,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:34,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:34,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:34,100 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:09:34,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 03:09:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:34,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 03:09:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:34,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:09:34,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {1091#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1091#true} is VALID [2022-04-15 03:09:34,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {1091#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #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] {1099#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:34,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1099#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:34,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1099#(<= ~counter~0 0)} {1091#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1099#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:34,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {1099#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1099#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:34,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#(<= ~counter~0 0)} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {1099#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:34,276 INFO L272 TraceCheckUtils]: 6: Hoare triple {1099#(<= ~counter~0 0)} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1099#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:34,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L9: 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] {1099#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:34,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#(<= ~counter~0 0)} [81] L9-->L9-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[] {1099#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:34,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {1099#(<= ~counter~0 0)} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1099#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:34,277 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1099#(<= ~counter~0 0)} {1099#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1099#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:34,277 INFO L272 TraceCheckUtils]: 11: Hoare triple {1099#(<= ~counter~0 0)} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1099#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:34,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {1099#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L9: 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] {1099#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:34,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {1099#(<= ~counter~0 0)} [81] L9-->L9-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[] {1099#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:34,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {1099#(<= ~counter~0 0)} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1099#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:34,279 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1099#(<= ~counter~0 0)} {1099#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1099#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:34,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {1099#(<= ~counter~0 0)} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {1099#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:34,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {1099#(<= ~counter~0 0)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1148#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:34,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {1148#(<= ~counter~0 1)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1148#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:34,282 INFO L272 TraceCheckUtils]: 19: Hoare triple {1148#(<= ~counter~0 1)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1148#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:34,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {1148#(<= ~counter~0 1)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1148#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:34,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {1148#(<= ~counter~0 1)} [93] L12-->L12-2: Formula: (not (= 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[] {1148#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:34,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {1148#(<= ~counter~0 1)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1148#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:34,284 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1148#(<= ~counter~0 1)} {1148#(<= ~counter~0 1)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1148#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:34,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {1148#(<= ~counter~0 1)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1148#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:34,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {1148#(<= ~counter~0 1)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1148#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:34,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {1148#(<= ~counter~0 1)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1176#(<= |main_#t~post6| 1)} is VALID [2022-04-15 03:09:34,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {1176#(<= |main_#t~post6| 1)} [86] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1092#false} is VALID [2022-04-15 03:09:34,285 INFO L272 TraceCheckUtils]: 28: Hoare triple {1092#false} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {1092#false} is VALID [2022-04-15 03:09:34,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {1092#false} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1092#false} is VALID [2022-04-15 03:09:34,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {1092#false} [92] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1092#false} is VALID [2022-04-15 03:09:34,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {1092#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1092#false} is VALID [2022-04-15 03:09:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 03:09:34,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:09:34,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {1092#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1092#false} is VALID [2022-04-15 03:09:34,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {1092#false} [92] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1092#false} is VALID [2022-04-15 03:09:34,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {1092#false} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1092#false} is VALID [2022-04-15 03:09:34,432 INFO L272 TraceCheckUtils]: 28: Hoare triple {1092#false} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {1092#false} is VALID [2022-04-15 03:09:34,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {1204#(< |main_#t~post6| 20)} [86] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1092#false} is VALID [2022-04-15 03:09:34,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {1208#(< ~counter~0 20)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1204#(< |main_#t~post6| 20)} is VALID [2022-04-15 03:09:34,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {1208#(< ~counter~0 20)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1208#(< ~counter~0 20)} is VALID [2022-04-15 03:09:34,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {1208#(< ~counter~0 20)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1208#(< ~counter~0 20)} is VALID [2022-04-15 03:09:34,434 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1091#true} {1208#(< ~counter~0 20)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1208#(< ~counter~0 20)} is VALID [2022-04-15 03:09:34,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {1091#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1091#true} is VALID [2022-04-15 03:09:34,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {1091#true} [93] L12-->L12-2: Formula: (not (= 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[] {1091#true} is VALID [2022-04-15 03:09:34,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {1091#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1091#true} is VALID [2022-04-15 03:09:34,435 INFO L272 TraceCheckUtils]: 19: Hoare triple {1208#(< ~counter~0 20)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1091#true} is VALID [2022-04-15 03:09:34,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {1208#(< ~counter~0 20)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1208#(< ~counter~0 20)} is VALID [2022-04-15 03:09:34,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {1236#(< ~counter~0 19)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1208#(< ~counter~0 20)} is VALID [2022-04-15 03:09:34,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {1236#(< ~counter~0 19)} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {1236#(< ~counter~0 19)} is VALID [2022-04-15 03:09:34,441 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1091#true} {1236#(< ~counter~0 19)} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1236#(< ~counter~0 19)} is VALID [2022-04-15 03:09:34,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {1091#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1091#true} is VALID [2022-04-15 03:09:34,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {1091#true} [81] L9-->L9-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[] {1091#true} is VALID [2022-04-15 03:09:34,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {1091#true} [78] assume_abort_if_notENTRY-->L9: 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] {1091#true} is VALID [2022-04-15 03:09:34,441 INFO L272 TraceCheckUtils]: 11: Hoare triple {1236#(< ~counter~0 19)} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1091#true} is VALID [2022-04-15 03:09:34,442 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1091#true} {1236#(< ~counter~0 19)} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1236#(< ~counter~0 19)} is VALID [2022-04-15 03:09:34,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {1091#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1091#true} is VALID [2022-04-15 03:09:34,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {1091#true} [81] L9-->L9-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[] {1091#true} is VALID [2022-04-15 03:09:34,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {1091#true} [78] assume_abort_if_notENTRY-->L9: 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] {1091#true} is VALID [2022-04-15 03:09:34,442 INFO L272 TraceCheckUtils]: 6: Hoare triple {1236#(< ~counter~0 19)} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1091#true} is VALID [2022-04-15 03:09:34,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {1236#(< ~counter~0 19)} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {1236#(< ~counter~0 19)} is VALID [2022-04-15 03:09:34,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {1236#(< ~counter~0 19)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1236#(< ~counter~0 19)} is VALID [2022-04-15 03:09:34,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1236#(< ~counter~0 19)} {1091#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1236#(< ~counter~0 19)} is VALID [2022-04-15 03:09:34,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {1236#(< ~counter~0 19)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1236#(< ~counter~0 19)} is VALID [2022-04-15 03:09:34,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {1091#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #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] {1236#(< ~counter~0 19)} is VALID [2022-04-15 03:09:34,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {1091#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1091#true} is VALID [2022-04-15 03:09:34,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 03:09:34,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:09:34,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958060248] [2022-04-15 03:09:34,450 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:09:34,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268685640] [2022-04-15 03:09:34,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268685640] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:09:34,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:09:34,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 03:09:34,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822797917] [2022-04-15 03:09:34,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:09:34,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-15 03:09:34,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:09:34,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 03:09:34,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:34,501 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 03:09:34,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:09:34,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 03:09:34,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 03:09:34,502 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 03:09:34,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:34,666 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-15 03:09:34,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 03:09:34,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-15 03:09:34,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:09:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 03:09:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-15 03:09:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 03:09:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-15 03:09:34,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-15 03:09:34,735 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-15 03:09:34,737 INFO L225 Difference]: With dead ends: 61 [2022-04-15 03:09:34,737 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 03:09:34,738 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-15 03:09:34,741 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:09:34,741 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 94 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:09:34,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 03:09:34,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-15 03:09:34,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:09:34,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 03:09:34,763 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 03:09:34,777 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 03:09:34,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:34,779 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-15 03:09:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 03:09:34,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:34,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:34,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-15 03:09:34,780 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-15 03:09:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:34,781 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-15 03:09:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 03:09:34,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:34,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:34,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:09:34,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:09:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 03:09:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-15 03:09:34,783 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-04-15 03:09:34,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:09:34,784 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-15 03:09:34,784 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 03:09:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 03:09:34,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 03:09:34,785 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:34,785 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:09:34,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 03:09:34,985 WARN L460 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-15 03:09:34,985 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:34,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:34,986 INFO L85 PathProgramCache]: Analyzing trace with hash -906969448, now seen corresponding path program 2 times [2022-04-15 03:09:34,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:34,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028456048] [2022-04-15 03:09:34,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:34,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:34,999 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:09:35,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406655092] [2022-04-15 03:09:35,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 03:09:35,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:35,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:35,001 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:09:35,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 03:09:35,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 03:09:35,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 03:09:35,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 03:09:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:35,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:09:35,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {1571#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1571#true} is VALID [2022-04-15 03:09:35,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {1571#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #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] {1579#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {1579#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1579#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1579#(<= ~counter~0 0)} {1571#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1579#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {1579#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1579#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {1579#(<= ~counter~0 0)} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {1579#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,406 INFO L272 TraceCheckUtils]: 6: Hoare triple {1579#(<= ~counter~0 0)} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1579#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {1579#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L9: 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] {1579#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {1579#(<= ~counter~0 0)} [81] L9-->L9-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[] {1579#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {1579#(<= ~counter~0 0)} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1579#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,408 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1579#(<= ~counter~0 0)} {1579#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1579#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,409 INFO L272 TraceCheckUtils]: 11: Hoare triple {1579#(<= ~counter~0 0)} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1579#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {1579#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L9: 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] {1579#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {1579#(<= ~counter~0 0)} [81] L9-->L9-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[] {1579#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {1579#(<= ~counter~0 0)} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1579#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,410 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1579#(<= ~counter~0 0)} {1579#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1579#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {1579#(<= ~counter~0 0)} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {1579#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {1579#(<= ~counter~0 0)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1628#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {1628#(<= ~counter~0 1)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1628#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,412 INFO L272 TraceCheckUtils]: 19: Hoare triple {1628#(<= ~counter~0 1)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1628#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {1628#(<= ~counter~0 1)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1628#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {1628#(<= ~counter~0 1)} [93] L12-->L12-2: Formula: (not (= 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[] {1628#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {1628#(<= ~counter~0 1)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1628#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,414 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1628#(<= ~counter~0 1)} {1628#(<= ~counter~0 1)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1628#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {1628#(<= ~counter~0 1)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1628#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {1628#(<= ~counter~0 1)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1628#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {1628#(<= ~counter~0 1)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1656#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:35,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {1656#(<= ~counter~0 2)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1656#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:35,416 INFO L272 TraceCheckUtils]: 28: Hoare triple {1656#(<= ~counter~0 2)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1656#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:35,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {1656#(<= ~counter~0 2)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1656#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:35,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {1656#(<= ~counter~0 2)} [93] L12-->L12-2: Formula: (not (= 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[] {1656#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:35,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {1656#(<= ~counter~0 2)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1656#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:35,418 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1656#(<= ~counter~0 2)} {1656#(<= ~counter~0 2)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1656#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:35,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {1656#(<= ~counter~0 2)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1656#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:35,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {1656#(<= ~counter~0 2)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1656#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:35,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {1656#(<= ~counter~0 2)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1684#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:35,419 INFO L290 TraceCheckUtils]: 36: Hoare triple {1684#(<= ~counter~0 3)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1684#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:35,420 INFO L272 TraceCheckUtils]: 37: Hoare triple {1684#(<= ~counter~0 3)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1684#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:35,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {1684#(<= ~counter~0 3)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1684#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:35,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {1684#(<= ~counter~0 3)} [93] L12-->L12-2: Formula: (not (= 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[] {1684#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:35,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {1684#(<= ~counter~0 3)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1684#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:35,424 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1684#(<= ~counter~0 3)} {1684#(<= ~counter~0 3)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1684#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:35,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {1684#(<= ~counter~0 3)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1684#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:35,425 INFO L290 TraceCheckUtils]: 43: Hoare triple {1684#(<= ~counter~0 3)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1684#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:35,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {1684#(<= ~counter~0 3)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1712#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:35,426 INFO L290 TraceCheckUtils]: 45: Hoare triple {1712#(<= ~counter~0 4)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1712#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:35,426 INFO L272 TraceCheckUtils]: 46: Hoare triple {1712#(<= ~counter~0 4)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1712#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:35,426 INFO L290 TraceCheckUtils]: 47: Hoare triple {1712#(<= ~counter~0 4)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1712#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:35,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {1712#(<= ~counter~0 4)} [93] L12-->L12-2: Formula: (not (= 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[] {1712#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:35,427 INFO L290 TraceCheckUtils]: 49: Hoare triple {1712#(<= ~counter~0 4)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:35,427 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1712#(<= ~counter~0 4)} {1712#(<= ~counter~0 4)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1712#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:35,428 INFO L290 TraceCheckUtils]: 51: Hoare triple {1712#(<= ~counter~0 4)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1712#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:35,433 INFO L290 TraceCheckUtils]: 52: Hoare triple {1712#(<= ~counter~0 4)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1712#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:35,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {1712#(<= ~counter~0 4)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1740#(<= |main_#t~post6| 4)} is VALID [2022-04-15 03:09:35,434 INFO L290 TraceCheckUtils]: 54: Hoare triple {1740#(<= |main_#t~post6| 4)} [86] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1572#false} is VALID [2022-04-15 03:09:35,435 INFO L272 TraceCheckUtils]: 55: Hoare triple {1572#false} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {1572#false} is VALID [2022-04-15 03:09:35,437 INFO L290 TraceCheckUtils]: 56: Hoare triple {1572#false} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1572#false} is VALID [2022-04-15 03:09:35,438 INFO L290 TraceCheckUtils]: 57: Hoare triple {1572#false} [92] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1572#false} is VALID [2022-04-15 03:09:35,438 INFO L290 TraceCheckUtils]: 58: Hoare triple {1572#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1572#false} is VALID [2022-04-15 03:09:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 03:09:35,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:09:35,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {1572#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1572#false} is VALID [2022-04-15 03:09:35,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {1572#false} [92] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1572#false} is VALID [2022-04-15 03:09:35,731 INFO L290 TraceCheckUtils]: 56: Hoare triple {1572#false} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1572#false} is VALID [2022-04-15 03:09:35,731 INFO L272 TraceCheckUtils]: 55: Hoare triple {1572#false} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {1572#false} is VALID [2022-04-15 03:09:35,732 INFO L290 TraceCheckUtils]: 54: Hoare triple {1768#(< |main_#t~post6| 20)} [86] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1572#false} is VALID [2022-04-15 03:09:35,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {1772#(< ~counter~0 20)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1768#(< |main_#t~post6| 20)} is VALID [2022-04-15 03:09:35,735 INFO L290 TraceCheckUtils]: 52: Hoare triple {1772#(< ~counter~0 20)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1772#(< ~counter~0 20)} is VALID [2022-04-15 03:09:35,736 INFO L290 TraceCheckUtils]: 51: Hoare triple {1772#(< ~counter~0 20)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1772#(< ~counter~0 20)} is VALID [2022-04-15 03:09:35,737 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1571#true} {1772#(< ~counter~0 20)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1772#(< ~counter~0 20)} is VALID [2022-04-15 03:09:35,737 INFO L290 TraceCheckUtils]: 49: Hoare triple {1571#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1571#true} is VALID [2022-04-15 03:09:35,737 INFO L290 TraceCheckUtils]: 48: Hoare triple {1571#true} [93] L12-->L12-2: Formula: (not (= 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[] {1571#true} is VALID [2022-04-15 03:09:35,737 INFO L290 TraceCheckUtils]: 47: Hoare triple {1571#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1571#true} is VALID [2022-04-15 03:09:35,738 INFO L272 TraceCheckUtils]: 46: Hoare triple {1772#(< ~counter~0 20)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1571#true} is VALID [2022-04-15 03:09:35,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {1772#(< ~counter~0 20)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1772#(< ~counter~0 20)} is VALID [2022-04-15 03:09:35,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {1800#(< ~counter~0 19)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1772#(< ~counter~0 20)} is VALID [2022-04-15 03:09:35,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {1800#(< ~counter~0 19)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1800#(< ~counter~0 19)} is VALID [2022-04-15 03:09:35,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {1800#(< ~counter~0 19)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1800#(< ~counter~0 19)} is VALID [2022-04-15 03:09:35,740 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1571#true} {1800#(< ~counter~0 19)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1800#(< ~counter~0 19)} is VALID [2022-04-15 03:09:35,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {1571#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1571#true} is VALID [2022-04-15 03:09:35,740 INFO L290 TraceCheckUtils]: 39: Hoare triple {1571#true} [93] L12-->L12-2: Formula: (not (= 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[] {1571#true} is VALID [2022-04-15 03:09:35,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {1571#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1571#true} is VALID [2022-04-15 03:09:35,741 INFO L272 TraceCheckUtils]: 37: Hoare triple {1800#(< ~counter~0 19)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1571#true} is VALID [2022-04-15 03:09:35,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {1800#(< ~counter~0 19)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1800#(< ~counter~0 19)} is VALID [2022-04-15 03:09:35,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#(< ~counter~0 18)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1800#(< ~counter~0 19)} is VALID [2022-04-15 03:09:35,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {1828#(< ~counter~0 18)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1828#(< ~counter~0 18)} is VALID [2022-04-15 03:09:35,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {1828#(< ~counter~0 18)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1828#(< ~counter~0 18)} is VALID [2022-04-15 03:09:35,743 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1571#true} {1828#(< ~counter~0 18)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1828#(< ~counter~0 18)} is VALID [2022-04-15 03:09:35,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {1571#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1571#true} is VALID [2022-04-15 03:09:35,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {1571#true} [93] L12-->L12-2: Formula: (not (= 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[] {1571#true} is VALID [2022-04-15 03:09:35,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {1571#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1571#true} is VALID [2022-04-15 03:09:35,743 INFO L272 TraceCheckUtils]: 28: Hoare triple {1828#(< ~counter~0 18)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1571#true} is VALID [2022-04-15 03:09:35,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {1828#(< ~counter~0 18)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1828#(< ~counter~0 18)} is VALID [2022-04-15 03:09:35,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {1856#(< ~counter~0 17)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1828#(< ~counter~0 18)} is VALID [2022-04-15 03:09:35,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {1856#(< ~counter~0 17)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1856#(< ~counter~0 17)} is VALID [2022-04-15 03:09:35,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {1856#(< ~counter~0 17)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1856#(< ~counter~0 17)} is VALID [2022-04-15 03:09:35,745 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1571#true} {1856#(< ~counter~0 17)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1856#(< ~counter~0 17)} is VALID [2022-04-15 03:09:35,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {1571#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1571#true} is VALID [2022-04-15 03:09:35,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {1571#true} [93] L12-->L12-2: Formula: (not (= 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[] {1571#true} is VALID [2022-04-15 03:09:35,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {1571#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1571#true} is VALID [2022-04-15 03:09:35,746 INFO L272 TraceCheckUtils]: 19: Hoare triple {1856#(< ~counter~0 17)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1571#true} is VALID [2022-04-15 03:09:35,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {1856#(< ~counter~0 17)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1856#(< ~counter~0 17)} is VALID [2022-04-15 03:09:35,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {1884#(< ~counter~0 16)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1856#(< ~counter~0 17)} is VALID [2022-04-15 03:09:35,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {1884#(< ~counter~0 16)} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {1884#(< ~counter~0 16)} is VALID [2022-04-15 03:09:35,747 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1571#true} {1884#(< ~counter~0 16)} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1884#(< ~counter~0 16)} is VALID [2022-04-15 03:09:35,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {1571#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1571#true} is VALID [2022-04-15 03:09:35,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {1571#true} [81] L9-->L9-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[] {1571#true} is VALID [2022-04-15 03:09:35,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {1571#true} [78] assume_abort_if_notENTRY-->L9: 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] {1571#true} is VALID [2022-04-15 03:09:35,748 INFO L272 TraceCheckUtils]: 11: Hoare triple {1884#(< ~counter~0 16)} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1571#true} is VALID [2022-04-15 03:09:35,749 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1571#true} {1884#(< ~counter~0 16)} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1884#(< ~counter~0 16)} is VALID [2022-04-15 03:09:35,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {1571#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1571#true} is VALID [2022-04-15 03:09:35,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {1571#true} [81] L9-->L9-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[] {1571#true} is VALID [2022-04-15 03:09:35,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {1571#true} [78] assume_abort_if_notENTRY-->L9: 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] {1571#true} is VALID [2022-04-15 03:09:35,749 INFO L272 TraceCheckUtils]: 6: Hoare triple {1884#(< ~counter~0 16)} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1571#true} is VALID [2022-04-15 03:09:35,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {1884#(< ~counter~0 16)} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {1884#(< ~counter~0 16)} is VALID [2022-04-15 03:09:35,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {1884#(< ~counter~0 16)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1884#(< ~counter~0 16)} is VALID [2022-04-15 03:09:35,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1884#(< ~counter~0 16)} {1571#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1884#(< ~counter~0 16)} is VALID [2022-04-15 03:09:35,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {1884#(< ~counter~0 16)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1884#(< ~counter~0 16)} is VALID [2022-04-15 03:09:35,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {1571#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #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] {1884#(< ~counter~0 16)} is VALID [2022-04-15 03:09:35,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {1571#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1571#true} is VALID [2022-04-15 03:09:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 03:09:35,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:09:35,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028456048] [2022-04-15 03:09:35,752 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:09:35,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406655092] [2022-04-15 03:09:35,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406655092] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:09:35,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:09:35,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 03:09:35,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250872098] [2022-04-15 03:09:35,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:09:35,754 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-15 03:09:35,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:09:35,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-15 03:09:35,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:35,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 03:09:35,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:09:35,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 03:09:35,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 03:09:35,833 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-15 03:09:36,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:36,211 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2022-04-15 03:09:36,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 03:09:36,211 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-15 03:09:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:09:36,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-15 03:09:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-15 03:09:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-15 03:09:36,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-15 03:09:36,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 130 transitions. [2022-04-15 03:09:36,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:36,419 INFO L225 Difference]: With dead ends: 115 [2022-04-15 03:09:36,419 INFO L226 Difference]: Without dead ends: 110 [2022-04-15 03:09:36,419 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-15 03:09:36,420 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 80 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 03:09:36,420 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 160 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 03:09:36,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-15 03:09:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-15 03:09:36,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:09:36,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 03:09:36,471 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 03:09:36,471 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 03:09:36,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:36,474 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-15 03:09:36,474 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-15 03:09:36,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:36,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:36,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-15 03:09:36,475 INFO L87 Difference]: Start difference. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-15 03:09:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:36,478 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-15 03:09:36,479 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-15 03:09:36,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:36,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:36,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:09:36,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:09:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 03:09:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-15 03:09:36,482 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-04-15 03:09:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:09:36,483 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-15 03:09:36,483 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-15 03:09:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-15 03:09:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 03:09:36,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:36,484 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:09:36,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 03:09:36,695 WARN L460 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-15 03:09:36,696 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:36,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash 191644600, now seen corresponding path program 3 times [2022-04-15 03:09:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:36,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789760745] [2022-04-15 03:09:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:36,726 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:09:36,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [654155394] [2022-04-15 03:09:36,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-15 03:09:36,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:36,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:36,730 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-15 03:09:36,746 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-15 03:09:39,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-15 03:09:39,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 03:09:39,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 03:09:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:39,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:09:39,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {2483#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2483#true} is VALID [2022-04-15 03:09:39,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {2483#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #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] {2491#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:39,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {2491#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2491#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:39,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2491#(<= ~counter~0 0)} {2483#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2491#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:39,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {2491#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2491#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:39,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {2491#(<= ~counter~0 0)} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {2491#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:39,744 INFO L272 TraceCheckUtils]: 6: Hoare triple {2491#(<= ~counter~0 0)} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {2491#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:39,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {2491#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L9: 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] {2491#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:39,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {2491#(<= ~counter~0 0)} [81] L9-->L9-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[] {2491#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:39,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {2491#(<= ~counter~0 0)} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2491#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:39,747 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2491#(<= ~counter~0 0)} {2491#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {2491#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:39,747 INFO L272 TraceCheckUtils]: 11: Hoare triple {2491#(<= ~counter~0 0)} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2491#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:39,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {2491#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L9: 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] {2491#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:39,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {2491#(<= ~counter~0 0)} [81] L9-->L9-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[] {2491#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:39,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {2491#(<= ~counter~0 0)} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2491#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:39,749 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2491#(<= ~counter~0 0)} {2491#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2491#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:39,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {2491#(<= ~counter~0 0)} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {2491#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:39,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {2491#(<= ~counter~0 0)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2540#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:39,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {2540#(<= ~counter~0 1)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2540#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:39,751 INFO L272 TraceCheckUtils]: 19: Hoare triple {2540#(<= ~counter~0 1)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2540#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:39,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {2540#(<= ~counter~0 1)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2540#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:39,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {2540#(<= ~counter~0 1)} [93] L12-->L12-2: Formula: (not (= 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[] {2540#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:39,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {2540#(<= ~counter~0 1)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2540#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:39,752 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2540#(<= ~counter~0 1)} {2540#(<= ~counter~0 1)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2540#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:39,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {2540#(<= ~counter~0 1)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2540#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:39,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {2540#(<= ~counter~0 1)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2540#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:39,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {2540#(<= ~counter~0 1)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2568#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:39,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {2568#(<= ~counter~0 2)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2568#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:39,755 INFO L272 TraceCheckUtils]: 28: Hoare triple {2568#(<= ~counter~0 2)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2568#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:39,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {2568#(<= ~counter~0 2)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2568#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:39,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {2568#(<= ~counter~0 2)} [93] L12-->L12-2: Formula: (not (= 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[] {2568#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:39,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {2568#(<= ~counter~0 2)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2568#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:39,757 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2568#(<= ~counter~0 2)} {2568#(<= ~counter~0 2)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2568#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:39,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {2568#(<= ~counter~0 2)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2568#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:39,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {2568#(<= ~counter~0 2)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2568#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:39,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {2568#(<= ~counter~0 2)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2596#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:39,759 INFO L290 TraceCheckUtils]: 36: Hoare triple {2596#(<= ~counter~0 3)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2596#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:39,759 INFO L272 TraceCheckUtils]: 37: Hoare triple {2596#(<= ~counter~0 3)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2596#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:39,760 INFO L290 TraceCheckUtils]: 38: Hoare triple {2596#(<= ~counter~0 3)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2596#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:39,760 INFO L290 TraceCheckUtils]: 39: Hoare triple {2596#(<= ~counter~0 3)} [93] L12-->L12-2: Formula: (not (= 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[] {2596#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:39,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {2596#(<= ~counter~0 3)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2596#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:39,761 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2596#(<= ~counter~0 3)} {2596#(<= ~counter~0 3)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2596#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:39,761 INFO L290 TraceCheckUtils]: 42: Hoare triple {2596#(<= ~counter~0 3)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2596#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:39,761 INFO L290 TraceCheckUtils]: 43: Hoare triple {2596#(<= ~counter~0 3)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2596#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:39,762 INFO L290 TraceCheckUtils]: 44: Hoare triple {2596#(<= ~counter~0 3)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2624#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:39,762 INFO L290 TraceCheckUtils]: 45: Hoare triple {2624#(<= ~counter~0 4)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2624#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:39,763 INFO L272 TraceCheckUtils]: 46: Hoare triple {2624#(<= ~counter~0 4)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2624#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:39,763 INFO L290 TraceCheckUtils]: 47: Hoare triple {2624#(<= ~counter~0 4)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2624#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:39,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {2624#(<= ~counter~0 4)} [93] L12-->L12-2: Formula: (not (= 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[] {2624#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:39,764 INFO L290 TraceCheckUtils]: 49: Hoare triple {2624#(<= ~counter~0 4)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2624#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:39,764 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2624#(<= ~counter~0 4)} {2624#(<= ~counter~0 4)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2624#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:39,765 INFO L290 TraceCheckUtils]: 51: Hoare triple {2624#(<= ~counter~0 4)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2624#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:39,765 INFO L290 TraceCheckUtils]: 52: Hoare triple {2624#(<= ~counter~0 4)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2624#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:39,765 INFO L290 TraceCheckUtils]: 53: Hoare triple {2624#(<= ~counter~0 4)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2652#(<= ~counter~0 5)} is VALID [2022-04-15 03:09:39,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {2652#(<= ~counter~0 5)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2652#(<= ~counter~0 5)} is VALID [2022-04-15 03:09:39,767 INFO L272 TraceCheckUtils]: 55: Hoare triple {2652#(<= ~counter~0 5)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2652#(<= ~counter~0 5)} is VALID [2022-04-15 03:09:39,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {2652#(<= ~counter~0 5)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2652#(<= ~counter~0 5)} is VALID [2022-04-15 03:09:39,767 INFO L290 TraceCheckUtils]: 57: Hoare triple {2652#(<= ~counter~0 5)} [93] L12-->L12-2: Formula: (not (= 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[] {2652#(<= ~counter~0 5)} is VALID [2022-04-15 03:09:39,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {2652#(<= ~counter~0 5)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2652#(<= ~counter~0 5)} is VALID [2022-04-15 03:09:39,768 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2652#(<= ~counter~0 5)} {2652#(<= ~counter~0 5)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2652#(<= ~counter~0 5)} is VALID [2022-04-15 03:09:39,769 INFO L290 TraceCheckUtils]: 60: Hoare triple {2652#(<= ~counter~0 5)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2652#(<= ~counter~0 5)} is VALID [2022-04-15 03:09:39,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {2652#(<= ~counter~0 5)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2652#(<= ~counter~0 5)} is VALID [2022-04-15 03:09:39,771 INFO L290 TraceCheckUtils]: 62: Hoare triple {2652#(<= ~counter~0 5)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2680#(<= ~counter~0 6)} is VALID [2022-04-15 03:09:39,772 INFO L290 TraceCheckUtils]: 63: Hoare triple {2680#(<= ~counter~0 6)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2680#(<= ~counter~0 6)} is VALID [2022-04-15 03:09:39,772 INFO L272 TraceCheckUtils]: 64: Hoare triple {2680#(<= ~counter~0 6)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2680#(<= ~counter~0 6)} is VALID [2022-04-15 03:09:39,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {2680#(<= ~counter~0 6)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2680#(<= ~counter~0 6)} is VALID [2022-04-15 03:09:39,776 INFO L290 TraceCheckUtils]: 66: Hoare triple {2680#(<= ~counter~0 6)} [93] L12-->L12-2: Formula: (not (= 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[] {2680#(<= ~counter~0 6)} is VALID [2022-04-15 03:09:39,776 INFO L290 TraceCheckUtils]: 67: Hoare triple {2680#(<= ~counter~0 6)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2680#(<= ~counter~0 6)} is VALID [2022-04-15 03:09:39,777 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2680#(<= ~counter~0 6)} {2680#(<= ~counter~0 6)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2680#(<= ~counter~0 6)} is VALID [2022-04-15 03:09:39,777 INFO L290 TraceCheckUtils]: 69: Hoare triple {2680#(<= ~counter~0 6)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2680#(<= ~counter~0 6)} is VALID [2022-04-15 03:09:39,778 INFO L290 TraceCheckUtils]: 70: Hoare triple {2680#(<= ~counter~0 6)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2680#(<= ~counter~0 6)} is VALID [2022-04-15 03:09:39,778 INFO L290 TraceCheckUtils]: 71: Hoare triple {2680#(<= ~counter~0 6)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2708#(<= ~counter~0 7)} is VALID [2022-04-15 03:09:39,779 INFO L290 TraceCheckUtils]: 72: Hoare triple {2708#(<= ~counter~0 7)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2708#(<= ~counter~0 7)} is VALID [2022-04-15 03:09:39,780 INFO L272 TraceCheckUtils]: 73: Hoare triple {2708#(<= ~counter~0 7)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2708#(<= ~counter~0 7)} is VALID [2022-04-15 03:09:39,780 INFO L290 TraceCheckUtils]: 74: Hoare triple {2708#(<= ~counter~0 7)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2708#(<= ~counter~0 7)} is VALID [2022-04-15 03:09:39,781 INFO L290 TraceCheckUtils]: 75: Hoare triple {2708#(<= ~counter~0 7)} [93] L12-->L12-2: Formula: (not (= 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[] {2708#(<= ~counter~0 7)} is VALID [2022-04-15 03:09:39,781 INFO L290 TraceCheckUtils]: 76: Hoare triple {2708#(<= ~counter~0 7)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2708#(<= ~counter~0 7)} is VALID [2022-04-15 03:09:39,781 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2708#(<= ~counter~0 7)} {2708#(<= ~counter~0 7)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2708#(<= ~counter~0 7)} is VALID [2022-04-15 03:09:39,782 INFO L290 TraceCheckUtils]: 78: Hoare triple {2708#(<= ~counter~0 7)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2708#(<= ~counter~0 7)} is VALID [2022-04-15 03:09:39,782 INFO L290 TraceCheckUtils]: 79: Hoare triple {2708#(<= ~counter~0 7)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2708#(<= ~counter~0 7)} is VALID [2022-04-15 03:09:39,783 INFO L290 TraceCheckUtils]: 80: Hoare triple {2708#(<= ~counter~0 7)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2736#(<= ~counter~0 8)} is VALID [2022-04-15 03:09:39,783 INFO L290 TraceCheckUtils]: 81: Hoare triple {2736#(<= ~counter~0 8)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2736#(<= ~counter~0 8)} is VALID [2022-04-15 03:09:39,783 INFO L272 TraceCheckUtils]: 82: Hoare triple {2736#(<= ~counter~0 8)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2736#(<= ~counter~0 8)} is VALID [2022-04-15 03:09:39,784 INFO L290 TraceCheckUtils]: 83: Hoare triple {2736#(<= ~counter~0 8)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2736#(<= ~counter~0 8)} is VALID [2022-04-15 03:09:39,784 INFO L290 TraceCheckUtils]: 84: Hoare triple {2736#(<= ~counter~0 8)} [93] L12-->L12-2: Formula: (not (= 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[] {2736#(<= ~counter~0 8)} is VALID [2022-04-15 03:09:39,784 INFO L290 TraceCheckUtils]: 85: Hoare triple {2736#(<= ~counter~0 8)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2736#(<= ~counter~0 8)} is VALID [2022-04-15 03:09:39,785 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {2736#(<= ~counter~0 8)} {2736#(<= ~counter~0 8)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2736#(<= ~counter~0 8)} is VALID [2022-04-15 03:09:39,785 INFO L290 TraceCheckUtils]: 87: Hoare triple {2736#(<= ~counter~0 8)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2736#(<= ~counter~0 8)} is VALID [2022-04-15 03:09:39,786 INFO L290 TraceCheckUtils]: 88: Hoare triple {2736#(<= ~counter~0 8)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2736#(<= ~counter~0 8)} is VALID [2022-04-15 03:09:39,786 INFO L290 TraceCheckUtils]: 89: Hoare triple {2736#(<= ~counter~0 8)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:39,786 INFO L290 TraceCheckUtils]: 90: Hoare triple {2764#(<= ~counter~0 9)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:39,787 INFO L272 TraceCheckUtils]: 91: Hoare triple {2764#(<= ~counter~0 9)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:39,787 INFO L290 TraceCheckUtils]: 92: Hoare triple {2764#(<= ~counter~0 9)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:39,788 INFO L290 TraceCheckUtils]: 93: Hoare triple {2764#(<= ~counter~0 9)} [93] L12-->L12-2: Formula: (not (= 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[] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:39,788 INFO L290 TraceCheckUtils]: 94: Hoare triple {2764#(<= ~counter~0 9)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:39,789 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {2764#(<= ~counter~0 9)} {2764#(<= ~counter~0 9)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:39,789 INFO L290 TraceCheckUtils]: 96: Hoare triple {2764#(<= ~counter~0 9)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:39,789 INFO L290 TraceCheckUtils]: 97: Hoare triple {2764#(<= ~counter~0 9)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:39,790 INFO L290 TraceCheckUtils]: 98: Hoare triple {2764#(<= ~counter~0 9)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2792#(<= ~counter~0 10)} is VALID [2022-04-15 03:09:39,790 INFO L290 TraceCheckUtils]: 99: Hoare triple {2792#(<= ~counter~0 10)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2792#(<= ~counter~0 10)} is VALID [2022-04-15 03:09:39,791 INFO L272 TraceCheckUtils]: 100: Hoare triple {2792#(<= ~counter~0 10)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2792#(<= ~counter~0 10)} is VALID [2022-04-15 03:09:39,791 INFO L290 TraceCheckUtils]: 101: Hoare triple {2792#(<= ~counter~0 10)} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2792#(<= ~counter~0 10)} is VALID [2022-04-15 03:09:39,792 INFO L290 TraceCheckUtils]: 102: Hoare triple {2792#(<= ~counter~0 10)} [93] L12-->L12-2: Formula: (not (= 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[] {2792#(<= ~counter~0 10)} is VALID [2022-04-15 03:09:39,792 INFO L290 TraceCheckUtils]: 103: Hoare triple {2792#(<= ~counter~0 10)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2792#(<= ~counter~0 10)} is VALID [2022-04-15 03:09:39,793 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2792#(<= ~counter~0 10)} {2792#(<= ~counter~0 10)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2792#(<= ~counter~0 10)} is VALID [2022-04-15 03:09:39,793 INFO L290 TraceCheckUtils]: 105: Hoare triple {2792#(<= ~counter~0 10)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2792#(<= ~counter~0 10)} is VALID [2022-04-15 03:09:39,793 INFO L290 TraceCheckUtils]: 106: Hoare triple {2792#(<= ~counter~0 10)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2792#(<= ~counter~0 10)} is VALID [2022-04-15 03:09:39,794 INFO L290 TraceCheckUtils]: 107: Hoare triple {2792#(<= ~counter~0 10)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2820#(<= |main_#t~post6| 10)} is VALID [2022-04-15 03:09:39,794 INFO L290 TraceCheckUtils]: 108: Hoare triple {2820#(<= |main_#t~post6| 10)} [86] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2484#false} is VALID [2022-04-15 03:09:39,794 INFO L272 TraceCheckUtils]: 109: Hoare triple {2484#false} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {2484#false} is VALID [2022-04-15 03:09:39,794 INFO L290 TraceCheckUtils]: 110: Hoare triple {2484#false} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2484#false} is VALID [2022-04-15 03:09:39,794 INFO L290 TraceCheckUtils]: 111: Hoare triple {2484#false} [92] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2484#false} is VALID [2022-04-15 03:09:39,795 INFO L290 TraceCheckUtils]: 112: Hoare triple {2484#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#false} is VALID [2022-04-15 03:09:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 03:09:39,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:09:40,532 INFO L290 TraceCheckUtils]: 112: Hoare triple {2484#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#false} is VALID [2022-04-15 03:09:40,532 INFO L290 TraceCheckUtils]: 111: Hoare triple {2484#false} [92] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2484#false} is VALID [2022-04-15 03:09:40,532 INFO L290 TraceCheckUtils]: 110: Hoare triple {2484#false} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2484#false} is VALID [2022-04-15 03:09:40,532 INFO L272 TraceCheckUtils]: 109: Hoare triple {2484#false} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {2484#false} is VALID [2022-04-15 03:09:40,532 INFO L290 TraceCheckUtils]: 108: Hoare triple {2848#(< |main_#t~post6| 20)} [86] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2484#false} is VALID [2022-04-15 03:09:40,533 INFO L290 TraceCheckUtils]: 107: Hoare triple {2852#(< ~counter~0 20)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2848#(< |main_#t~post6| 20)} is VALID [2022-04-15 03:09:40,533 INFO L290 TraceCheckUtils]: 106: Hoare triple {2852#(< ~counter~0 20)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2852#(< ~counter~0 20)} is VALID [2022-04-15 03:09:40,533 INFO L290 TraceCheckUtils]: 105: Hoare triple {2852#(< ~counter~0 20)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2852#(< ~counter~0 20)} is VALID [2022-04-15 03:09:40,534 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2483#true} {2852#(< ~counter~0 20)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2852#(< ~counter~0 20)} is VALID [2022-04-15 03:09:40,534 INFO L290 TraceCheckUtils]: 103: Hoare triple {2483#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2483#true} is VALID [2022-04-15 03:09:40,534 INFO L290 TraceCheckUtils]: 102: Hoare triple {2483#true} [93] L12-->L12-2: Formula: (not (= 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[] {2483#true} is VALID [2022-04-15 03:09:40,534 INFO L290 TraceCheckUtils]: 101: Hoare triple {2483#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2483#true} is VALID [2022-04-15 03:09:40,534 INFO L272 TraceCheckUtils]: 100: Hoare triple {2852#(< ~counter~0 20)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2483#true} is VALID [2022-04-15 03:09:40,535 INFO L290 TraceCheckUtils]: 99: Hoare triple {2852#(< ~counter~0 20)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2852#(< ~counter~0 20)} is VALID [2022-04-15 03:09:40,535 INFO L290 TraceCheckUtils]: 98: Hoare triple {2880#(< ~counter~0 19)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2852#(< ~counter~0 20)} is VALID [2022-04-15 03:09:40,536 INFO L290 TraceCheckUtils]: 97: Hoare triple {2880#(< ~counter~0 19)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2880#(< ~counter~0 19)} is VALID [2022-04-15 03:09:40,536 INFO L290 TraceCheckUtils]: 96: Hoare triple {2880#(< ~counter~0 19)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2880#(< ~counter~0 19)} is VALID [2022-04-15 03:09:40,536 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {2483#true} {2880#(< ~counter~0 19)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2880#(< ~counter~0 19)} is VALID [2022-04-15 03:09:40,536 INFO L290 TraceCheckUtils]: 94: Hoare triple {2483#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2483#true} is VALID [2022-04-15 03:09:40,537 INFO L290 TraceCheckUtils]: 93: Hoare triple {2483#true} [93] L12-->L12-2: Formula: (not (= 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[] {2483#true} is VALID [2022-04-15 03:09:40,537 INFO L290 TraceCheckUtils]: 92: Hoare triple {2483#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2483#true} is VALID [2022-04-15 03:09:40,537 INFO L272 TraceCheckUtils]: 91: Hoare triple {2880#(< ~counter~0 19)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2483#true} is VALID [2022-04-15 03:09:40,537 INFO L290 TraceCheckUtils]: 90: Hoare triple {2880#(< ~counter~0 19)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2880#(< ~counter~0 19)} is VALID [2022-04-15 03:09:40,537 INFO L290 TraceCheckUtils]: 89: Hoare triple {2908#(< ~counter~0 18)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2880#(< ~counter~0 19)} is VALID [2022-04-15 03:09:40,538 INFO L290 TraceCheckUtils]: 88: Hoare triple {2908#(< ~counter~0 18)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2908#(< ~counter~0 18)} is VALID [2022-04-15 03:09:40,538 INFO L290 TraceCheckUtils]: 87: Hoare triple {2908#(< ~counter~0 18)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2908#(< ~counter~0 18)} is VALID [2022-04-15 03:09:40,539 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {2483#true} {2908#(< ~counter~0 18)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2908#(< ~counter~0 18)} is VALID [2022-04-15 03:09:40,539 INFO L290 TraceCheckUtils]: 85: Hoare triple {2483#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2483#true} is VALID [2022-04-15 03:09:40,539 INFO L290 TraceCheckUtils]: 84: Hoare triple {2483#true} [93] L12-->L12-2: Formula: (not (= 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[] {2483#true} is VALID [2022-04-15 03:09:40,539 INFO L290 TraceCheckUtils]: 83: Hoare triple {2483#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2483#true} is VALID [2022-04-15 03:09:40,539 INFO L272 TraceCheckUtils]: 82: Hoare triple {2908#(< ~counter~0 18)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2483#true} is VALID [2022-04-15 03:09:40,539 INFO L290 TraceCheckUtils]: 81: Hoare triple {2908#(< ~counter~0 18)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2908#(< ~counter~0 18)} is VALID [2022-04-15 03:09:40,540 INFO L290 TraceCheckUtils]: 80: Hoare triple {2936#(< ~counter~0 17)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2908#(< ~counter~0 18)} is VALID [2022-04-15 03:09:40,540 INFO L290 TraceCheckUtils]: 79: Hoare triple {2936#(< ~counter~0 17)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2936#(< ~counter~0 17)} is VALID [2022-04-15 03:09:40,540 INFO L290 TraceCheckUtils]: 78: Hoare triple {2936#(< ~counter~0 17)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2936#(< ~counter~0 17)} is VALID [2022-04-15 03:09:40,541 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2483#true} {2936#(< ~counter~0 17)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2936#(< ~counter~0 17)} is VALID [2022-04-15 03:09:40,541 INFO L290 TraceCheckUtils]: 76: Hoare triple {2483#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2483#true} is VALID [2022-04-15 03:09:40,541 INFO L290 TraceCheckUtils]: 75: Hoare triple {2483#true} [93] L12-->L12-2: Formula: (not (= 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[] {2483#true} is VALID [2022-04-15 03:09:40,541 INFO L290 TraceCheckUtils]: 74: Hoare triple {2483#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2483#true} is VALID [2022-04-15 03:09:40,541 INFO L272 TraceCheckUtils]: 73: Hoare triple {2936#(< ~counter~0 17)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2483#true} is VALID [2022-04-15 03:09:40,541 INFO L290 TraceCheckUtils]: 72: Hoare triple {2936#(< ~counter~0 17)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2936#(< ~counter~0 17)} is VALID [2022-04-15 03:09:40,542 INFO L290 TraceCheckUtils]: 71: Hoare triple {2964#(< ~counter~0 16)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2936#(< ~counter~0 17)} is VALID [2022-04-15 03:09:40,542 INFO L290 TraceCheckUtils]: 70: Hoare triple {2964#(< ~counter~0 16)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2964#(< ~counter~0 16)} is VALID [2022-04-15 03:09:40,543 INFO L290 TraceCheckUtils]: 69: Hoare triple {2964#(< ~counter~0 16)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2964#(< ~counter~0 16)} is VALID [2022-04-15 03:09:40,543 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2483#true} {2964#(< ~counter~0 16)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2964#(< ~counter~0 16)} is VALID [2022-04-15 03:09:40,543 INFO L290 TraceCheckUtils]: 67: Hoare triple {2483#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2483#true} is VALID [2022-04-15 03:09:40,543 INFO L290 TraceCheckUtils]: 66: Hoare triple {2483#true} [93] L12-->L12-2: Formula: (not (= 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[] {2483#true} is VALID [2022-04-15 03:09:40,543 INFO L290 TraceCheckUtils]: 65: Hoare triple {2483#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2483#true} is VALID [2022-04-15 03:09:40,543 INFO L272 TraceCheckUtils]: 64: Hoare triple {2964#(< ~counter~0 16)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2483#true} is VALID [2022-04-15 03:09:40,544 INFO L290 TraceCheckUtils]: 63: Hoare triple {2964#(< ~counter~0 16)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2964#(< ~counter~0 16)} is VALID [2022-04-15 03:09:40,544 INFO L290 TraceCheckUtils]: 62: Hoare triple {2992#(< ~counter~0 15)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2964#(< ~counter~0 16)} is VALID [2022-04-15 03:09:40,544 INFO L290 TraceCheckUtils]: 61: Hoare triple {2992#(< ~counter~0 15)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2992#(< ~counter~0 15)} is VALID [2022-04-15 03:09:40,545 INFO L290 TraceCheckUtils]: 60: Hoare triple {2992#(< ~counter~0 15)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2992#(< ~counter~0 15)} is VALID [2022-04-15 03:09:40,545 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2483#true} {2992#(< ~counter~0 15)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2992#(< ~counter~0 15)} is VALID [2022-04-15 03:09:40,545 INFO L290 TraceCheckUtils]: 58: Hoare triple {2483#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2483#true} is VALID [2022-04-15 03:09:40,545 INFO L290 TraceCheckUtils]: 57: Hoare triple {2483#true} [93] L12-->L12-2: Formula: (not (= 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[] {2483#true} is VALID [2022-04-15 03:09:40,546 INFO L290 TraceCheckUtils]: 56: Hoare triple {2483#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2483#true} is VALID [2022-04-15 03:09:40,546 INFO L272 TraceCheckUtils]: 55: Hoare triple {2992#(< ~counter~0 15)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2483#true} is VALID [2022-04-15 03:09:40,546 INFO L290 TraceCheckUtils]: 54: Hoare triple {2992#(< ~counter~0 15)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2992#(< ~counter~0 15)} is VALID [2022-04-15 03:09:40,546 INFO L290 TraceCheckUtils]: 53: Hoare triple {3020#(< ~counter~0 14)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2992#(< ~counter~0 15)} is VALID [2022-04-15 03:09:40,547 INFO L290 TraceCheckUtils]: 52: Hoare triple {3020#(< ~counter~0 14)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {3020#(< ~counter~0 14)} is VALID [2022-04-15 03:09:40,547 INFO L290 TraceCheckUtils]: 51: Hoare triple {3020#(< ~counter~0 14)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {3020#(< ~counter~0 14)} is VALID [2022-04-15 03:09:40,548 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2483#true} {3020#(< ~counter~0 14)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {3020#(< ~counter~0 14)} is VALID [2022-04-15 03:09:40,548 INFO L290 TraceCheckUtils]: 49: Hoare triple {2483#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2483#true} is VALID [2022-04-15 03:09:40,548 INFO L290 TraceCheckUtils]: 48: Hoare triple {2483#true} [93] L12-->L12-2: Formula: (not (= 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[] {2483#true} is VALID [2022-04-15 03:09:40,548 INFO L290 TraceCheckUtils]: 47: Hoare triple {2483#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2483#true} is VALID [2022-04-15 03:09:40,548 INFO L272 TraceCheckUtils]: 46: Hoare triple {3020#(< ~counter~0 14)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2483#true} is VALID [2022-04-15 03:09:40,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {3020#(< ~counter~0 14)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3020#(< ~counter~0 14)} is VALID [2022-04-15 03:09:40,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {3048#(< ~counter~0 13)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3020#(< ~counter~0 14)} is VALID [2022-04-15 03:09:40,549 INFO L290 TraceCheckUtils]: 43: Hoare triple {3048#(< ~counter~0 13)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {3048#(< ~counter~0 13)} is VALID [2022-04-15 03:09:40,549 INFO L290 TraceCheckUtils]: 42: Hoare triple {3048#(< ~counter~0 13)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {3048#(< ~counter~0 13)} is VALID [2022-04-15 03:09:40,550 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2483#true} {3048#(< ~counter~0 13)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {3048#(< ~counter~0 13)} is VALID [2022-04-15 03:09:40,550 INFO L290 TraceCheckUtils]: 40: Hoare triple {2483#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2483#true} is VALID [2022-04-15 03:09:40,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {2483#true} [93] L12-->L12-2: Formula: (not (= 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[] {2483#true} is VALID [2022-04-15 03:09:40,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {2483#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2483#true} is VALID [2022-04-15 03:09:40,550 INFO L272 TraceCheckUtils]: 37: Hoare triple {3048#(< ~counter~0 13)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2483#true} is VALID [2022-04-15 03:09:40,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {3048#(< ~counter~0 13)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3048#(< ~counter~0 13)} is VALID [2022-04-15 03:09:40,551 INFO L290 TraceCheckUtils]: 35: Hoare triple {3076#(< ~counter~0 12)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3048#(< ~counter~0 13)} is VALID [2022-04-15 03:09:40,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {3076#(< ~counter~0 12)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {3076#(< ~counter~0 12)} is VALID [2022-04-15 03:09:40,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {3076#(< ~counter~0 12)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {3076#(< ~counter~0 12)} is VALID [2022-04-15 03:09:40,552 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2483#true} {3076#(< ~counter~0 12)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {3076#(< ~counter~0 12)} is VALID [2022-04-15 03:09:40,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {2483#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2483#true} is VALID [2022-04-15 03:09:40,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {2483#true} [93] L12-->L12-2: Formula: (not (= 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[] {2483#true} is VALID [2022-04-15 03:09:40,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {2483#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2483#true} is VALID [2022-04-15 03:09:40,552 INFO L272 TraceCheckUtils]: 28: Hoare triple {3076#(< ~counter~0 12)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2483#true} is VALID [2022-04-15 03:09:40,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {3076#(< ~counter~0 12)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3076#(< ~counter~0 12)} is VALID [2022-04-15 03:09:40,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {2792#(<= ~counter~0 10)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3076#(< ~counter~0 12)} is VALID [2022-04-15 03:09:40,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {2792#(<= ~counter~0 10)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2792#(<= ~counter~0 10)} is VALID [2022-04-15 03:09:40,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {2792#(<= ~counter~0 10)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2792#(<= ~counter~0 10)} is VALID [2022-04-15 03:09:40,555 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2483#true} {2792#(<= ~counter~0 10)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2792#(<= ~counter~0 10)} is VALID [2022-04-15 03:09:40,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {2483#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2483#true} is VALID [2022-04-15 03:09:40,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {2483#true} [93] L12-->L12-2: Formula: (not (= 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[] {2483#true} is VALID [2022-04-15 03:09:40,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {2483#true} [89] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2483#true} is VALID [2022-04-15 03:09:40,556 INFO L272 TraceCheckUtils]: 19: Hoare triple {2792#(<= ~counter~0 10)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2483#true} is VALID [2022-04-15 03:09:40,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {2792#(<= ~counter~0 10)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2792#(<= ~counter~0 10)} is VALID [2022-04-15 03:09:40,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {2764#(<= ~counter~0 9)} [83] L38-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2792#(<= ~counter~0 10)} is VALID [2022-04-15 03:09:40,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {2764#(<= ~counter~0 9)} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:40,557 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2483#true} {2764#(<= ~counter~0 9)} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:40,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {2483#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2483#true} is VALID [2022-04-15 03:09:40,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {2483#true} [81] L9-->L9-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[] {2483#true} is VALID [2022-04-15 03:09:40,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {2483#true} [78] assume_abort_if_notENTRY-->L9: 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] {2483#true} is VALID [2022-04-15 03:09:40,557 INFO L272 TraceCheckUtils]: 11: Hoare triple {2764#(<= ~counter~0 9)} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2483#true} is VALID [2022-04-15 03:09:40,558 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2483#true} {2764#(<= ~counter~0 9)} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:40,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {2483#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2483#true} is VALID [2022-04-15 03:09:40,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {2483#true} [81] L9-->L9-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[] {2483#true} is VALID [2022-04-15 03:09:40,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {2483#true} [78] assume_abort_if_notENTRY-->L9: 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] {2483#true} is VALID [2022-04-15 03:09:40,558 INFO L272 TraceCheckUtils]: 6: Hoare triple {2764#(<= ~counter~0 9)} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {2483#true} is VALID [2022-04-15 03:09:40,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {2764#(<= ~counter~0 9)} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:40,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {2764#(<= ~counter~0 9)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:40,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2764#(<= ~counter~0 9)} {2483#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:40,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {2764#(<= ~counter~0 9)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:40,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {2483#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #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] {2764#(<= ~counter~0 9)} is VALID [2022-04-15 03:09:40,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {2483#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2483#true} is VALID [2022-04-15 03:09:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 03:09:40,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:09:40,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789760745] [2022-04-15 03:09:40,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:09:40,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654155394] [2022-04-15 03:09:40,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654155394] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:09:40,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:09:40,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-15 03:09:40,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131470433] [2022-04-15 03:09:40,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:09:40,562 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) Word has length 113 [2022-04-15 03:09:40,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:09:40,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-15 03:09:40,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:40,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 03:09:40,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:09:40,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 03:09:40,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 03:09:40,717 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-15 03:09:41,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:41,614 INFO L93 Difference]: Finished difference Result 205 states and 235 transitions. [2022-04-15 03:09:41,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 03:09:41,614 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) Word has length 113 [2022-04-15 03:09:41,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:09:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-15 03:09:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 234 transitions. [2022-04-15 03:09:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-15 03:09:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 234 transitions. [2022-04-15 03:09:41,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 234 transitions. [2022-04-15 03:09:41,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:41,809 INFO L225 Difference]: With dead ends: 205 [2022-04-15 03:09:41,809 INFO L226 Difference]: Without dead ends: 200 [2022-04-15 03:09:41,810 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 03:09:41,810 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 187 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 03:09:41,811 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 284 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 03:09:41,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-15 03:09:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-04-15 03:09:41,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:09:41,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 03:09:41,887 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 03:09:41,887 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 03:09:41,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:41,892 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-04-15 03:09:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-15 03:09:41,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:41,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:41,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 200 states. [2022-04-15 03:09:41,893 INFO L87 Difference]: Start difference. First operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 200 states. [2022-04-15 03:09:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:41,897 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-04-15 03:09:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-15 03:09:41,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:41,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:41,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:09:41,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:09:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 03:09:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2022-04-15 03:09:41,902 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 113 [2022-04-15 03:09:41,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:09:41,902 INFO L478 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2022-04-15 03:09:41,902 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-15 03:09:41,902 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-15 03:09:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-04-15 03:09:41,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:41,904 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:09:41,910 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-15 03:09:42,110 WARN L460 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-15 03:09:42,111 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:42,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:42,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2040315496, now seen corresponding path program 4 times [2022-04-15 03:09:42,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:42,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318032568] [2022-04-15 03:09:42,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:42,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:42,135 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:09:42,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1992341522] [2022-04-15 03:09:42,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 03:09:42,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:42,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:42,147 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-15 03:09:42,148 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-15 03:09:42,340 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 03:09:42,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-15 03:09:42,340 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 03:09:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 03:09:42,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 03:09:42,585 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 03:09:42,585 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 03:09:42,598 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-15 03:09:42,794 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-15 03:09:42,796 INFO L719 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2022-04-15 03:09:42,799 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 03:09:42,871 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 03:09:42,872 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 03:09:42,873 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-15 03:09:42,873 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-15 03:09:42,873 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-15 03:09:42,873 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 03:09:42,873 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 03:09:42,873 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 03:09:42,873 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 03:09:42,873 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 03:09:42,873 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 03:09:42,873 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 03:09:42,873 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 03:09:42,873 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-15 03:09:42,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:09:42 BasicIcfg [2022-04-15 03:09:42,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 03:09:42,874 INFO L158 Benchmark]: Toolchain (without parser) took 26273.27ms. Allocated memory was 163.6MB in the beginning and 204.5MB in the end (delta: 40.9MB). Free memory was 111.7MB in the beginning and 82.5MB in the end (delta: 29.1MB). Peak memory consumption was 70.8MB. Max. memory is 8.0GB. [2022-04-15 03:09:42,874 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 163.6MB. Free memory was 128.3MB in the beginning and 128.2MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 03:09:42,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.13ms. Allocated memory is still 163.6MB. Free memory was 111.5MB in the beginning and 139.2MB in the end (delta: -27.7MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-04-15 03:09:42,875 INFO L158 Benchmark]: Boogie Preprocessor took 24.94ms. Allocated memory is still 163.6MB. Free memory was 139.2MB in the beginning and 137.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 03:09:42,875 INFO L158 Benchmark]: RCFGBuilder took 309.36ms. Allocated memory is still 163.6MB. Free memory was 137.7MB in the beginning and 126.1MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 03:09:42,875 INFO L158 Benchmark]: IcfgTransformer took 39.00ms. Allocated memory is still 163.6MB. Free memory was 126.1MB in the beginning and 124.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 03:09:42,875 INFO L158 Benchmark]: TraceAbstraction took 25623.98ms. Allocated memory was 163.6MB in the beginning and 204.5MB in the end (delta: 40.9MB). Free memory was 123.7MB in the beginning and 82.5MB in the end (delta: 41.1MB). Peak memory consumption was 82.9MB. Max. memory is 8.0GB. [2022-04-15 03:09:42,876 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.12ms. Allocated memory is still 163.6MB. Free memory was 128.3MB in the beginning and 128.2MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 269.13ms. Allocated memory is still 163.6MB. Free memory was 111.5MB in the beginning and 139.2MB in the end (delta: -27.7MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.94ms. Allocated memory is still 163.6MB. Free memory was 139.2MB in the beginning and 137.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 309.36ms. Allocated memory is still 163.6MB. Free memory was 137.7MB in the beginning and 126.1MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 39.00ms. Allocated memory is still 163.6MB. Free memory was 126.1MB in the beginning and 124.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 25623.98ms. Allocated memory was 163.6MB in the beginning and 204.5MB in the end (delta: 40.9MB). Free memory was 123.7MB in the beginning and 82.5MB in the end (delta: 41.1MB). Peak memory consumption was 82.9MB. 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: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [\old(counter)=26, counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(counter)=0, A=33127, counter=0, R=183] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [\old(counter)=0, A=33127, counter=0, R=183] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [\old(counter)=0, A=33127, counter=0, R=183, r=362, u=367, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=1, counter++=0, R=183, r=362, u=367, v=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=1, r=362, R=183, u=367, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=1, r=362, R=183, u=367, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=1, r=361, R=183, u=367, v=3] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=2, counter++=1, R=183, r=361, u=367, v=3] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=2, R=183, r=361, u=367, v=3] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=2, R=183, r=361, u=367, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=2, r=358, R=183, u=367, v=5] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=3, counter++=2, R=183, r=358, u=367, v=5] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=3, r=358, R=183, u=367, v=5] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=3, r=358, R=183, u=367, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=3, r=353, R=183, u=367, v=7] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=4, counter++=3, R=183, r=353, u=367, v=7] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=4, R=183, r=353, u=367, v=7] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=4, R=183, r=353, u=367, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=4, R=183, r=346, u=367, v=9] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=5, counter++=4, R=183, r=346, u=367, v=9] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=5, R=183, r=346, u=367, v=9] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=5, r=346, R=183, u=367, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=5, R=183, r=337, u=367, v=11] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=6, counter++=5, R=183, r=337, u=367, v=11] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=6, r=337, R=183, u=367, v=11] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=6, r=337, R=183, u=367, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=6, r=326, R=183, u=367, v=13] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=7, counter++=6, R=183, r=326, u=367, v=13] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=7, R=183, r=326, u=367, v=13] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=7, r=326, R=183, u=367, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=7, R=183, r=313, u=367, v=15] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=8, counter++=7, r=313, R=183, u=367, v=15] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=8, R=183, r=313, u=367, v=15] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=8, R=183, r=313, u=367, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=8, R=183, r=298, u=367, v=17] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=9, counter++=8, R=183, r=298, u=367, v=17] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=9, r=298, R=183, u=367, v=17] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=9, R=183, r=298, u=367, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=9, r=281, R=183, u=367, v=19] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=10, counter++=9, r=281, R=183, u=367, v=19] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=10, r=281, R=183, u=367, v=19] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=10, r=281, R=183, u=367, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=10, R=183, r=262, u=367, v=21] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=11, counter++=10, r=262, R=183, u=367, v=21] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=11, r=262, R=183, u=367, v=21] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=11, R=183, r=262, u=367, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=11, r=241, R=183, u=367, v=23] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=12, counter++=11, r=241, R=183, u=367, v=23] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=12, R=183, r=241, u=367, v=23] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=12, r=241, R=183, u=367, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=12, R=183, r=218, u=367, v=25] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=13, counter++=12, R=183, r=218, u=367, v=25] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=13, R=183, r=218, u=367, v=25] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=13, r=218, R=183, u=367, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=13, R=183, r=193, u=367, v=27] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=14, counter++=13, R=183, r=193, u=367, v=27] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=14, r=193, R=183, u=367, v=27] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=14, r=193, R=183, u=367, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=14, r=166, R=183, u=367, v=29] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=15, counter++=14, r=166, R=183, u=367, v=29] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=15, r=166, R=183, u=367, v=29] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=15, r=166, R=183, u=367, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=15, r=137, R=183, u=367, v=31] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=16, counter++=15, R=183, r=137, u=367, v=31] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=16, R=183, r=137, u=367, v=31] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=16, r=137, R=183, u=367, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=16, r=106, R=183, u=367, v=33] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=17, counter++=16, R=183, r=106, u=367, v=33] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=17, r=106, R=183, u=367, v=33] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=17, R=183, r=106, u=367, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=17, R=183, r=73, u=367, v=35] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=18, counter++=17, r=73, R=183, u=367, v=35] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=18, R=183, r=73, u=367, v=35] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=18, r=73, R=183, u=367, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=18, r=38, R=183, u=367, v=37] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=19, counter++=18, R=183, r=38, u=367, v=37] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=19, R=183, r=38, u=367, v=37] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=19, R=183, r=38, u=367, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=19, r=1, R=183, u=367, v=39] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=20, counter++=19, r=1, R=183, u=367, v=39] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=20, r=1, R=183, u=367, v=39] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=20, R=183, r=1, u=367, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=20, R=183, r=-38, u=367, v=41] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=21, counter++=20, r=-38, R=183, u=367, v=41] [L34] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.5s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 329 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 328 mSDsluCounter, 833 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 618 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 318 IncrementalHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 215 mSDtfsCounter, 318 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 472 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=7, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 523 ConstructedInterpolants, 0 QuantifiedInterpolants, 1335 SizeOfPredicates, 28 NumberOfNonLiveVariables, 958 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 310/1086 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-15 03:09:42,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...