/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/ps6-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 01:47:22,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 01:47:22,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 01:47:22,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 01:47:22,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 01:47:22,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 01:47:22,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 01:47:22,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 01:47:22,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 01:47:22,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 01:47:22,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 01:47:22,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 01:47:22,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 01:47:22,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 01:47:22,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 01:47:22,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 01:47:22,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 01:47:22,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 01:47:22,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 01:47:22,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 01:47:22,756 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 01:47:22,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 01:47:22,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 01:47:22,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 01:47:22,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 01:47:22,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 01:47:22,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 01:47:22,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 01:47:22,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 01:47:22,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 01:47:22,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 01:47:22,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 01:47:22,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 01:47:22,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 01:47:22,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 01:47:22,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 01:47:22,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 01:47:22,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 01:47:22,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 01:47:22,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 01:47:22,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 01:47:22,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 01:47:22,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-28 01:47:22,799 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 01:47:22,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 01:47:22,799 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-28 01:47:22,799 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-28 01:47:22,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-28 01:47:22,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-28 01:47:22,800 INFO L138 SettingsManager]: * Use SBE=true [2022-04-28 01:47:22,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 01:47:22,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 01:47:22,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 01:47:22,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 01:47:22,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 01:47:22,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 01:47:22,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 01:47:22,801 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 01:47:22,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 01:47:22,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 01:47:22,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 01:47:22,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 01:47:22,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 01:47:22,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 01:47:22,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-28 01:47:22,801 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-28 01:47:22,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-28 01:47:22,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-28 01:47:22,802 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 01:47:22,802 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-28 01:47:22,802 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-28 01:47:22,802 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-28 01:47:22,802 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-28 01:47:22,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 01:47:22,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 01:47:22,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 01:47:22,978 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 01:47:22,979 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 01:47:22,980 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound2.c [2022-04-28 01:47:23,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5378b823d/f8a5229171fc4036971c63a61ea73b96/FLAG405686eb2 [2022-04-28 01:47:23,374 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 01:47:23,374 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound2.c [2022-04-28 01:47:23,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5378b823d/f8a5229171fc4036971c63a61ea73b96/FLAG405686eb2 [2022-04-28 01:47:23,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5378b823d/f8a5229171fc4036971c63a61ea73b96 [2022-04-28 01:47:23,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 01:47:23,398 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-28 01:47:23,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 01:47:23,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 01:47:23,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 01:47:23,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:47:23" (1/1) ... [2022-04-28 01:47:23,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1519b53d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:47:23, skipping insertion in model container [2022-04-28 01:47:23,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:47:23" (1/1) ... [2022-04-28 01:47:23,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 01:47:23,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 01:47:23,570 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/ps6-ll_valuebound2.c[458,471] [2022-04-28 01:47:23,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 01:47:23,601 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 01:47:23,614 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/ps6-ll_valuebound2.c[458,471] [2022-04-28 01:47:23,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 01:47:23,637 INFO L208 MainTranslator]: Completed translation [2022-04-28 01:47:23,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:47:23 WrapperNode [2022-04-28 01:47:23,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 01:47:23,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 01:47:23,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 01:47:23,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 01:47:23,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:47:23" (1/1) ... [2022-04-28 01:47:23,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:47:23" (1/1) ... [2022-04-28 01:47:23,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:47:23" (1/1) ... [2022-04-28 01:47:23,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:47:23" (1/1) ... [2022-04-28 01:47:23,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:47:23" (1/1) ... [2022-04-28 01:47:23,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:47:23" (1/1) ... [2022-04-28 01:47:23,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:47:23" (1/1) ... [2022-04-28 01:47:23,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 01:47:23,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 01:47:23,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 01:47:23,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 01:47:23,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:47:23" (1/1) ... [2022-04-28 01:47:23,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 01:47:23,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:47:23,691 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-28 01:47:23,696 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-28 01:47:23,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 01:47:23,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 01:47:23,715 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 01:47:23,715 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 01:47:23,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 01:47:23,716 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 01:47:23,716 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 01:47:23,716 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 01:47:23,717 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 01:47:23,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 01:47:23,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 01:47:23,717 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 01:47:23,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 01:47:23,717 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 01:47:23,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 01:47:23,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 01:47:23,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 01:47:23,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 01:47:23,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 01:47:23,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 01:47:23,762 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 01:47:23,764 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 01:47:23,860 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 01:47:23,874 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 01:47:23,874 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 01:47:23,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:47:23 BoogieIcfgContainer [2022-04-28 01:47:23,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 01:47:23,876 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-28 01:47:23,876 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-28 01:47:23,892 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-28 01:47:23,894 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:47:23" (1/1) ... [2022-04-28 01:47:23,895 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-28 01:47:23,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 01:47:23 BasicIcfg [2022-04-28 01:47:23,918 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-28 01:47:23,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 01:47:23,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 01:47:23,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 01:47:23,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 01:47:23" (1/4) ... [2022-04-28 01:47:23,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf1d596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:47:23, skipping insertion in model container [2022-04-28 01:47:23,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:47:23" (2/4) ... [2022-04-28 01:47:23,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf1d596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:47:23, skipping insertion in model container [2022-04-28 01:47:23,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:47:23" (3/4) ... [2022-04-28 01:47:23,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf1d596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 01:47:23, skipping insertion in model container [2022-04-28 01:47:23,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 01:47:23" (4/4) ... [2022-04-28 01:47:23,925 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound2.cqvasr [2022-04-28 01:47:23,936 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-28 01:47:23,937 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 01:47:23,980 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 01:47:23,987 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@a0f4cfc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@27707f3c [2022-04-28 01:47:23,987 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 01:47:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:47:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 01:47:23,997 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:47:23,998 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:47:23,998 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:47:24,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:47:24,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1187991702, now seen corresponding path program 1 times [2022-04-28 01:47:24,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:47:24,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598149305] [2022-04-28 01:47:24,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:47:24,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:47:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:47:24,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 01:47:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:47:24,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-28 01:47:24,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-28 01:47:24,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-28 01:47:24,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 01:47:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:47:24,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} [74] assume_abort_if_notENTRY-->L7: 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] {32#true} is VALID [2022-04-28 01:47:24,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-28 01:47:24,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-28 01:47:24,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-28 01:47:24,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 01:47:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:47:24,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} [74] assume_abort_if_notENTRY-->L7: 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] {32#true} is VALID [2022-04-28 01:47:24,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-28 01:47:24,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-28 01:47:24,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-28 01:47:24,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 01:47:24,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-28 01:47:24,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-28 01:47:24,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-28 01:47:24,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-28 01:47:24,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {32#true} is VALID [2022-04-28 01:47:24,209 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {32#true} is VALID [2022-04-28 01:47:24,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} [74] assume_abort_if_notENTRY-->L7: 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] {32#true} is VALID [2022-04-28 01:47:24,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-28 01:47:24,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-28 01:47:24,211 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-28 01:47:24,211 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {32#true} is VALID [2022-04-28 01:47:24,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} [74] assume_abort_if_notENTRY-->L7: 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] {32#true} is VALID [2022-04-28 01:47:24,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-28 01:47:24,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-28 01:47:24,212 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-28 01:47:24,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {33#false} is VALID [2022-04-28 01:47:24,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-28 01:47:24,214 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {33#false} is VALID [2022-04-28 01:47:24,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {33#false} is VALID [2022-04-28 01:47:24,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-28 01:47:24,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-28 01:47:24,216 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-28 01:47:24,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:47:24,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598149305] [2022-04-28 01:47:24,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598149305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 01:47:24,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 01:47:24,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 01:47:24,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276069419] [2022-04-28 01:47:24,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:47:24,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 01:47:24,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:47:24,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 01:47:24,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:47:24,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 01:47:24,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:47:24,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 01:47:24,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 01:47:24,270 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 01:47:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:24,604 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-28 01:47:24,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 01:47:24,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 01:47:24,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:47:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 01:47:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-28 01:47:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 01:47:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-28 01:47:24,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-28 01:47:24,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:47:24,706 INFO L225 Difference]: With dead ends: 51 [2022-04-28 01:47:24,706 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 01:47:24,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 01:47:24,711 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:47:24,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:47:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 01:47:24,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 01:47:24,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:47:24,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:47:24,731 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:47:24,731 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:47:24,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:24,735 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 01:47:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 01:47:24,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:47:24,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:47:24,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-28 01:47:24,736 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-28 01:47:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:24,739 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 01:47:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 01:47:24,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:47:24,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:47:24,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:47:24,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:47:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:47:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 01:47:24,743 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-28 01:47:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:47:24,743 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 01:47:24,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 01:47:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 01:47:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 01:47:24,744 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:47:24,744 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:47:24,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 01:47:24,744 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:47:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:47:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash 793962506, now seen corresponding path program 1 times [2022-04-28 01:47:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:47:24,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929113475] [2022-04-28 01:47:24,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:47:24,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:47:24,764 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:47:24,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [475257162] [2022-04-28 01:47:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:47:24,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:47:24,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:47:24,769 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-28 01:47:24,769 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-28 01:47:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:47:24,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 01:47:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:47:24,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:47:24,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-28 01:47:24,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {202#true} is VALID [2022-04-28 01:47:24,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-28 01:47:24,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-28 01:47:24,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-28 01:47:24,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {202#true} is VALID [2022-04-28 01:47:24,981 INFO L272 TraceCheckUtils]: 6: Hoare triple {202#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {202#true} is VALID [2022-04-28 01:47:24,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#true} [74] assume_abort_if_notENTRY-->L7: 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] {202#true} is VALID [2022-04-28 01:47:24,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#true} [77] L7-->L7-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[] {202#true} is VALID [2022-04-28 01:47:24,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-28 01:47:24,982 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {202#true} {202#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {202#true} is VALID [2022-04-28 01:47:24,982 INFO L272 TraceCheckUtils]: 11: Hoare triple {202#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {202#true} is VALID [2022-04-28 01:47:24,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#true} [74] assume_abort_if_notENTRY-->L7: 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] {202#true} is VALID [2022-04-28 01:47:24,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#true} [77] L7-->L7-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[] {202#true} is VALID [2022-04-28 01:47:24,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {202#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-28 01:47:24,983 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {202#true} {202#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {202#true} is VALID [2022-04-28 01:47:24,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {202#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:47:24,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:47:24,993 INFO L272 TraceCheckUtils]: 18: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:47:24,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:47:24,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {266#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {203#false} is VALID [2022-04-28 01:47:24,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {203#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {203#false} is VALID [2022-04-28 01:47:24,995 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-28 01:47:24,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 01:47:24,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:47:24,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929113475] [2022-04-28 01:47:24,995 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:47:24,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475257162] [2022-04-28 01:47:24,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475257162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 01:47:24,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 01:47:24,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 01:47:25,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619827249] [2022-04-28 01:47:25,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:47:25,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 22 [2022-04-28 01:47:25,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:47:25,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-28 01:47:25,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:47:25,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 01:47:25,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:47:25,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 01:47:25,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 01:47:25,020 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-28 01:47:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:25,262 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-28 01:47:25,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 01:47:25,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 22 [2022-04-28 01:47:25,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:47:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-28 01:47:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 01:47:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-28 01:47:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 01:47:25,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-28 01:47:25,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:47:25,299 INFO L225 Difference]: With dead ends: 35 [2022-04-28 01:47:25,299 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 01:47:25,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-28 01:47:25,300 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:47:25,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:47:25,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 01:47:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 01:47:25,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:47:25,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:47:25,310 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:47:25,310 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:47:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:25,312 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 01:47:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 01:47:25,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:47:25,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:47:25,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-28 01:47:25,313 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-28 01:47:25,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:25,315 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 01:47:25,316 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 01:47:25,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:47:25,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:47:25,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:47:25,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:47:25,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:47:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-28 01:47:25,318 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-28 01:47:25,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:47:25,318 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-28 01:47:25,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-28 01:47:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 01:47:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 01:47:25,319 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:47:25,319 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:47:25,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 01:47:25,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:47:25,529 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:47:25,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:47:25,529 INFO L85 PathProgramCache]: Analyzing trace with hash -503871754, now seen corresponding path program 1 times [2022-04-28 01:47:25,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:47:25,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093612962] [2022-04-28 01:47:25,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:47:25,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:47:25,545 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:47:25,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507257349] [2022-04-28 01:47:25,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:47:25,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:47:25,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:47:25,552 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-28 01:47:25,554 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-28 01:47:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:47:25,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 01:47:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:47:25,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:47:25,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-28 01:47:25,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {434#true} is VALID [2022-04-28 01:47:25,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-28 01:47:25,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-28 01:47:25,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-28 01:47:25,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {434#true} is VALID [2022-04-28 01:47:25,798 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-28 01:47:25,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} [74] assume_abort_if_notENTRY-->L7: 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] {434#true} is VALID [2022-04-28 01:47:25,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} [77] L7-->L7-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[] {434#true} is VALID [2022-04-28 01:47:25,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-28 01:47:25,799 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-28 01:47:25,799 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-28 01:47:25,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} [74] assume_abort_if_notENTRY-->L7: 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] {434#true} is VALID [2022-04-28 01:47:25,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} [77] L7-->L7-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[] {434#true} is VALID [2022-04-28 01:47:25,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-28 01:47:25,799 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-28 01:47:25,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:47:25,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:47:25,801 INFO L272 TraceCheckUtils]: 18: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {434#true} is VALID [2022-04-28 01:47:25,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {434#true} is VALID [2022-04-28 01:47:25,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} [90] L10-->L10-2: Formula: (not (= 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[] {434#true} is VALID [2022-04-28 01:47:25,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-28 01:47:25,802 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {487#(and (= main_~x~0 0) (= main_~y~0 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:47:25,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-28 01:47:25,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-28 01:47:25,804 INFO L272 TraceCheckUtils]: 25: Hoare triple {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:47:25,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:47:25,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {435#false} is VALID [2022-04-28 01:47:25,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {435#false} is VALID [2022-04-28 01:47:25,806 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-28 01:47:25,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:47:25,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {435#false} is VALID [2022-04-28 01:47:25,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {435#false} is VALID [2022-04-28 01:47:25,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:47:25,982 INFO L272 TraceCheckUtils]: 25: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:47:25,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 01:47:26,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 01:47:26,097 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 01:47:26,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-28 01:47:26,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} [90] L10-->L10-2: Formula: (not (= 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[] {434#true} is VALID [2022-04-28 01:47:26,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {434#true} is VALID [2022-04-28 01:47:26,097 INFO L272 TraceCheckUtils]: 18: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {434#true} is VALID [2022-04-28 01:47:26,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 01:47:26,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 01:47:26,099 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-28 01:47:26,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-28 01:47:26,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} [77] L7-->L7-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[] {434#true} is VALID [2022-04-28 01:47:26,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} [74] assume_abort_if_notENTRY-->L7: 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] {434#true} is VALID [2022-04-28 01:47:26,100 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-28 01:47:26,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-28 01:47:26,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-28 01:47:26,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} [77] L7-->L7-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[] {434#true} is VALID [2022-04-28 01:47:26,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} [74] assume_abort_if_notENTRY-->L7: 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] {434#true} is VALID [2022-04-28 01:47:26,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-28 01:47:26,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {434#true} is VALID [2022-04-28 01:47:26,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-28 01:47:26,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-28 01:47:26,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-28 01:47:26,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {434#true} is VALID [2022-04-28 01:47:26,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-28 01:47:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 01:47:26,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:47:26,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093612962] [2022-04-28 01:47:26,102 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:47:26,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507257349] [2022-04-28 01:47:26,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507257349] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 01:47:26,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:47:26,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 01:47:26,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995546826] [2022-04-28 01:47:26,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:47:26,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-28 01:47:26,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:47:26,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 01:47:26,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:47:26,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 01:47:26,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:47:26,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 01:47:26,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 01:47:26,166 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 01:47:26,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:26,262 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 01:47:26,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 01:47:26,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-28 01:47:26,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:47:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 01:47:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 01:47:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 01:47:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 01:47:26,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 01:47:26,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:47:26,372 INFO L225 Difference]: With dead ends: 37 [2022-04-28 01:47:26,372 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 01:47:26,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 01:47:26,373 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:47:26,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:47:26,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 01:47:26,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 01:47:26,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:47:26,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:47:26,380 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:47:26,380 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:47:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:26,384 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 01:47:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 01:47:26,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:47:26,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:47:26,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-28 01:47:26,385 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-28 01:47:26,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:26,386 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 01:47:26,387 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 01:47:26,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:47:26,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:47:26,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:47:26,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:47:26,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:47:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-28 01:47:26,389 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-28 01:47:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:47:26,389 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-28 01:47:26,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 01:47:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 01:47:26,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 01:47:26,390 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:47:26,390 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:47:26,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 01:47:26,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 01:47:26,594 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:47:26,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:47:26,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1285656823, now seen corresponding path program 1 times [2022-04-28 01:47:26,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:47:26,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266252904] [2022-04-28 01:47:26,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:47:26,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:47:26,606 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:47:26,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1075844047] [2022-04-28 01:47:26,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:47:26,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:47:26,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:47:26,614 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-28 01:47:26,614 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-28 01:47:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:47:26,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 01:47:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:47:26,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:47:26,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-28 01:47:26,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {784#true} is VALID [2022-04-28 01:47:26,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-28 01:47:26,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-28 01:47:26,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {784#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-28 01:47:26,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {784#true} is VALID [2022-04-28 01:47:26,896 INFO L272 TraceCheckUtils]: 6: Hoare triple {784#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {784#true} is VALID [2022-04-28 01:47:26,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#true} [74] assume_abort_if_notENTRY-->L7: 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] {784#true} is VALID [2022-04-28 01:47:26,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {784#true} [77] L7-->L7-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[] {784#true} is VALID [2022-04-28 01:47:26,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-28 01:47:26,896 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {784#true} {784#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {784#true} is VALID [2022-04-28 01:47:26,896 INFO L272 TraceCheckUtils]: 11: Hoare triple {784#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {784#true} is VALID [2022-04-28 01:47:26,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#true} [74] assume_abort_if_notENTRY-->L7: 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] {784#true} is VALID [2022-04-28 01:47:26,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#true} [77] L7-->L7-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[] {784#true} is VALID [2022-04-28 01:47:26,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-28 01:47:26,897 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {784#true} {784#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {784#true} is VALID [2022-04-28 01:47:26,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {784#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:47:26,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:47:26,898 INFO L272 TraceCheckUtils]: 18: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {784#true} is VALID [2022-04-28 01:47:26,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {784#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {784#true} is VALID [2022-04-28 01:47:26,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {784#true} [90] L10-->L10-2: Formula: (not (= 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[] {784#true} is VALID [2022-04-28 01:47:26,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-28 01:47:26,899 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {784#true} {837#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:47:26,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 01:47:26,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 01:47:26,900 INFO L272 TraceCheckUtils]: 25: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {784#true} is VALID [2022-04-28 01:47:26,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {784#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {784#true} is VALID [2022-04-28 01:47:26,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {784#true} [90] L10-->L10-2: Formula: (not (= 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[] {784#true} is VALID [2022-04-28 01:47:26,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {784#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-28 01:47:26,901 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {784#true} {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 01:47:26,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 01:47:26,901 INFO L272 TraceCheckUtils]: 31: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {784#true} is VALID [2022-04-28 01:47:26,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {784#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {784#true} is VALID [2022-04-28 01:47:26,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {784#true} [90] L10-->L10-2: Formula: (not (= 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[] {784#true} is VALID [2022-04-28 01:47:26,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {784#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-28 01:47:26,902 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {784#true} {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 01:47:26,903 INFO L272 TraceCheckUtils]: 36: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:47:26,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {900#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:47:26,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {904#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {785#false} is VALID [2022-04-28 01:47:26,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {785#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {785#false} is VALID [2022-04-28 01:47:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 01:47:26,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:47:27,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:47:27,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266252904] [2022-04-28 01:47:27,137 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:47:27,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075844047] [2022-04-28 01:47:27,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075844047] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:47:27,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:47:27,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 01:47:27,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804966795] [2022-04-28 01:47:27,138 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:47:27,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-28 01:47:27,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:47:27,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 01:47:27,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:47:27,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 01:47:27,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:47:27,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 01:47:27,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 01:47:27,158 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 01:47:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:27,353 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 01:47:27,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 01:47:27,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-28 01:47:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:47:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 01:47:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 01:47:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 01:47:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 01:47:27,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-28 01:47:27,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:47:27,392 INFO L225 Difference]: With dead ends: 42 [2022-04-28 01:47:27,392 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 01:47:27,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 01:47:27,393 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:47:27,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:47:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 01:47:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 01:47:27,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:47:27,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:47:27,402 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:47:27,402 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:47:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:27,403 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 01:47:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 01:47:27,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:47:27,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:47:27,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-28 01:47:27,404 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-28 01:47:27,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:27,405 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 01:47:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 01:47:27,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:47:27,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:47:27,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:47:27,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:47:27,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:47:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-28 01:47:27,408 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-28 01:47:27,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:47:27,408 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-28 01:47:27,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 01:47:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 01:47:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 01:47:27,411 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:47:27,412 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:47:27,428 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-28 01:47:27,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:47:27,612 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:47:27,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:47:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash -542323485, now seen corresponding path program 2 times [2022-04-28 01:47:27,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:47:27,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756099175] [2022-04-28 01:47:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:47:27,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:47:27,625 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:47:27,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [863190211] [2022-04-28 01:47:27,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 01:47:27,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:47:27,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:47:27,636 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-28 01:47:27,637 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-28 01:47:27,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 01:47:27,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:47:27,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 01:47:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:47:27,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:47:27,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {1160#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-28 01:47:27,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {1160#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1160#true} is VALID [2022-04-28 01:47:27,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {1160#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-28 01:47:27,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1160#true} {1160#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-28 01:47:27,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {1160#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-28 01:47:27,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {1160#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1160#true} is VALID [2022-04-28 01:47:27,987 INFO L272 TraceCheckUtils]: 6: Hoare triple {1160#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1160#true} is VALID [2022-04-28 01:47:27,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#true} [74] assume_abort_if_notENTRY-->L7: 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] {1160#true} is VALID [2022-04-28 01:47:27,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#true} [77] L7-->L7-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[] {1160#true} is VALID [2022-04-28 01:47:27,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-28 01:47:27,987 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1160#true} {1160#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1160#true} is VALID [2022-04-28 01:47:27,987 INFO L272 TraceCheckUtils]: 11: Hoare triple {1160#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1160#true} is VALID [2022-04-28 01:47:27,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {1160#true} [74] assume_abort_if_notENTRY-->L7: 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] {1160#true} is VALID [2022-04-28 01:47:27,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {1160#true} [77] L7-->L7-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[] {1160#true} is VALID [2022-04-28 01:47:27,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {1160#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-28 01:47:27,988 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1160#true} {1160#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1160#true} is VALID [2022-04-28 01:47:27,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {1160#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:47:27,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:47:27,989 INFO L272 TraceCheckUtils]: 18: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1160#true} is VALID [2022-04-28 01:47:27,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {1160#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1160#true} is VALID [2022-04-28 01:47:27,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {1160#true} [90] L10-->L10-2: Formula: (not (= 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[] {1160#true} is VALID [2022-04-28 01:47:27,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {1160#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-28 01:47:27,995 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1160#true} {1213#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:47:27,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1235#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 01:47:27,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {1235#(and (= main_~y~0 1) (= main_~c~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1235#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 01:47:27,997 INFO L272 TraceCheckUtils]: 25: Hoare triple {1235#(and (= main_~y~0 1) (= main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1160#true} is VALID [2022-04-28 01:47:27,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {1160#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1160#true} is VALID [2022-04-28 01:47:27,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {1160#true} [90] L10-->L10-2: Formula: (not (= 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[] {1160#true} is VALID [2022-04-28 01:47:27,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {1160#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-28 01:47:27,997 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1160#true} {1235#(and (= main_~y~0 1) (= main_~c~0 1))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1235#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 01:47:27,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {1235#(and (= main_~y~0 1) (= main_~c~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-28 01:47:27,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-28 01:47:27,998 INFO L272 TraceCheckUtils]: 32: Hoare triple {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1160#true} is VALID [2022-04-28 01:47:27,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {1160#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1160#true} is VALID [2022-04-28 01:47:27,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {1160#true} [90] L10-->L10-2: Formula: (not (= 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[] {1160#true} is VALID [2022-04-28 01:47:27,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {1160#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-28 01:47:27,999 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1160#true} {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-28 01:47:28,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-28 01:47:28,000 INFO L272 TraceCheckUtils]: 38: Hoare triple {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1160#true} is VALID [2022-04-28 01:47:28,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {1160#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1160#true} is VALID [2022-04-28 01:47:28,003 INFO L290 TraceCheckUtils]: 40: Hoare triple {1160#true} [90] L10-->L10-2: Formula: (not (= 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[] {1160#true} is VALID [2022-04-28 01:47:28,003 INFO L290 TraceCheckUtils]: 41: Hoare triple {1160#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-28 01:47:28,004 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1160#true} {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-28 01:47:28,004 INFO L272 TraceCheckUtils]: 43: Hoare triple {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:47:28,005 INFO L290 TraceCheckUtils]: 44: Hoare triple {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:47:28,005 INFO L290 TraceCheckUtils]: 45: Hoare triple {1302#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1161#false} is VALID [2022-04-28 01:47:28,005 INFO L290 TraceCheckUtils]: 46: Hoare triple {1161#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1161#false} is VALID [2022-04-28 01:47:28,005 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 01:47:28,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:47:28,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:47:28,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756099175] [2022-04-28 01:47:28,262 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:47:28,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863190211] [2022-04-28 01:47:28,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863190211] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:47:28,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:47:28,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 01:47:28,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157302413] [2022-04-28 01:47:28,263 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:47:28,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-28 01:47:28,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:47:28,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 01:47:28,289 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-28 01:47:28,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 01:47:28,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:47:28,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 01:47:28,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 01:47:28,290 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 01:47:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:28,530 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-28 01:47:28,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 01:47:28,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-28 01:47:28,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:47:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 01:47:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-28 01:47:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 01:47:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-28 01:47:28,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-28 01:47:28,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:47:28,566 INFO L225 Difference]: With dead ends: 45 [2022-04-28 01:47:28,566 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 01:47:28,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 01:47:28,567 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 01:47:28,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 01:47:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 01:47:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 01:47:28,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:47:28,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 01:47:28,576 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 01:47:28,576 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 01:47:28,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:28,577 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 01:47:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 01:47:28,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:47:28,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:47:28,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-28 01:47:28,578 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-28 01:47:28,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:28,580 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 01:47:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 01:47:28,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:47:28,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:47:28,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:47:28,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:47:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 01:47:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-28 01:47:28,585 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-28 01:47:28,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:47:28,585 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-28 01:47:28,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 01:47:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 01:47:28,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 01:47:28,588 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:47:28,589 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:47:28,603 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-28 01:47:28,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:47:28,795 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:47:28,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:47:28,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2094100617, now seen corresponding path program 3 times [2022-04-28 01:47:28,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:47:28,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533817156] [2022-04-28 01:47:28,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:47:28,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:47:28,819 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:47:28,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1500295894] [2022-04-28 01:47:28,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-28 01:47:28,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:47:28,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:47:28,820 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-28 01:47:28,821 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-28 01:47:28,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-28 01:47:28,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:47:28,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 01:47:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:47:28,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:47:29,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {1574#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1574#true} is VALID [2022-04-28 01:47:29,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {1574#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {1574#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1574#true} is VALID [2022-04-28 01:47:29,206 INFO L272 TraceCheckUtils]: 6: Hoare triple {1574#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1574#true} is VALID [2022-04-28 01:47:29,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {1574#true} [74] assume_abort_if_notENTRY-->L7: 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] {1600#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 01:47:29,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {1600#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [77] L7-->L7-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[] {1604#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 01:47:29,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {1604#(not (= |assume_abort_if_not_#in~cond| 0))} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1604#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 01:47:29,224 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1604#(not (= |assume_abort_if_not_#in~cond| 0))} {1574#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1611#(and (<= 0 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 01:47:29,224 INFO L272 TraceCheckUtils]: 11: Hoare triple {1611#(and (<= 0 main_~k~0) (<= main_~k~0 2))} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1574#true} is VALID [2022-04-28 01:47:29,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {1574#true} [74] assume_abort_if_notENTRY-->L7: 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] {1574#true} is VALID [2022-04-28 01:47:29,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {1574#true} [77] L7-->L7-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[] {1574#true} is VALID [2022-04-28 01:47:29,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {1574#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,225 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1574#true} {1611#(and (<= 0 main_~k~0) (<= main_~k~0 2))} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1611#(and (<= 0 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 01:47:29,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {1611#(and (<= 0 main_~k~0) (<= main_~k~0 2))} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1630#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 0 main_~c~0))} is VALID [2022-04-28 01:47:29,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {1630#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 0 main_~c~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1630#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 0 main_~c~0))} is VALID [2022-04-28 01:47:29,226 INFO L272 TraceCheckUtils]: 18: Hoare triple {1630#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 0 main_~c~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1574#true} is VALID [2022-04-28 01:47:29,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {1574#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1574#true} is VALID [2022-04-28 01:47:29,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {1574#true} [90] L10-->L10-2: Formula: (not (= 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[] {1574#true} is VALID [2022-04-28 01:47:29,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,226 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1574#true} {1630#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 0 main_~c~0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1630#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 0 main_~c~0))} is VALID [2022-04-28 01:47:29,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {1630#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 0 main_~c~0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1652#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 01:47:29,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {1652#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1652#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 01:47:29,229 INFO L272 TraceCheckUtils]: 25: Hoare triple {1652#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1574#true} is VALID [2022-04-28 01:47:29,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {1574#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1574#true} is VALID [2022-04-28 01:47:29,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {1574#true} [90] L10-->L10-2: Formula: (not (= 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[] {1574#true} is VALID [2022-04-28 01:47:29,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {1574#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,230 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1574#true} {1652#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1652#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 01:47:29,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {1652#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1674#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} is VALID [2022-04-28 01:47:29,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {1674#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1674#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} is VALID [2022-04-28 01:47:29,231 INFO L272 TraceCheckUtils]: 32: Hoare triple {1674#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1574#true} is VALID [2022-04-28 01:47:29,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {1574#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1574#true} is VALID [2022-04-28 01:47:29,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {1574#true} [90] L10-->L10-2: Formula: (not (= 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[] {1574#true} is VALID [2022-04-28 01:47:29,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {1574#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,231 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1574#true} {1674#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1674#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} is VALID [2022-04-28 01:47:29,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {1674#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1575#false} is VALID [2022-04-28 01:47:29,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {1575#false} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1575#false} is VALID [2022-04-28 01:47:29,232 INFO L272 TraceCheckUtils]: 39: Hoare triple {1575#false} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1575#false} is VALID [2022-04-28 01:47:29,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {1575#false} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1575#false} is VALID [2022-04-28 01:47:29,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {1575#false} [90] L10-->L10-2: Formula: (not (= 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[] {1575#false} is VALID [2022-04-28 01:47:29,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {1575#false} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1575#false} is VALID [2022-04-28 01:47:29,232 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1575#false} {1575#false} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1575#false} is VALID [2022-04-28 01:47:29,232 INFO L290 TraceCheckUtils]: 44: Hoare triple {1575#false} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {1575#false} is VALID [2022-04-28 01:47:29,233 INFO L272 TraceCheckUtils]: 45: Hoare triple {1575#false} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1575#false} is VALID [2022-04-28 01:47:29,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {1575#false} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1575#false} is VALID [2022-04-28 01:47:29,233 INFO L290 TraceCheckUtils]: 47: Hoare triple {1575#false} [90] L10-->L10-2: Formula: (not (= 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[] {1575#false} is VALID [2022-04-28 01:47:29,233 INFO L290 TraceCheckUtils]: 48: Hoare triple {1575#false} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1575#false} is VALID [2022-04-28 01:47:29,233 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1575#false} {1575#false} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1575#false} is VALID [2022-04-28 01:47:29,233 INFO L272 TraceCheckUtils]: 50: Hoare triple {1575#false} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1575#false} is VALID [2022-04-28 01:47:29,233 INFO L290 TraceCheckUtils]: 51: Hoare triple {1575#false} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1575#false} is VALID [2022-04-28 01:47:29,233 INFO L290 TraceCheckUtils]: 52: Hoare triple {1575#false} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1575#false} is VALID [2022-04-28 01:47:29,233 INFO L290 TraceCheckUtils]: 53: Hoare triple {1575#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1575#false} is VALID [2022-04-28 01:47:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 01:47:29,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:47:29,506 INFO L290 TraceCheckUtils]: 53: Hoare triple {1575#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1575#false} is VALID [2022-04-28 01:47:29,507 INFO L290 TraceCheckUtils]: 52: Hoare triple {1575#false} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1575#false} is VALID [2022-04-28 01:47:29,507 INFO L290 TraceCheckUtils]: 51: Hoare triple {1575#false} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1575#false} is VALID [2022-04-28 01:47:29,507 INFO L272 TraceCheckUtils]: 50: Hoare triple {1575#false} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1575#false} is VALID [2022-04-28 01:47:29,507 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1574#true} {1575#false} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1575#false} is VALID [2022-04-28 01:47:29,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {1574#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,507 INFO L290 TraceCheckUtils]: 47: Hoare triple {1574#true} [90] L10-->L10-2: Formula: (not (= 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[] {1574#true} is VALID [2022-04-28 01:47:29,507 INFO L290 TraceCheckUtils]: 46: Hoare triple {1574#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1574#true} is VALID [2022-04-28 01:47:29,508 INFO L272 TraceCheckUtils]: 45: Hoare triple {1575#false} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1574#true} is VALID [2022-04-28 01:47:29,508 INFO L290 TraceCheckUtils]: 44: Hoare triple {1575#false} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {1575#false} is VALID [2022-04-28 01:47:29,508 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1574#true} {1575#false} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1575#false} is VALID [2022-04-28 01:47:29,508 INFO L290 TraceCheckUtils]: 42: Hoare triple {1574#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,508 INFO L290 TraceCheckUtils]: 41: Hoare triple {1574#true} [90] L10-->L10-2: Formula: (not (= 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[] {1574#true} is VALID [2022-04-28 01:47:29,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {1574#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1574#true} is VALID [2022-04-28 01:47:29,508 INFO L272 TraceCheckUtils]: 39: Hoare triple {1575#false} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1574#true} is VALID [2022-04-28 01:47:29,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {1575#false} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1575#false} is VALID [2022-04-28 01:47:29,509 INFO L290 TraceCheckUtils]: 37: Hoare triple {1792#(not (< main_~c~0 main_~k~0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1575#false} is VALID [2022-04-28 01:47:29,510 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1574#true} {1792#(not (< main_~c~0 main_~k~0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1792#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-28 01:47:29,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {1574#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {1574#true} [90] L10-->L10-2: Formula: (not (= 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[] {1574#true} is VALID [2022-04-28 01:47:29,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {1574#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1574#true} is VALID [2022-04-28 01:47:29,510 INFO L272 TraceCheckUtils]: 32: Hoare triple {1792#(not (< main_~c~0 main_~k~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1574#true} is VALID [2022-04-28 01:47:29,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {1792#(not (< main_~c~0 main_~k~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1792#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-28 01:47:29,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {1814#(<= main_~k~0 (+ main_~c~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1792#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-28 01:47:29,512 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1574#true} {1814#(<= main_~k~0 (+ main_~c~0 1))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1814#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-28 01:47:29,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {1574#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {1574#true} [90] L10-->L10-2: Formula: (not (= 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[] {1574#true} is VALID [2022-04-28 01:47:29,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {1574#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1574#true} is VALID [2022-04-28 01:47:29,513 INFO L272 TraceCheckUtils]: 25: Hoare triple {1814#(<= main_~k~0 (+ main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1574#true} is VALID [2022-04-28 01:47:29,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {1814#(<= main_~k~0 (+ main_~c~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1814#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-28 01:47:29,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {1836#(<= main_~k~0 (+ main_~c~0 2))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1814#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-28 01:47:29,514 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1574#true} {1836#(<= main_~k~0 (+ main_~c~0 2))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1836#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-28 01:47:29,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {1574#true} [90] L10-->L10-2: Formula: (not (= 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[] {1574#true} is VALID [2022-04-28 01:47:29,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {1574#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1574#true} is VALID [2022-04-28 01:47:29,514 INFO L272 TraceCheckUtils]: 18: Hoare triple {1836#(<= main_~k~0 (+ main_~c~0 2))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1574#true} is VALID [2022-04-28 01:47:29,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {1836#(<= main_~k~0 (+ main_~c~0 2))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1836#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-28 01:47:29,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {1858#(<= main_~k~0 2)} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1836#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-28 01:47:29,515 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1574#true} {1858#(<= main_~k~0 2)} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1858#(<= main_~k~0 2)} is VALID [2022-04-28 01:47:29,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {1574#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {1574#true} [77] L7-->L7-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[] {1574#true} is VALID [2022-04-28 01:47:29,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {1574#true} [74] assume_abort_if_notENTRY-->L7: 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] {1574#true} is VALID [2022-04-28 01:47:29,516 INFO L272 TraceCheckUtils]: 11: Hoare triple {1858#(<= main_~k~0 2)} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1574#true} is VALID [2022-04-28 01:47:29,516 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1604#(not (= |assume_abort_if_not_#in~cond| 0))} {1574#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1858#(<= main_~k~0 2)} is VALID [2022-04-28 01:47:29,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {1604#(not (= |assume_abort_if_not_#in~cond| 0))} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1604#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 01:47:29,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {1886#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [77] L7-->L7-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[] {1604#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 01:47:29,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {1574#true} [74] assume_abort_if_notENTRY-->L7: 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] {1886#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 01:47:29,517 INFO L272 TraceCheckUtils]: 6: Hoare triple {1574#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 2)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1574#true} is VALID [2022-04-28 01:47:29,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {1574#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1574#true} is VALID [2022-04-28 01:47:29,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {1574#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1574#true} is VALID [2022-04-28 01:47:29,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {1574#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-28 01:47:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-28 01:47:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:47:29,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533817156] [2022-04-28 01:47:29,518 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:47:29,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500295894] [2022-04-28 01:47:29,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500295894] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 01:47:29,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 01:47:29,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-04-28 01:47:29,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252812498] [2022-04-28 01:47:29,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-28 01:47:29,519 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 10 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) Word has length 54 [2022-04-28 01:47:29,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:47:29,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 10 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2022-04-28 01:47:29,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:47:29,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 01:47:29,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:47:29,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 01:47:29,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-04-28 01:47:29,557 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 10 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2022-04-28 01:47:29,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:29,716 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-28 01:47:29,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 01:47:29,716 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 10 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) Word has length 54 [2022-04-28 01:47:29,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:47:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 10 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2022-04-28 01:47:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 01:47:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 10 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2022-04-28 01:47:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 01:47:29,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-28 01:47:29,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:47:29,752 INFO L225 Difference]: With dead ends: 45 [2022-04-28 01:47:29,752 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 01:47:29,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-28 01:47:29,753 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:47:29,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:47:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 01:47:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 01:47:29,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:47:29,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 01:47:29,753 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 01:47:29,753 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 01:47:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:29,754 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 01:47:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 01:47:29,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:47:29,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:47:29,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 01:47:29,754 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 01:47:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:47:29,754 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 01:47:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 01:47:29,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:47:29,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:47:29,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:47:29,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:47:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 01:47:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 01:47:29,755 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2022-04-28 01:47:29,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:47:29,755 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 01:47:29,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 10 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2022-04-28 01:47:29,755 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 01:47:29,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:47:29,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 01:47:29,775 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-28 01:47:29,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:47:29,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 01:47:30,166 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 01:47:30,167 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-28 01:47:30,167 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-28 01:47:30,167 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 01:47:30,167 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 01:47:30,167 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-28 01:47:30,167 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-28 01:47:30,167 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-28 01:47:30,167 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-28 01:47:30,167 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-28 01:47:30,167 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-28 01:47:30,167 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 42) the Hoare annotation is: true [2022-04-28 01:47:30,167 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-28 01:47:30,167 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= 0 main_~k~0) (<= main_~k~0 2)) [2022-04-28 01:47:30,167 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-04-28 01:47:30,168 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 2)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and (= main_~y~0 2) (< 1 main_~k~0) .cse0 (<= main_~c~0 2) .cse1 (<= 2 main_~c~0)) (and (<= 0 main_~k~0) .cse0 .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 1) .cse0 .cse1 (< 0 main_~k~0) (= main_~c~0 1)))) [2022-04-28 01:47:30,168 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse0 (+ (- 1) main_~y~0)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (= .cse0 0) (<= main_~k~0 1) .cse1 (< 0 main_~k~0) (<= main_~c~0 1)) (and (< 1 main_~k~0) (= .cse0 1) (<= main_~k~0 2) (<= main_~c~0 2) .cse1))) [2022-04-28 01:47:30,168 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 2)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and (= main_~y~0 2) (< 1 main_~k~0) .cse0 (<= main_~c~0 2) .cse1 (<= 2 main_~c~0)) (and (<= 0 main_~k~0) .cse0 .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 1) .cse0 .cse1 (< 0 main_~k~0) (= main_~c~0 1)))) [2022-04-28 01:47:30,168 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (+ (- 1) main_~y~0)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (= .cse0 0) (<= main_~k~0 1) .cse1 (< 0 main_~k~0) (<= main_~c~0 1)) (and (< 1 main_~k~0) (= .cse0 1) (<= main_~k~0 2) (<= main_~c~0 2) .cse1))) [2022-04-28 01:47:30,168 INFO L899 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2022-04-28 01:47:30,168 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-04-28 01:47:30,168 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 17 42) no Hoare annotation was computed. [2022-04-28 01:47:30,168 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 17 42) no Hoare annotation was computed. [2022-04-28 01:47:30,168 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-28 01:47:30,168 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-04-28 01:47:30,168 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-04-28 01:47:30,168 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-04-28 01:47:30,168 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-04-28 01:47:30,168 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-04-28 01:47:30,170 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-04-28 01:47:30,172 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 01:47:30,174 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 01:47:30,174 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 01:47:30,175 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-28 01:47:30,180 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 01:47:30,180 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 01:47:30,180 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 01:47:30,181 INFO L163 areAnnotationChecker]: CFG has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 01:47:30,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 01:47:30 BasicIcfg [2022-04-28 01:47:30,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 01:47:30,189 INFO L158 Benchmark]: Toolchain (without parser) took 6791.58ms. Allocated memory was 194.0MB in the beginning and 247.5MB in the end (delta: 53.5MB). Free memory was 142.9MB in the beginning and 144.9MB in the end (delta: -2.0MB). Peak memory consumption was 51.9MB. Max. memory is 8.0GB. [2022-04-28 01:47:30,190 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory is still 159.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 01:47:30,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.29ms. Allocated memory is still 194.0MB. Free memory was 142.7MB in the beginning and 169.6MB in the end (delta: -26.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 01:47:30,190 INFO L158 Benchmark]: Boogie Preprocessor took 30.56ms. Allocated memory is still 194.0MB. Free memory was 169.6MB in the beginning and 168.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 01:47:30,190 INFO L158 Benchmark]: RCFGBuilder took 205.37ms. Allocated memory is still 194.0MB. Free memory was 168.6MB in the beginning and 157.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 01:47:30,190 INFO L158 Benchmark]: IcfgTransformer took 41.77ms. Allocated memory is still 194.0MB. Free memory was 157.0MB in the beginning and 155.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 01:47:30,191 INFO L158 Benchmark]: TraceAbstraction took 6269.00ms. Allocated memory was 194.0MB in the beginning and 247.5MB in the end (delta: 53.5MB). Free memory was 154.9MB in the beginning and 144.9MB in the end (delta: 10.1MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. [2022-04-28 01:47:30,191 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory is still 159.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.29ms. Allocated memory is still 194.0MB. Free memory was 142.7MB in the beginning and 169.6MB in the end (delta: -26.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.56ms. Allocated memory is still 194.0MB. Free memory was 169.6MB in the beginning and 168.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 205.37ms. Allocated memory is still 194.0MB. Free memory was 168.6MB in the beginning and 157.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 41.77ms. Allocated memory is still 194.0MB. Free memory was 157.0MB in the beginning and 155.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6269.00ms. Allocated memory was 194.0MB in the beginning and 247.5MB in the end (delta: 53.5MB). Free memory was 154.9MB in the beginning and 144.9MB in the end (delta: 10.1MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 608 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 449 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 261 IncrementalHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 159 mSDtfsCounter, 261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 275 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=5, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 28 PreInvPairs, 41 NumberOfFragments, 512 HoareAnnotationTreeSize, 28 FomulaSimplifications, 44 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 852 SizeOfPredicates, 7 NumberOfNonLiveVariables, 561 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 218/238 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((y == 2 && 1 < k) && k <= 2) && c <= 2) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && 2 <= c) || ((((0 <= k && k <= 2) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && c == 0) && y == 0)) || ((((y == 1 && k <= 2) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && 0 < k) && c == 1) RESULT: Ultimate proved your program to be correct! [2022-04-28 01:47:30,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...