/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/egcd-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 02:39:01,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 02:39:01,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 02:39:01,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 02:39:01,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 02:39:01,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 02:39:01,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 02:39:01,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 02:39:01,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 02:39:01,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 02:39:01,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 02:39:01,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 02:39:01,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 02:39:01,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 02:39:01,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 02:39:01,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 02:39:01,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 02:39:01,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 02:39:01,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 02:39:01,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 02:39:01,829 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 02:39:01,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 02:39:01,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 02:39:01,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 02:39:01,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 02:39:01,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 02:39:01,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 02:39:01,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 02:39:01,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 02:39:01,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 02:39:01,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 02:39:01,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 02:39:01,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 02:39:01,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 02:39:01,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 02:39:01,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 02:39:01,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 02:39:01,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 02:39:01,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 02:39:01,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 02:39:01,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 02:39:01,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 02:39:01,845 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 02:39:01,867 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 02:39:01,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 02:39:01,868 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 02:39:01,868 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 02:39:01,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 02:39:01,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 02:39:01,869 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 02:39:01,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 02:39:01,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 02:39:01,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 02:39:01,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 02:39:01,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 02:39:01,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 02:39:01,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 02:39:01,871 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 02:39:01,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 02:39:01,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 02:39:01,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 02:39:01,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 02:39:01,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 02:39:01,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 02:39:01,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 02:39:01,872 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 02:39:01,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 02:39:01,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 02:39:01,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 02:39:01,873 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 02:39:01,873 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 02:39:01,875 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 02:39:01,875 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 02:39:02,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 02:39:02,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 02:39:02,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 02:39:02,144 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 02:39:02,151 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 02:39:02,153 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound2.c [2022-04-15 02:39:02,204 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefd99e11/931072ef0260440481132f01c603f1d5/FLAG9edc6deae [2022-04-15 02:39:02,562 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 02:39:02,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound2.c [2022-04-15 02:39:02,568 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefd99e11/931072ef0260440481132f01c603f1d5/FLAG9edc6deae [2022-04-15 02:39:02,579 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefd99e11/931072ef0260440481132f01c603f1d5 [2022-04-15 02:39:02,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 02:39:02,583 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 02:39:02,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 02:39:02,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 02:39:02,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 02:39:02,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:39:02" (1/1) ... [2022-04-15 02:39:02,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d627d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:39:02, skipping insertion in model container [2022-04-15 02:39:02,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:39:02" (1/1) ... [2022-04-15 02:39:02,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 02:39:02,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 02:39:02,756 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/egcd-ll_unwindbound2.c[489,502] [2022-04-15 02:39:02,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 02:39:02,784 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 02:39:02,792 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/egcd-ll_unwindbound2.c[489,502] [2022-04-15 02:39:02,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 02:39:02,818 INFO L208 MainTranslator]: Completed translation [2022-04-15 02:39:02,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:39:02 WrapperNode [2022-04-15 02:39:02,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 02:39:02,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 02:39:02,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 02:39:02,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 02:39:02,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:39:02" (1/1) ... [2022-04-15 02:39:02,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:39:02" (1/1) ... [2022-04-15 02:39:02,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:39:02" (1/1) ... [2022-04-15 02:39:02,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:39:02" (1/1) ... [2022-04-15 02:39:02,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:39:02" (1/1) ... [2022-04-15 02:39:02,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:39:02" (1/1) ... [2022-04-15 02:39:02,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:39:02" (1/1) ... [2022-04-15 02:39:02,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 02:39:02,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 02:39:02,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 02:39:02,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 02:39:02,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:39:02" (1/1) ... [2022-04-15 02:39:02,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 02:39:02,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:39:02,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 02:39:02,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 02:39:02,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 02:39:02,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 02:39:02,968 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 02:39:02,968 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 02:39:02,968 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 02:39:02,969 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 02:39:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 02:39:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 02:39:02,971 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 02:39:02,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 02:39:02,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 02:39:03,036 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 02:39:03,037 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 02:39:03,226 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 02:39:03,232 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 02:39:03,233 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 02:39:03,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:39:03 BoogieIcfgContainer [2022-04-15 02:39:03,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 02:39:03,235 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 02:39:03,235 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 02:39:03,236 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 02:39:03,239 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:39:03" (1/1) ... [2022-04-15 02:39:03,241 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 02:39:03,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 02:39:03 BasicIcfg [2022-04-15 02:39:03,275 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 02:39:03,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 02:39:03,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 02:39:03,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 02:39:03,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:39:02" (1/4) ... [2022-04-15 02:39:03,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c762b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:39:03, skipping insertion in model container [2022-04-15 02:39:03,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:39:02" (2/4) ... [2022-04-15 02:39:03,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c762b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:39:03, skipping insertion in model container [2022-04-15 02:39:03,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:39:03" (3/4) ... [2022-04-15 02:39:03,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c762b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:39:03, skipping insertion in model container [2022-04-15 02:39:03,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 02:39:03" (4/4) ... [2022-04-15 02:39:03,281 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound2.cqvasr [2022-04-15 02:39:03,291 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 02:39:03,292 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 02:39:03,332 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 02:39:03,339 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 02:39:03,340 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 02:39:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 02:39:03,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 02:39:03,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:39:03,365 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:39:03,365 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:39:03,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:39:03,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2051628946, now seen corresponding path program 1 times [2022-04-15 02:39:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:39:03,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312781438] [2022-04-15 02:39:03,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:03,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:39:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:03,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 02:39:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:03,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {38#true} is VALID [2022-04-15 02:39:03,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-15 02:39:03,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-15 02:39:03,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 02:39:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:03,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {38#true} is VALID [2022-04-15 02:39:03,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-15 02:39:03,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-15 02:39:03,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} [122] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {38#true} is VALID [2022-04-15 02:39:03,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 02:39:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:03,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {38#true} is VALID [2022-04-15 02:39:03,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-15 02:39:03,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-15 02:39:03,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#true} is VALID [2022-04-15 02:39:03,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 02:39:03,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {38#true} is VALID [2022-04-15 02:39:03,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-15 02:39:03,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-15 02:39:03,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-15 02:39:03,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} [89] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {38#true} is VALID [2022-04-15 02:39:03,647 INFO L272 TraceCheckUtils]: 6: Hoare triple {38#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {38#true} is VALID [2022-04-15 02:39:03,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {38#true} is VALID [2022-04-15 02:39:03,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-15 02:39:03,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-15 02:39:03,650 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#true} {38#true} [122] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {38#true} is VALID [2022-04-15 02:39:03,650 INFO L272 TraceCheckUtils]: 11: Hoare triple {38#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#true} is VALID [2022-04-15 02:39:03,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {38#true} is VALID [2022-04-15 02:39:03,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-15 02:39:03,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-15 02:39:03,651 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38#true} {38#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#true} is VALID [2022-04-15 02:39:03,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {38#true} is VALID [2022-04-15 02:39:03,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {38#true} [97] L42-2-->L34-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-15 02:39:03,653 INFO L272 TraceCheckUtils]: 18: Hoare triple {39#false} [100] L34-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {39#false} is VALID [2022-04-15 02:39:03,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#false} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {39#false} is VALID [2022-04-15 02:39:03,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#false} [107] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-15 02:39:03,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {39#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-15 02:39:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 02:39:03,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:39:03,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312781438] [2022-04-15 02:39:03,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312781438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:39:03,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:39:03,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 02:39:03,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976050284] [2022-04-15 02:39:03,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:39:03,663 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-15 02:39:03,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:39:03,672 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 02:39:03,711 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-15 02:39:03,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 02:39:03,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:39:03,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 02:39:03,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 02:39:03,732 INFO L87 Difference]: Start difference. First operand has 35 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 02:39:03,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:03,941 INFO L93 Difference]: Finished difference Result 64 states and 97 transitions. [2022-04-15 02:39:03,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 02:39:03,941 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-15 02:39:03,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:39:03,943 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 02:39:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-04-15 02:39:03,952 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 02:39:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-04-15 02:39:03,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 97 transitions. [2022-04-15 02:39:04,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:04,092 INFO L225 Difference]: With dead ends: 64 [2022-04-15 02:39:04,092 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 02:39:04,095 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 02:39:04,100 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 02:39:04,101 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 45 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 02:39:04,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 02:39:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-04-15 02:39:04,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:39:04,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 02:39:04,128 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 02:39:04,128 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 02:39:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:04,133 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-15 02:39:04,133 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-04-15 02:39:04,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:04,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:04,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 31 states. [2022-04-15 02:39:04,135 INFO L87 Difference]: Start difference. First operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 31 states. [2022-04-15 02:39:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:04,139 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-15 02:39:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-04-15 02:39:04,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:04,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:04,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:39:04,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:39:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 02:39:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-15 02:39:04,145 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 22 [2022-04-15 02:39:04,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:39:04,145 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-15 02:39:04,146 INFO L479 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 02:39:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-15 02:39:04,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 02:39:04,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:39:04,147 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:39:04,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 02:39:04,147 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:39:04,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:39:04,148 INFO L85 PathProgramCache]: Analyzing trace with hash -794581502, now seen corresponding path program 1 times [2022-04-15 02:39:04,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:39:04,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887614527] [2022-04-15 02:39:04,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:04,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:39:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:04,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 02:39:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:04,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {259#(= ~counter~0 0)} is VALID [2022-04-15 02:39:04,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#(= ~counter~0 0)} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {259#(= ~counter~0 0)} is VALID [2022-04-15 02:39:04,235 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {259#(= ~counter~0 0)} {254#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {259#(= ~counter~0 0)} is VALID [2022-04-15 02:39:04,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 02:39:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:04,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {254#true} is VALID [2022-04-15 02:39:04,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-15 02:39:04,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-15 02:39:04,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {259#(= ~counter~0 0)} [122] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {259#(= ~counter~0 0)} is VALID [2022-04-15 02:39:04,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 02:39:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:04,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {254#true} is VALID [2022-04-15 02:39:04,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-15 02:39:04,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-15 02:39:04,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {259#(= ~counter~0 0)} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {259#(= ~counter~0 0)} is VALID [2022-04-15 02:39:04,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {254#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 02:39:04,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {259#(= ~counter~0 0)} is VALID [2022-04-15 02:39:04,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {259#(= ~counter~0 0)} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {259#(= ~counter~0 0)} is VALID [2022-04-15 02:39:04,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {259#(= ~counter~0 0)} {254#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {259#(= ~counter~0 0)} is VALID [2022-04-15 02:39:04,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {259#(= ~counter~0 0)} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {259#(= ~counter~0 0)} is VALID [2022-04-15 02:39:04,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {259#(= ~counter~0 0)} [89] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {259#(= ~counter~0 0)} is VALID [2022-04-15 02:39:04,269 INFO L272 TraceCheckUtils]: 6: Hoare triple {259#(= ~counter~0 0)} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {254#true} is VALID [2022-04-15 02:39:04,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {254#true} is VALID [2022-04-15 02:39:04,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {254#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-15 02:39:04,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {254#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-15 02:39:04,271 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {254#true} {259#(= ~counter~0 0)} [122] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {259#(= ~counter~0 0)} is VALID [2022-04-15 02:39:04,272 INFO L272 TraceCheckUtils]: 11: Hoare triple {259#(= ~counter~0 0)} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {254#true} is VALID [2022-04-15 02:39:04,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {254#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {254#true} is VALID [2022-04-15 02:39:04,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {254#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-15 02:39:04,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {254#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-15 02:39:04,273 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {254#true} {259#(= ~counter~0 0)} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {259#(= ~counter~0 0)} is VALID [2022-04-15 02:39:04,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {259#(= ~counter~0 0)} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {259#(= ~counter~0 0)} is VALID [2022-04-15 02:39:04,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {259#(= ~counter~0 0)} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {268#(= |main_#t~post6| 0)} is VALID [2022-04-15 02:39:04,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {268#(= |main_#t~post6| 0)} [101] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {255#false} is VALID [2022-04-15 02:39:04,275 INFO L272 TraceCheckUtils]: 19: Hoare triple {255#false} [100] L34-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {255#false} is VALID [2022-04-15 02:39:04,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {255#false} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {255#false} is VALID [2022-04-15 02:39:04,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {255#false} [107] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {255#false} is VALID [2022-04-15 02:39:04,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {255#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {255#false} is VALID [2022-04-15 02:39:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 02:39:04,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:39:04,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887614527] [2022-04-15 02:39:04,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887614527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:39:04,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:39:04,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 02:39:04,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367792178] [2022-04-15 02:39:04,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:39:04,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 02:39:04,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:39:04,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 02:39:04,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:04,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:39:04,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:39:04,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:39:04,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:39:04,302 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 02:39:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:04,576 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2022-04-15 02:39:04,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 02:39:04,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 02:39:04,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:39:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 02:39:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-04-15 02:39:04,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 02:39:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-04-15 02:39:04,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2022-04-15 02:39:04,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:04,661 INFO L225 Difference]: With dead ends: 42 [2022-04-15 02:39:04,662 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 02:39:04,662 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:39:04,663 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 02:39:04,664 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 65 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 02:39:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 02:39:04,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 02:39:04,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:39:04,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 02:39:04,678 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 02:39:04,678 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 02:39:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:04,681 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 02:39:04,681 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 02:39:04,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:04,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:04,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 32 states. [2022-04-15 02:39:04,683 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 32 states. [2022-04-15 02:39:04,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:04,685 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 02:39:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 02:39:04,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:04,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:04,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:39:04,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:39:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 02:39:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-15 02:39:04,696 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2022-04-15 02:39:04,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:39:04,697 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-15 02:39:04,697 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 02:39:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 02:39:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 02:39:04,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:39:04,704 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:39:04,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 02:39:04,705 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:39:04,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:39:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash -793509026, now seen corresponding path program 1 times [2022-04-15 02:39:04,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:39:04,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528630702] [2022-04-15 02:39:04,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:39:04,744 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:39:04,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [999235135] [2022-04-15 02:39:04,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:04,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:39:04,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:39:04,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:39:04,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 02:39:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:04,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 02:39:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:04,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:39:05,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {452#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-15 02:39:05,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {452#true} is VALID [2022-04-15 02:39:05,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-15 02:39:05,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {452#true} {452#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-15 02:39:05,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {452#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-15 02:39:05,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#true} [89] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {452#true} is VALID [2022-04-15 02:39:05,071 INFO L272 TraceCheckUtils]: 6: Hoare triple {452#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {452#true} is VALID [2022-04-15 02:39:05,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {452#true} is VALID [2022-04-15 02:39:05,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {452#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-15 02:39:05,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-15 02:39:05,071 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {452#true} {452#true} [122] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {452#true} is VALID [2022-04-15 02:39:05,072 INFO L272 TraceCheckUtils]: 11: Hoare triple {452#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {452#true} is VALID [2022-04-15 02:39:05,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {452#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {452#true} is VALID [2022-04-15 02:39:05,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-15 02:39:05,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {452#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-15 02:39:05,072 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {452#true} {452#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {452#true} is VALID [2022-04-15 02:39:05,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {452#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-15 02:39:05,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-15 02:39:05,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [102] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-15 02:39:05,075 INFO L272 TraceCheckUtils]: 19: Hoare triple {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {515#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:39:05,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {515#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {519#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:39:05,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {519#(<= 1 __VERIFIER_assert_~cond)} [107] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {453#false} is VALID [2022-04-15 02:39:05,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {453#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {453#false} is VALID [2022-04-15 02:39:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 02:39:05,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:39:05,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:39:05,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528630702] [2022-04-15 02:39:05,077 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:39:05,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999235135] [2022-04-15 02:39:05,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999235135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:39:05,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:39:05,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 02:39:05,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653512141] [2022-04-15 02:39:05,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:39:05,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 02:39:05,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:39:05,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 02:39:05,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:05,112 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:39:05,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:39:05,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:39:05,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:39:05,113 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 02:39:05,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:05,341 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-15 02:39:05,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:39:05,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 02:39:05,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:39:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 02:39:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 02:39:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 02:39:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 02:39:05,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-15 02:39:05,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:05,431 INFO L225 Difference]: With dead ends: 49 [2022-04-15 02:39:05,431 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 02:39:05,432 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:39:05,433 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:39:05,434 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:39:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 02:39:05,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-15 02:39:05,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:39:05,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 02:39:05,443 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 02:39:05,444 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 02:39:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:05,450 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-15 02:39:05,450 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-15 02:39:05,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:05,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:05,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-15 02:39:05,452 INFO L87 Difference]: Start difference. First operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-15 02:39:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:05,456 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-15 02:39:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-15 02:39:05,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:05,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:05,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:39:05,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:39:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 02:39:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2022-04-15 02:39:05,460 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2022-04-15 02:39:05,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:39:05,461 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2022-04-15 02:39:05,461 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 02:39:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-15 02:39:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 02:39:05,462 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:39:05,462 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:39:05,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 02:39:05,685 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:39:05,686 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:39:05,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:39:05,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2115229340, now seen corresponding path program 1 times [2022-04-15 02:39:05,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:39:05,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011154910] [2022-04-15 02:39:05,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:05,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:39:05,709 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:39:05,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [94343788] [2022-04-15 02:39:05,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:05,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:39:05,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:39:05,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:39:05,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 02:39:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:05,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 02:39:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:05,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:39:06,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {767#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {767#true} is VALID [2022-04-15 02:39:06,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {767#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {767#true} is VALID [2022-04-15 02:39:06,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {767#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {767#true} is VALID [2022-04-15 02:39:06,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {767#true} {767#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {767#true} is VALID [2022-04-15 02:39:06,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {767#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {767#true} is VALID [2022-04-15 02:39:06,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {767#true} [89] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {767#true} is VALID [2022-04-15 02:39:06,049 INFO L272 TraceCheckUtils]: 6: Hoare triple {767#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {767#true} is VALID [2022-04-15 02:39:06,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {767#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {793#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:39:06,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {793#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {797#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:39:06,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {797#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {797#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:39:06,058 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {797#(not (= |assume_abort_if_not_#in~cond| 0))} {767#true} [122] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {804#(<= 1 main_~x~0)} is VALID [2022-04-15 02:39:06,059 INFO L272 TraceCheckUtils]: 11: Hoare triple {804#(<= 1 main_~x~0)} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {767#true} is VALID [2022-04-15 02:39:06,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {767#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {767#true} is VALID [2022-04-15 02:39:06,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {767#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {767#true} is VALID [2022-04-15 02:39:06,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {767#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {767#true} is VALID [2022-04-15 02:39:06,062 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {767#true} {804#(<= 1 main_~x~0)} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {804#(<= 1 main_~x~0)} is VALID [2022-04-15 02:39:06,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {804#(<= 1 main_~x~0)} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:06,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:06,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [102] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:06,065 INFO L272 TraceCheckUtils]: 19: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {767#true} is VALID [2022-04-15 02:39:06,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {767#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {767#true} is VALID [2022-04-15 02:39:06,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {767#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {767#true} is VALID [2022-04-15 02:39:06,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {767#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {767#true} is VALID [2022-04-15 02:39:06,068 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {767#true} {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:06,071 INFO L272 TraceCheckUtils]: 24: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {848#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:39:06,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {848#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {852#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:39:06,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {852#(<= 1 __VERIFIER_assert_~cond)} [107] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {768#false} is VALID [2022-04-15 02:39:06,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {768#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#false} is VALID [2022-04-15 02:39:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 02:39:06,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:39:36,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:39:36,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011154910] [2022-04-15 02:39:36,074 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:39:36,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94343788] [2022-04-15 02:39:36,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94343788] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 02:39:36,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 02:39:36,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-15 02:39:36,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197908272] [2022-04-15 02:39:36,075 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-15 02:39:36,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-15 02:39:36,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:39:36,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 02:39:36,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:36,101 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 02:39:36,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:39:36,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 02:39:36,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 02:39:36,102 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 02:39:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:36,587 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-04-15 02:39:36,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 02:39:36,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-15 02:39:36,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:39:36,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 02:39:36,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-04-15 02:39:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 02:39:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-04-15 02:39:36,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 64 transitions. [2022-04-15 02:39:36,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:36,656 INFO L225 Difference]: With dead ends: 53 [2022-04-15 02:39:36,656 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 02:39:36,656 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-15 02:39:36,657 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 21 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 02:39:36,657 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 185 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 02:39:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 02:39:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-15 02:39:36,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:39:36,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 02:39:36,684 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 02:39:36,684 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 02:39:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:36,688 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-15 02:39:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-04-15 02:39:36,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:36,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:36,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 51 states. [2022-04-15 02:39:36,691 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 51 states. [2022-04-15 02:39:36,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:36,694 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-15 02:39:36,694 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-04-15 02:39:36,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:36,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:36,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:39:36,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:39:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 02:39:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2022-04-15 02:39:36,698 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 28 [2022-04-15 02:39:36,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:39:36,700 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2022-04-15 02:39:36,700 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 02:39:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-15 02:39:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 02:39:36,701 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:39:36,701 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:39:36,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 02:39:36,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 02:39:36,920 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:39:36,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:39:36,920 INFO L85 PathProgramCache]: Analyzing trace with hash -864241798, now seen corresponding path program 1 times [2022-04-15 02:39:36,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:39:36,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986616768] [2022-04-15 02:39:36,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:36,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:39:36,946 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:39:36,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1420470489] [2022-04-15 02:39:36,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:36,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:39:36,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:39:36,952 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:39:36,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 02:39:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:37,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 02:39:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:37,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:39:37,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {1136#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {1136#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1136#true} is VALID [2022-04-15 02:39:37,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {1136#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1136#true} {1136#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {1136#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {1136#true} [89] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1136#true} is VALID [2022-04-15 02:39:37,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {1136#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1136#true} is VALID [2022-04-15 02:39:37,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {1136#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1162#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:39:37,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {1162#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1166#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:39:37,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {1166#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1166#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:39:37,262 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1166#(not (= |assume_abort_if_not_#in~cond| 0))} {1136#true} [122] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1173#(<= 1 main_~x~0)} is VALID [2022-04-15 02:39:37,262 INFO L272 TraceCheckUtils]: 11: Hoare triple {1173#(<= 1 main_~x~0)} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1136#true} is VALID [2022-04-15 02:39:37,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {1136#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1136#true} is VALID [2022-04-15 02:39:37,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {1136#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {1136#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,263 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1136#true} {1173#(<= 1 main_~x~0)} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1173#(<= 1 main_~x~0)} is VALID [2022-04-15 02:39:37,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {1173#(<= 1 main_~x~0)} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 02:39:37,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 02:39:37,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [102] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 02:39:37,265 INFO L272 TraceCheckUtils]: 19: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1136#true} is VALID [2022-04-15 02:39:37,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {1136#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1136#true} is VALID [2022-04-15 02:39:37,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {1136#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {1136#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,266 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1136#true} {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 02:39:37,267 INFO L272 TraceCheckUtils]: 24: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1136#true} is VALID [2022-04-15 02:39:37,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {1136#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1136#true} is VALID [2022-04-15 02:39:37,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {1136#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {1136#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,270 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1136#true} {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 02:39:37,272 INFO L272 TraceCheckUtils]: 29: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:39:37,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1236#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:39:37,273 INFO L290 TraceCheckUtils]: 31: Hoare triple {1236#(<= 1 __VERIFIER_assert_~cond)} [107] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1137#false} is VALID [2022-04-15 02:39:37,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {1137#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1137#false} is VALID [2022-04-15 02:39:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 02:39:37,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:39:37,479 INFO L290 TraceCheckUtils]: 32: Hoare triple {1137#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1137#false} is VALID [2022-04-15 02:39:37,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {1236#(<= 1 __VERIFIER_assert_~cond)} [107] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1137#false} is VALID [2022-04-15 02:39:37,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1236#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:39:37,481 INFO L272 TraceCheckUtils]: 29: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:39:37,482 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1136#true} {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 02:39:37,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {1136#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {1136#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {1136#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1136#true} is VALID [2022-04-15 02:39:37,483 INFO L272 TraceCheckUtils]: 24: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1136#true} is VALID [2022-04-15 02:39:37,483 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1136#true} {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 02:39:37,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {1136#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {1136#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {1136#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1136#true} is VALID [2022-04-15 02:39:37,484 INFO L272 TraceCheckUtils]: 19: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1136#true} is VALID [2022-04-15 02:39:37,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [102] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 02:39:37,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 02:39:37,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {1136#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 02:39:37,486 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1136#true} {1136#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1136#true} is VALID [2022-04-15 02:39:37,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {1136#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {1136#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {1136#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1136#true} is VALID [2022-04-15 02:39:37,486 INFO L272 TraceCheckUtils]: 11: Hoare triple {1136#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1136#true} is VALID [2022-04-15 02:39:37,486 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1136#true} {1136#true} [122] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1136#true} is VALID [2022-04-15 02:39:37,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {1136#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {1136#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {1136#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1136#true} is VALID [2022-04-15 02:39:37,487 INFO L272 TraceCheckUtils]: 6: Hoare triple {1136#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1136#true} is VALID [2022-04-15 02:39:37,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {1136#true} [89] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1136#true} is VALID [2022-04-15 02:39:37,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {1136#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1136#true} {1136#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {1136#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {1136#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1136#true} is VALID [2022-04-15 02:39:37,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {1136#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-15 02:39:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 02:39:37,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:39:37,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986616768] [2022-04-15 02:39:37,488 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:39:37,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420470489] [2022-04-15 02:39:37,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420470489] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 02:39:37,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 02:39:37,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-15 02:39:37,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094272060] [2022-04-15 02:39:37,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:39:37,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 02:39:37,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:39:37,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 02:39:37,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:37,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:39:37,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:39:37,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:39:37,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 02:39:37,538 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 02:39:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:37,864 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2022-04-15 02:39:37,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:39:37,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 02:39:37,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:39:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 02:39:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 02:39:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 02:39:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 02:39:37,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-15 02:39:37,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:37,928 INFO L225 Difference]: With dead ends: 75 [2022-04-15 02:39:37,928 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 02:39:37,929 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 02:39:37,931 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 02:39:37,931 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 128 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 02:39:37,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 02:39:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-15 02:39:37,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:39:37,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 02:39:37,972 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 02:39:37,972 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 02:39:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:37,978 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2022-04-15 02:39:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-04-15 02:39:37,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:37,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:37,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-15 02:39:37,982 INFO L87 Difference]: Start difference. First operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-15 02:39:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:37,987 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2022-04-15 02:39:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-04-15 02:39:37,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:37,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:37,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:39:37,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:39:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 02:39:37,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2022-04-15 02:39:37,993 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 33 [2022-04-15 02:39:37,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:39:37,993 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2022-04-15 02:39:37,993 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 02:39:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-04-15 02:39:37,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 02:39:37,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:39:37,996 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:39:38,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 02:39:38,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:39:38,204 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:39:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:39:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash -120478471, now seen corresponding path program 1 times [2022-04-15 02:39:38,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:39:38,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960489419] [2022-04-15 02:39:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:39:38,231 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:39:38,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [720474318] [2022-04-15 02:39:38,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:38,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:39:38,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:39:38,238 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:39:38,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 02:39:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:38,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 02:39:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:38,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:39:38,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {1712#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-15 02:39:38,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {1712#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1712#true} is VALID [2022-04-15 02:39:38,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {1712#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-15 02:39:38,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1712#true} {1712#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-15 02:39:38,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {1712#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-15 02:39:38,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {1712#true} [89] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1712#true} is VALID [2022-04-15 02:39:38,401 INFO L272 TraceCheckUtils]: 6: Hoare triple {1712#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1712#true} is VALID [2022-04-15 02:39:38,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {1712#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1712#true} is VALID [2022-04-15 02:39:38,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {1712#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-15 02:39:38,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {1712#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-15 02:39:38,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1712#true} {1712#true} [122] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1712#true} is VALID [2022-04-15 02:39:38,402 INFO L272 TraceCheckUtils]: 11: Hoare triple {1712#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1712#true} is VALID [2022-04-15 02:39:38,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {1712#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1712#true} is VALID [2022-04-15 02:39:38,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {1712#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-15 02:39:38,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {1712#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-15 02:39:38,402 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1712#true} {1712#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1712#true} is VALID [2022-04-15 02:39:38,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {1712#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1712#true} is VALID [2022-04-15 02:39:38,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#true} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1712#true} is VALID [2022-04-15 02:39:38,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {1712#true} [102] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1712#true} is VALID [2022-04-15 02:39:38,403 INFO L272 TraceCheckUtils]: 19: Hoare triple {1712#true} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1712#true} is VALID [2022-04-15 02:39:38,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {1712#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1712#true} is VALID [2022-04-15 02:39:38,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {1712#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-15 02:39:38,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {1712#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-15 02:39:38,404 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1712#true} {1712#true} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1712#true} is VALID [2022-04-15 02:39:38,404 INFO L272 TraceCheckUtils]: 24: Hoare triple {1712#true} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1712#true} is VALID [2022-04-15 02:39:38,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {1712#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1712#true} is VALID [2022-04-15 02:39:38,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {1712#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-15 02:39:38,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {1712#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-15 02:39:38,404 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1712#true} {1712#true} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1712#true} is VALID [2022-04-15 02:39:38,404 INFO L272 TraceCheckUtils]: 29: Hoare triple {1712#true} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1712#true} is VALID [2022-04-15 02:39:38,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {1712#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1712#true} is VALID [2022-04-15 02:39:38,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {1712#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-15 02:39:38,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {1712#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-15 02:39:38,405 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1712#true} {1712#true} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1712#true} is VALID [2022-04-15 02:39:38,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {1712#true} [116] L37-->L34-3: Formula: (= v_main_~a~0_8 v_main_~b~0_10) InVars {main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {1819#(= main_~b~0 main_~a~0)} is VALID [2022-04-15 02:39:38,406 INFO L272 TraceCheckUtils]: 35: Hoare triple {1819#(= main_~b~0 main_~a~0)} [100] L34-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {1823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:39:38,406 INFO L290 TraceCheckUtils]: 36: Hoare triple {1823#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:39:38,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {1827#(<= 1 __VERIFIER_assert_~cond)} [107] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1713#false} is VALID [2022-04-15 02:39:38,407 INFO L290 TraceCheckUtils]: 38: Hoare triple {1713#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1713#false} is VALID [2022-04-15 02:39:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 02:39:38,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:39:38,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:39:38,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960489419] [2022-04-15 02:39:38,408 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:39:38,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720474318] [2022-04-15 02:39:38,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720474318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:39:38,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:39:38,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 02:39:38,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177179923] [2022-04-15 02:39:38,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:39:38,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-04-15 02:39:38,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:39:38,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 02:39:38,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:38,431 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:39:38,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:39:38,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:39:38,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:39:38,432 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 02:39:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:38,611 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2022-04-15 02:39:38,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:39:38,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-04-15 02:39:38,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:39:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 02:39:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-15 02:39:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 02:39:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-15 02:39:38,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-15 02:39:38,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:38,658 INFO L225 Difference]: With dead ends: 87 [2022-04-15 02:39:38,658 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 02:39:38,658 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:39:38,659 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:39:38,659 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 144 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:39:38,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 02:39:38,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2022-04-15 02:39:38,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:39:38,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-15 02:39:38,693 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-15 02:39:38,694 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-15 02:39:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:38,698 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2022-04-15 02:39:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2022-04-15 02:39:38,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:38,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:38,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) Second operand 85 states. [2022-04-15 02:39:38,699 INFO L87 Difference]: Start difference. First operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) Second operand 85 states. [2022-04-15 02:39:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:38,703 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2022-04-15 02:39:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2022-04-15 02:39:38,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:38,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:38,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:39:38,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:39:38,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-15 02:39:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2022-04-15 02:39:38,708 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 39 [2022-04-15 02:39:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:39:38,708 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2022-04-15 02:39:38,709 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 02:39:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2022-04-15 02:39:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 02:39:38,710 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:39:38,710 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:39:38,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 02:39:38,925 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:39:38,925 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:39:38,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:39:38,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1628466672, now seen corresponding path program 1 times [2022-04-15 02:39:38,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:39:38,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265029737] [2022-04-15 02:39:38,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:38,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:39:38,938 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:39:38,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [757544380] [2022-04-15 02:39:38,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:38,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:39:38,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:39:38,940 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:39:38,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 02:39:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:38,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 02:39:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:39,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:39:39,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {2263#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-15 02:39:39,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {2263#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {2271#(<= ~counter~0 0)} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2271#(<= ~counter~0 0)} {2263#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {2271#(<= ~counter~0 0)} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {2271#(<= ~counter~0 0)} [89] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,211 INFO L272 TraceCheckUtils]: 6: Hoare triple {2271#(<= ~counter~0 0)} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {2271#(<= ~counter~0 0)} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {2271#(<= ~counter~0 0)} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {2271#(<= ~counter~0 0)} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,212 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2271#(<= ~counter~0 0)} {2271#(<= ~counter~0 0)} [122] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,213 INFO L272 TraceCheckUtils]: 11: Hoare triple {2271#(<= ~counter~0 0)} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {2271#(<= ~counter~0 0)} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {2271#(<= ~counter~0 0)} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {2271#(<= ~counter~0 0)} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,215 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2271#(<= ~counter~0 0)} {2271#(<= ~counter~0 0)} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {2271#(<= ~counter~0 0)} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {2271#(<= ~counter~0 0)} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {2320#(<= ~counter~0 1)} [102] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,223 INFO L272 TraceCheckUtils]: 19: Hoare triple {2320#(<= ~counter~0 1)} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {2320#(<= ~counter~0 1)} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {2320#(<= ~counter~0 1)} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {2320#(<= ~counter~0 1)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,225 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2320#(<= ~counter~0 1)} {2320#(<= ~counter~0 1)} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,226 INFO L272 TraceCheckUtils]: 24: Hoare triple {2320#(<= ~counter~0 1)} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {2320#(<= ~counter~0 1)} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {2320#(<= ~counter~0 1)} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {2320#(<= ~counter~0 1)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,228 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2320#(<= ~counter~0 1)} {2320#(<= ~counter~0 1)} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,228 INFO L272 TraceCheckUtils]: 29: Hoare triple {2320#(<= ~counter~0 1)} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {2320#(<= ~counter~0 1)} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,229 INFO L290 TraceCheckUtils]: 31: Hoare triple {2320#(<= ~counter~0 1)} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,229 INFO L290 TraceCheckUtils]: 32: Hoare triple {2320#(<= ~counter~0 1)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,230 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2320#(<= ~counter~0 1)} {2320#(<= ~counter~0 1)} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,230 INFO L290 TraceCheckUtils]: 34: Hoare triple {2320#(<= ~counter~0 1)} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {2320#(<= ~counter~0 1)} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,231 INFO L290 TraceCheckUtils]: 36: Hoare triple {2320#(<= ~counter~0 1)} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2378#(<= |main_#t~post6| 1)} is VALID [2022-04-15 02:39:39,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {2378#(<= |main_#t~post6| 1)} [101] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2264#false} is VALID [2022-04-15 02:39:39,232 INFO L272 TraceCheckUtils]: 38: Hoare triple {2264#false} [100] L34-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2264#false} is VALID [2022-04-15 02:39:39,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {2264#false} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2264#false} is VALID [2022-04-15 02:39:39,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {2264#false} [107] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2264#false} is VALID [2022-04-15 02:39:39,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {2264#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2264#false} is VALID [2022-04-15 02:39:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 02:39:39,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:39:39,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {2264#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2264#false} is VALID [2022-04-15 02:39:39,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {2264#false} [107] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2264#false} is VALID [2022-04-15 02:39:39,419 INFO L290 TraceCheckUtils]: 39: Hoare triple {2264#false} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2264#false} is VALID [2022-04-15 02:39:39,419 INFO L272 TraceCheckUtils]: 38: Hoare triple {2264#false} [100] L34-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2264#false} is VALID [2022-04-15 02:39:39,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {2378#(<= |main_#t~post6| 1)} [101] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2264#false} is VALID [2022-04-15 02:39:39,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {2320#(<= ~counter~0 1)} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2378#(<= |main_#t~post6| 1)} is VALID [2022-04-15 02:39:39,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {2320#(<= ~counter~0 1)} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {2320#(<= ~counter~0 1)} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,422 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2263#true} {2320#(<= ~counter~0 1)} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,422 INFO L290 TraceCheckUtils]: 32: Hoare triple {2263#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-15 02:39:39,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {2263#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-15 02:39:39,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {2263#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2263#true} is VALID [2022-04-15 02:39:39,422 INFO L272 TraceCheckUtils]: 29: Hoare triple {2320#(<= ~counter~0 1)} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2263#true} is VALID [2022-04-15 02:39:39,423 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2263#true} {2320#(<= ~counter~0 1)} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {2263#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-15 02:39:39,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {2263#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-15 02:39:39,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {2263#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2263#true} is VALID [2022-04-15 02:39:39,424 INFO L272 TraceCheckUtils]: 24: Hoare triple {2320#(<= ~counter~0 1)} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2263#true} is VALID [2022-04-15 02:39:39,424 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2263#true} {2320#(<= ~counter~0 1)} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {2263#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-15 02:39:39,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {2263#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-15 02:39:39,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {2263#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2263#true} is VALID [2022-04-15 02:39:39,425 INFO L272 TraceCheckUtils]: 19: Hoare triple {2320#(<= ~counter~0 1)} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2263#true} is VALID [2022-04-15 02:39:39,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {2320#(<= ~counter~0 1)} [102] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {2271#(<= ~counter~0 0)} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2320#(<= ~counter~0 1)} is VALID [2022-04-15 02:39:39,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {2271#(<= ~counter~0 0)} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,427 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2263#true} {2271#(<= ~counter~0 0)} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {2263#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-15 02:39:39,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {2263#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-15 02:39:39,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {2263#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2263#true} is VALID [2022-04-15 02:39:39,427 INFO L272 TraceCheckUtils]: 11: Hoare triple {2271#(<= ~counter~0 0)} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2263#true} is VALID [2022-04-15 02:39:39,428 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2263#true} {2271#(<= ~counter~0 0)} [122] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {2263#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-15 02:39:39,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {2263#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-15 02:39:39,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {2263#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2263#true} is VALID [2022-04-15 02:39:39,428 INFO L272 TraceCheckUtils]: 6: Hoare triple {2271#(<= ~counter~0 0)} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2263#true} is VALID [2022-04-15 02:39:39,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {2271#(<= ~counter~0 0)} [89] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {2271#(<= ~counter~0 0)} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2271#(<= ~counter~0 0)} {2263#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {2271#(<= ~counter~0 0)} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {2263#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2271#(<= ~counter~0 0)} is VALID [2022-04-15 02:39:39,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {2263#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-15 02:39:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 02:39:39,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:39:39,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265029737] [2022-04-15 02:39:39,443 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:39:39,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757544380] [2022-04-15 02:39:39,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757544380] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:39:39,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 02:39:39,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-15 02:39:39,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200213046] [2022-04-15 02:39:39,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 02:39:39,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 42 [2022-04-15 02:39:39,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:39:39,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-15 02:39:39,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:39,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:39:39,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:39:39,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:39:39,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:39:39,484 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-15 02:39:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:39,675 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2022-04-15 02:39:39,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 02:39:39,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 42 [2022-04-15 02:39:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:39:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-15 02:39:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-15 02:39:39,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-15 02:39:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-15 02:39:39,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-04-15 02:39:39,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:39,760 INFO L225 Difference]: With dead ends: 121 [2022-04-15 02:39:39,760 INFO L226 Difference]: Without dead ends: 102 [2022-04-15 02:39:39,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:39:39,761 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:39:39,761 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 118 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:39:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-15 02:39:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2022-04-15 02:39:39,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:39:39,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 63 states have internal predecessors, (69), 31 states have call successors, (31), 13 states have call predecessors, (31), 11 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-15 02:39:39,804 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 63 states have internal predecessors, (69), 31 states have call successors, (31), 13 states have call predecessors, (31), 11 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-15 02:39:39,804 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 63 states have internal predecessors, (69), 31 states have call successors, (31), 13 states have call predecessors, (31), 11 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-15 02:39:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:39,808 INFO L93 Difference]: Finished difference Result 102 states and 128 transitions. [2022-04-15 02:39:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 128 transitions. [2022-04-15 02:39:39,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:39,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:39,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 63 states have internal predecessors, (69), 31 states have call successors, (31), 13 states have call predecessors, (31), 11 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) Second operand 102 states. [2022-04-15 02:39:39,809 INFO L87 Difference]: Start difference. First operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 63 states have internal predecessors, (69), 31 states have call successors, (31), 13 states have call predecessors, (31), 11 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) Second operand 102 states. [2022-04-15 02:39:39,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:39,814 INFO L93 Difference]: Finished difference Result 102 states and 128 transitions. [2022-04-15 02:39:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 128 transitions. [2022-04-15 02:39:39,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:39,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:39,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:39:39,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:39:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 63 states have internal predecessors, (69), 31 states have call successors, (31), 13 states have call predecessors, (31), 11 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-15 02:39:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2022-04-15 02:39:39,819 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 42 [2022-04-15 02:39:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:39:39,819 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2022-04-15 02:39:39,819 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-15 02:39:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2022-04-15 02:39:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 02:39:39,820 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:39:39,820 INFO L499 BasicCegarLoop]: 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, 1, 1] [2022-04-15 02:39:39,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 02:39:40,039 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:39:40,040 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:39:40,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:39:40,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1627394196, now seen corresponding path program 1 times [2022-04-15 02:39:40,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:39:40,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119974091] [2022-04-15 02:39:40,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:40,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:39:40,058 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:39:40,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845636491] [2022-04-15 02:39:40,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:40,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:39:40,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:39:40,060 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:39:40,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 02:39:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:40,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 02:39:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:40,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:39:40,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {3055#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3055#true} is VALID [2022-04-15 02:39:40,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {3055#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {3055#true} is VALID [2022-04-15 02:39:40,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {3055#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3055#true} is VALID [2022-04-15 02:39:40,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3055#true} {3055#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3055#true} is VALID [2022-04-15 02:39:40,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {3055#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3055#true} is VALID [2022-04-15 02:39:40,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {3055#true} [89] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3055#true} is VALID [2022-04-15 02:39:40,331 INFO L272 TraceCheckUtils]: 6: Hoare triple {3055#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3055#true} is VALID [2022-04-15 02:39:40,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {3055#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3055#true} is VALID [2022-04-15 02:39:40,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {3055#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3055#true} is VALID [2022-04-15 02:39:40,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {3055#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3055#true} is VALID [2022-04-15 02:39:40,332 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3055#true} {3055#true} [122] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3055#true} is VALID [2022-04-15 02:39:40,332 INFO L272 TraceCheckUtils]: 11: Hoare triple {3055#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3055#true} is VALID [2022-04-15 02:39:40,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {3055#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3055#true} is VALID [2022-04-15 02:39:40,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {3055#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3055#true} is VALID [2022-04-15 02:39:40,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {3055#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3055#true} is VALID [2022-04-15 02:39:40,332 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3055#true} {3055#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3055#true} is VALID [2022-04-15 02:39:40,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {3055#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:40,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:40,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [102] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:40,334 INFO L272 TraceCheckUtils]: 19: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3055#true} is VALID [2022-04-15 02:39:40,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {3055#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3055#true} is VALID [2022-04-15 02:39:40,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {3055#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3055#true} is VALID [2022-04-15 02:39:40,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {3055#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3055#true} is VALID [2022-04-15 02:39:40,335 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3055#true} {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:40,335 INFO L272 TraceCheckUtils]: 24: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3055#true} is VALID [2022-04-15 02:39:40,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {3055#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3055#true} is VALID [2022-04-15 02:39:40,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {3055#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3055#true} is VALID [2022-04-15 02:39:40,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {3055#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3055#true} is VALID [2022-04-15 02:39:40,336 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3055#true} {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:40,336 INFO L272 TraceCheckUtils]: 29: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3055#true} is VALID [2022-04-15 02:39:40,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {3055#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3055#true} is VALID [2022-04-15 02:39:40,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {3055#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3055#true} is VALID [2022-04-15 02:39:40,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {3055#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3055#true} is VALID [2022-04-15 02:39:40,337 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3055#true} {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:40,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:40,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:40,339 INFO L290 TraceCheckUtils]: 36: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:40,339 INFO L290 TraceCheckUtils]: 37: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [102] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:40,340 INFO L272 TraceCheckUtils]: 38: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3175#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:39:40,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {3175#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3179#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:39:40,341 INFO L290 TraceCheckUtils]: 40: Hoare triple {3179#(<= 1 __VERIFIER_assert_~cond)} [107] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3056#false} is VALID [2022-04-15 02:39:40,341 INFO L290 TraceCheckUtils]: 41: Hoare triple {3056#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3056#false} is VALID [2022-04-15 02:39:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-15 02:39:40,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:39:40,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:39:40,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119974091] [2022-04-15 02:39:40,342 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:39:40,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845636491] [2022-04-15 02:39:40,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845636491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:39:40,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:39:40,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 02:39:40,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175071285] [2022-04-15 02:39:40,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:39:40,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2022-04-15 02:39:40,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:39:40,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 02:39:40,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:40,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:39:40,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:39:40,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:39:40,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:39:40,388 INFO L87 Difference]: Start difference. First operand 100 states and 127 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 02:39:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:40,587 INFO L93 Difference]: Finished difference Result 106 states and 132 transitions. [2022-04-15 02:39:40,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:39:40,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2022-04-15 02:39:40,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:39:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 02:39:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-15 02:39:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 02:39:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-15 02:39:40,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-04-15 02:39:40,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:40,649 INFO L225 Difference]: With dead ends: 106 [2022-04-15 02:39:40,649 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 02:39:40,649 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:39:40,650 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:39:40,650 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 132 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:39:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 02:39:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-15 02:39:40,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:39:40,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 60 states have (on average 1.2) internal successors, (72), 66 states have internal predecessors, (72), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:39:40,690 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 60 states have (on average 1.2) internal successors, (72), 66 states have internal predecessors, (72), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:39:40,691 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 60 states have (on average 1.2) internal successors, (72), 66 states have internal predecessors, (72), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:39:40,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:40,694 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-04-15 02:39:40,695 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-15 02:39:40,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:40,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:40,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 60 states have (on average 1.2) internal successors, (72), 66 states have internal predecessors, (72), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) Second operand 103 states. [2022-04-15 02:39:40,696 INFO L87 Difference]: Start difference. First operand has 103 states, 60 states have (on average 1.2) internal successors, (72), 66 states have internal predecessors, (72), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) Second operand 103 states. [2022-04-15 02:39:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:40,699 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-04-15 02:39:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-15 02:39:40,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:40,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:40,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:39:40,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:39:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 60 states have (on average 1.2) internal successors, (72), 66 states have internal predecessors, (72), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:39:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2022-04-15 02:39:40,704 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 42 [2022-04-15 02:39:40,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:39:40,704 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2022-04-15 02:39:40,704 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 02:39:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-15 02:39:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 02:39:40,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:39:40,705 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:39:40,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 02:39:40,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:39:40,928 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:39:40,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:39:40,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1527150038, now seen corresponding path program 1 times [2022-04-15 02:39:40,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:39:40,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678499750] [2022-04-15 02:39:40,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:40,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:39:40,939 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:39:40,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1048948770] [2022-04-15 02:39:40,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:40,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:39:40,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:39:40,940 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:39:40,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 02:39:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:40,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 02:39:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:40,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:39:41,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {3703#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:41,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {3703#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {3703#true} is VALID [2022-04-15 02:39:41,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {3703#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:41,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3703#true} {3703#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:41,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {3703#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:41,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {3703#true} [89] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3703#true} is VALID [2022-04-15 02:39:41,149 INFO L272 TraceCheckUtils]: 6: Hoare triple {3703#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3703#true} is VALID [2022-04-15 02:39:41,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {3703#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3703#true} is VALID [2022-04-15 02:39:41,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {3703#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:41,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {3703#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:41,149 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3703#true} {3703#true} [122] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3703#true} is VALID [2022-04-15 02:39:41,149 INFO L272 TraceCheckUtils]: 11: Hoare triple {3703#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3703#true} is VALID [2022-04-15 02:39:41,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {3703#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3703#true} is VALID [2022-04-15 02:39:41,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {3703#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:41,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {3703#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:41,149 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3703#true} {3703#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3703#true} is VALID [2022-04-15 02:39:41,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {3703#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3703#true} is VALID [2022-04-15 02:39:41,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {3703#true} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3703#true} is VALID [2022-04-15 02:39:41,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {3703#true} [102] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3703#true} is VALID [2022-04-15 02:39:41,150 INFO L272 TraceCheckUtils]: 19: Hoare triple {3703#true} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3703#true} is VALID [2022-04-15 02:39:41,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {3703#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3703#true} is VALID [2022-04-15 02:39:41,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {3703#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:41,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {3703#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:41,151 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3703#true} {3703#true} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3703#true} is VALID [2022-04-15 02:39:41,151 INFO L272 TraceCheckUtils]: 24: Hoare triple {3703#true} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3703#true} is VALID [2022-04-15 02:39:41,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {3703#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3783#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:39:41,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {3783#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3787#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:39:41,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {3787#(not (= |__VERIFIER_assert_#in~cond| 0))} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3787#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:39:41,158 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3787#(not (= |__VERIFIER_assert_#in~cond| 0))} {3703#true} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:39:41,159 INFO L272 TraceCheckUtils]: 29: Hoare triple {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3703#true} is VALID [2022-04-15 02:39:41,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {3703#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3703#true} is VALID [2022-04-15 02:39:41,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {3703#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:41,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {3703#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:41,160 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3703#true} {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:39:41,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [116] L37-->L34-3: Formula: (= v_main_~a~0_8 v_main_~b~0_10) InVars {main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:39:41,160 INFO L272 TraceCheckUtils]: 35: Hoare triple {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [100] L34-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {3703#true} is VALID [2022-04-15 02:39:41,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {3703#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3703#true} is VALID [2022-04-15 02:39:41,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {3703#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:41,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {3703#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:41,162 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3703#true} {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [127] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:39:41,163 INFO L272 TraceCheckUtils]: 40: Hoare triple {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [103] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* (- 1) v_main_~b~0_14) (* v_main_~r~0_12 v_main_~y~0_13) (* v_main_~p~0_12 v_main_~x~0_13)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_13, main_~b~0=v_main_~b~0_14, main_~p~0=v_main_~p~0_12, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0] {3832#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:39:41,163 INFO L290 TraceCheckUtils]: 41: Hoare triple {3832#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3836#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:39:41,163 INFO L290 TraceCheckUtils]: 42: Hoare triple {3836#(<= 1 __VERIFIER_assert_~cond)} [107] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3704#false} is VALID [2022-04-15 02:39:41,164 INFO L290 TraceCheckUtils]: 43: Hoare triple {3704#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3704#false} is VALID [2022-04-15 02:39:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-15 02:39:41,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:39:55,185 INFO L290 TraceCheckUtils]: 43: Hoare triple {3704#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3704#false} is VALID [2022-04-15 02:39:55,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {3836#(<= 1 __VERIFIER_assert_~cond)} [107] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3704#false} is VALID [2022-04-15 02:39:55,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {3832#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3836#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:39:55,187 INFO L272 TraceCheckUtils]: 40: Hoare triple {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [103] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* (- 1) v_main_~b~0_14) (* v_main_~r~0_12 v_main_~y~0_13) (* v_main_~p~0_12 v_main_~x~0_13)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_13, main_~b~0=v_main_~b~0_14, main_~p~0=v_main_~p~0_12, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0] {3832#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:39:55,188 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3703#true} {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [127] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:39:55,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {3703#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:55,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {3703#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:55,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {3703#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3703#true} is VALID [2022-04-15 02:39:55,188 INFO L272 TraceCheckUtils]: 35: Hoare triple {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [100] L34-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {3703#true} is VALID [2022-04-15 02:39:55,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [116] L37-->L34-3: Formula: (= v_main_~a~0_8 v_main_~b~0_10) InVars {main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:39:55,189 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3703#true} {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:39:55,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {3703#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:55,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {3703#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:55,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {3703#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3703#true} is VALID [2022-04-15 02:39:55,190 INFO L272 TraceCheckUtils]: 29: Hoare triple {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3703#true} is VALID [2022-04-15 02:39:55,191 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3787#(not (= |__VERIFIER_assert_#in~cond| 0))} {3703#true} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:39:55,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {3787#(not (= |__VERIFIER_assert_#in~cond| 0))} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3787#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:39:55,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {3897#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3787#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:39:55,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {3703#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3897#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 02:39:55,192 INFO L272 TraceCheckUtils]: 24: Hoare triple {3703#true} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3703#true} is VALID [2022-04-15 02:39:55,192 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3703#true} {3703#true} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3703#true} is VALID [2022-04-15 02:39:55,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {3703#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:55,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {3703#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:55,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {3703#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3703#true} is VALID [2022-04-15 02:39:55,192 INFO L272 TraceCheckUtils]: 19: Hoare triple {3703#true} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3703#true} is VALID [2022-04-15 02:39:55,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {3703#true} [102] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3703#true} is VALID [2022-04-15 02:39:55,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {3703#true} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3703#true} is VALID [2022-04-15 02:39:55,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {3703#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3703#true} is VALID [2022-04-15 02:39:55,193 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3703#true} {3703#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3703#true} is VALID [2022-04-15 02:39:55,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {3703#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:55,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {3703#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:55,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {3703#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3703#true} is VALID [2022-04-15 02:39:55,193 INFO L272 TraceCheckUtils]: 11: Hoare triple {3703#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3703#true} is VALID [2022-04-15 02:39:55,193 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3703#true} {3703#true} [122] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3703#true} is VALID [2022-04-15 02:39:55,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {3703#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:55,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {3703#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:55,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {3703#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3703#true} is VALID [2022-04-15 02:39:55,193 INFO L272 TraceCheckUtils]: 6: Hoare triple {3703#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3703#true} is VALID [2022-04-15 02:39:55,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {3703#true} [89] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3703#true} is VALID [2022-04-15 02:39:55,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {3703#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:55,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3703#true} {3703#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:55,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {3703#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:55,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {3703#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {3703#true} is VALID [2022-04-15 02:39:55,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {3703#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3703#true} is VALID [2022-04-15 02:39:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-15 02:39:55,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:39:55,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678499750] [2022-04-15 02:39:55,195 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:39:55,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048948770] [2022-04-15 02:39:55,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048948770] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:39:55,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 02:39:55,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-15 02:39:55,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815755366] [2022-04-15 02:39:55,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 02:39:55,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-15 02:39:55,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:39:55,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 02:39:55,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:55,240 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 02:39:55,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:39:55,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 02:39:55,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 02:39:55,242 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 02:39:55,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:55,940 INFO L93 Difference]: Finished difference Result 118 states and 148 transitions. [2022-04-15 02:39:55,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 02:39:55,941 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-15 02:39:55,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:39:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 02:39:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2022-04-15 02:39:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 02:39:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2022-04-15 02:39:55,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 60 transitions. [2022-04-15 02:39:56,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:56,005 INFO L225 Difference]: With dead ends: 118 [2022-04-15 02:39:56,005 INFO L226 Difference]: Without dead ends: 106 [2022-04-15 02:39:56,006 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 02:39:56,006 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 02:39:56,006 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 140 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 02:39:56,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-15 02:39:56,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-04-15 02:39:56,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:39:56,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 104 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 67 states have internal predecessors, (71), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (28), 23 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 02:39:56,050 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 104 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 67 states have internal predecessors, (71), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (28), 23 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 02:39:56,051 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 104 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 67 states have internal predecessors, (71), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (28), 23 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 02:39:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:56,055 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2022-04-15 02:39:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-15 02:39:56,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:56,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:56,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 67 states have internal predecessors, (71), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (28), 23 states have call predecessors, (28), 28 states have call successors, (28) Second operand 106 states. [2022-04-15 02:39:56,056 INFO L87 Difference]: Start difference. First operand has 104 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 67 states have internal predecessors, (71), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (28), 23 states have call predecessors, (28), 28 states have call successors, (28) Second operand 106 states. [2022-04-15 02:39:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:56,060 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2022-04-15 02:39:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-15 02:39:56,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:56,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:56,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:39:56,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:39:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 67 states have internal predecessors, (71), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (28), 23 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 02:39:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2022-04-15 02:39:56,065 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 44 [2022-04-15 02:39:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:39:56,066 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2022-04-15 02:39:56,066 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 02:39:56,066 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2022-04-15 02:39:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 02:39:56,066 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:39:56,066 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 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-15 02:39:56,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 02:39:56,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:39:56,280 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:39:56,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:39:56,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1237367986, now seen corresponding path program 2 times [2022-04-15 02:39:56,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:39:56,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120385012] [2022-04-15 02:39:56,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:56,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:39:56,295 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:39:56,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2038560834] [2022-04-15 02:39:56,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 02:39:56,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:39:56,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:39:56,308 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:39:56,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 02:39:56,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 02:39:56,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 02:39:56,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 02:39:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:39:56,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:39:56,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {4525#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {4525#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {4525#true} is VALID [2022-04-15 02:39:56,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {4525#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4525#true} {4525#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {4525#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {4525#true} [89] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4525#true} is VALID [2022-04-15 02:39:56,752 INFO L272 TraceCheckUtils]: 6: Hoare triple {4525#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4525#true} is VALID [2022-04-15 02:39:56,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {4525#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4525#true} is VALID [2022-04-15 02:39:56,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {4525#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {4525#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,752 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4525#true} {4525#true} [122] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4525#true} is VALID [2022-04-15 02:39:56,752 INFO L272 TraceCheckUtils]: 11: Hoare triple {4525#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4525#true} is VALID [2022-04-15 02:39:56,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {4525#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4525#true} is VALID [2022-04-15 02:39:56,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {4525#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {4525#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,752 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4525#true} {4525#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4525#true} is VALID [2022-04-15 02:39:56,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {4525#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:56,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:56,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [102] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:56,754 INFO L272 TraceCheckUtils]: 19: Hoare triple {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4525#true} is VALID [2022-04-15 02:39:56,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {4525#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4525#true} is VALID [2022-04-15 02:39:56,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {4525#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {4525#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,755 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4525#true} {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:56,755 INFO L272 TraceCheckUtils]: 24: Hoare triple {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4525#true} is VALID [2022-04-15 02:39:56,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {4525#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4525#true} is VALID [2022-04-15 02:39:56,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {4525#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {4525#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,756 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4525#true} {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:56,756 INFO L272 TraceCheckUtils]: 29: Hoare triple {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4525#true} is VALID [2022-04-15 02:39:56,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {4525#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4525#true} is VALID [2022-04-15 02:39:56,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {4525#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {4525#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,757 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4525#true} {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:56,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:39:56,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} is VALID [2022-04-15 02:39:56,758 INFO L290 TraceCheckUtils]: 36: Hoare triple {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} is VALID [2022-04-15 02:39:56,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} [102] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} is VALID [2022-04-15 02:39:56,758 INFO L272 TraceCheckUtils]: 38: Hoare triple {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4525#true} is VALID [2022-04-15 02:39:56,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {4525#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4525#true} is VALID [2022-04-15 02:39:56,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {4525#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,759 INFO L290 TraceCheckUtils]: 41: Hoare triple {4525#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,759 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4525#true} {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} is VALID [2022-04-15 02:39:56,760 INFO L272 TraceCheckUtils]: 43: Hoare triple {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4661#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:39:56,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {4661#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4665#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:39:56,761 INFO L290 TraceCheckUtils]: 45: Hoare triple {4665#(<= 1 __VERIFIER_assert_~cond)} [107] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4526#false} is VALID [2022-04-15 02:39:56,761 INFO L290 TraceCheckUtils]: 46: Hoare triple {4526#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4526#false} is VALID [2022-04-15 02:39:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 02:39:56,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:39:56,951 INFO L290 TraceCheckUtils]: 46: Hoare triple {4526#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4526#false} is VALID [2022-04-15 02:39:56,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {4665#(<= 1 __VERIFIER_assert_~cond)} [107] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4526#false} is VALID [2022-04-15 02:39:56,952 INFO L290 TraceCheckUtils]: 44: Hoare triple {4661#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4665#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:39:56,953 INFO L272 TraceCheckUtils]: 43: Hoare triple {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4661#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:39:56,953 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4525#true} {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:39:56,953 INFO L290 TraceCheckUtils]: 41: Hoare triple {4525#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,953 INFO L290 TraceCheckUtils]: 40: Hoare triple {4525#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:56,953 INFO L290 TraceCheckUtils]: 39: Hoare triple {4525#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4525#true} is VALID [2022-04-15 02:39:56,953 INFO L272 TraceCheckUtils]: 38: Hoare triple {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4525#true} is VALID [2022-04-15 02:39:56,954 INFO L290 TraceCheckUtils]: 37: Hoare triple {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [102] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:39:56,954 INFO L290 TraceCheckUtils]: 36: Hoare triple {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:39:57,132 INFO L290 TraceCheckUtils]: 35: Hoare triple {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:39:57,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-15 02:39:57,133 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4525#true} {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-15 02:39:57,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {4525#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:57,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {4525#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:57,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {4525#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4525#true} is VALID [2022-04-15 02:39:57,134 INFO L272 TraceCheckUtils]: 29: Hoare triple {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4525#true} is VALID [2022-04-15 02:39:57,136 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4525#true} {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-15 02:39:57,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {4525#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:57,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {4525#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:57,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {4525#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4525#true} is VALID [2022-04-15 02:39:57,136 INFO L272 TraceCheckUtils]: 24: Hoare triple {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4525#true} is VALID [2022-04-15 02:39:57,137 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4525#true} {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-15 02:39:57,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {4525#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:57,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {4525#true} [108] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:57,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {4525#true} [104] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4525#true} is VALID [2022-04-15 02:39:57,137 INFO L272 TraceCheckUtils]: 19: Hoare triple {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4525#true} is VALID [2022-04-15 02:39:57,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [102] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-15 02:39:57,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [98] L42-2-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-15 02:39:57,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {4525#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-15 02:39:57,139 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4525#true} {4525#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4525#true} is VALID [2022-04-15 02:39:57,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {4525#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:57,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {4525#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:57,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {4525#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4525#true} is VALID [2022-04-15 02:39:57,139 INFO L272 TraceCheckUtils]: 11: Hoare triple {4525#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4525#true} is VALID [2022-04-15 02:39:57,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4525#true} {4525#true} [122] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4525#true} is VALID [2022-04-15 02:39:57,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {4525#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:57,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {4525#true} [96] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:57,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {4525#true} [93] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4525#true} is VALID [2022-04-15 02:39:57,139 INFO L272 TraceCheckUtils]: 6: Hoare triple {4525#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4525#true} is VALID [2022-04-15 02:39:57,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {4525#true} [89] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4525#true} is VALID [2022-04-15 02:39:57,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {4525#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:57,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4525#true} {4525#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:57,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {4525#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:57,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {4525#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {4525#true} is VALID [2022-04-15 02:39:57,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {4525#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#true} is VALID [2022-04-15 02:39:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 02:39:57,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:39:57,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120385012] [2022-04-15 02:39:57,140 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:39:57,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038560834] [2022-04-15 02:39:57,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038560834] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:39:57,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 02:39:57,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-15 02:39:57,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487698591] [2022-04-15 02:39:57,141 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 02:39:57,141 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 47 [2022-04-15 02:39:57,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:39:57,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 02:39:57,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:57,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 02:39:57,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:39:57,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 02:39:57,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 02:39:57,280 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 02:39:58,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:58,716 INFO L93 Difference]: Finished difference Result 131 states and 169 transitions. [2022-04-15 02:39:58,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 02:39:58,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 47 [2022-04-15 02:39:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:39:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 02:39:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-15 02:39:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 02:39:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-15 02:39:58,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2022-04-15 02:39:58,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:39:58,915 INFO L225 Difference]: With dead ends: 131 [2022-04-15 02:39:58,915 INFO L226 Difference]: Without dead ends: 124 [2022-04-15 02:39:58,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-15 02:39:58,916 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 02:39:58,917 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 150 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 02:39:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-15 02:39:58,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2022-04-15 02:39:58,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:39:58,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 108 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 72 states have internal predecessors, (76), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 02:39:58,957 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 108 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 72 states have internal predecessors, (76), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 02:39:58,958 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 108 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 72 states have internal predecessors, (76), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 02:39:58,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:58,962 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2022-04-15 02:39:58,962 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2022-04-15 02:39:58,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:58,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:58,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 72 states have internal predecessors, (76), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 124 states. [2022-04-15 02:39:58,963 INFO L87 Difference]: Start difference. First operand has 108 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 72 states have internal predecessors, (76), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 124 states. [2022-04-15 02:39:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:39:58,968 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2022-04-15 02:39:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2022-04-15 02:39:58,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:39:58,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:39:58,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:39:58,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:39:58,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 72 states have internal predecessors, (76), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 02:39:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2022-04-15 02:39:58,971 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 47 [2022-04-15 02:39:58,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:39:58,971 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2022-04-15 02:39:58,972 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 02:39:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2022-04-15 02:39:58,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 02:39:58,972 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:39:58,972 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:39:59,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 02:39:59,197 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 02:39:59,198 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:39:59,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:39:59,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1153573054, now seen corresponding path program 2 times [2022-04-15 02:39:59,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:39:59,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38792895] [2022-04-15 02:39:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:39:59,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:39:59,211 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:39:59,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [375158578] [2022-04-15 02:39:59,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 02:39:59,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:39:59,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:39:59,213 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:39:59,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 02:39:59,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 02:39:59,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-15 02:39:59,262 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 02:39:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 02:39:59,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 02:39:59,307 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 02:39:59,308 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 02:39:59,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 02:39:59,528 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:39:59,549 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:39:59,552 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 02:39:59,602 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 02:39:59,603 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-04-15 02:39:59,604 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-15 02:39:59,605 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-15 02:39:59,605 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-15 02:39:59,605 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 02:39:59,605 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 02:39:59,605 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 02:39:59,605 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 02:39:59,605 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 02:39:59,605 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 02:39:59,605 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 02:39:59,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:39:59 BasicIcfg [2022-04-15 02:39:59,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 02:39:59,607 INFO L158 Benchmark]: Toolchain (without parser) took 57024.04ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 125.9MB in the beginning and 186.6MB in the end (delta: -60.7MB). Peak memory consumption was 95.0MB. Max. memory is 8.0GB. [2022-04-15 02:39:59,607 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 179.3MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 02:39:59,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.07ms. Allocated memory is still 179.3MB. Free memory was 125.7MB in the beginning and 153.8MB in the end (delta: -28.0MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-04-15 02:39:59,608 INFO L158 Benchmark]: Boogie Preprocessor took 50.77ms. Allocated memory is still 179.3MB. Free memory was 153.8MB in the beginning and 152.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 02:39:59,608 INFO L158 Benchmark]: RCFGBuilder took 357.11ms. Allocated memory is still 179.3MB. Free memory was 152.2MB in the beginning and 140.6MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 02:39:59,608 INFO L158 Benchmark]: IcfgTransformer took 39.54ms. Allocated memory is still 179.3MB. Free memory was 140.6MB in the beginning and 138.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 02:39:59,613 INFO L158 Benchmark]: TraceAbstraction took 56329.87ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 138.5MB in the beginning and 187.1MB in the end (delta: -48.6MB). Peak memory consumption was 108.6MB. Max. memory is 8.0GB. [2022-04-15 02:39:59,615 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.19ms. Allocated memory is still 179.3MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.07ms. Allocated memory is still 179.3MB. Free memory was 125.7MB in the beginning and 153.8MB in the end (delta: -28.0MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.77ms. Allocated memory is still 179.3MB. Free memory was 153.8MB in the beginning and 152.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 357.11ms. Allocated memory is still 179.3MB. Free memory was 152.2MB in the beginning and 140.6MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 39.54ms. Allocated memory is still 179.3MB. Free memory was 140.6MB in the beginning and 138.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 56329.87ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 138.5MB in the beginning and 187.1MB in the end (delta: -48.6MB). Peak memory consumption was 108.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=5, counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=4, y=1] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=4, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=4, b=1, counter=0, p=1, q=0, r=0, s=1, x=4, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=4, b=1, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=4, y=1] [L34] COND TRUE counter++<2 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=4, b=1, counter=1, p=1, q=0, r=0, s=1, x=4, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=4, b=1, counter=1, p=1, q=0, r=0, s=1, x=4, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=4, b=1, counter=1, p=1, q=0, r=0, s=1, x=4, y=1] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=4, b=1, counter=1, p=1, q=0, r=0, s=1, x=4, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=3, b=1, counter=1, p=1, q=0, r=-1, s=1, x=4, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=1, counter=2, counter++=1, p=1, q=0, r=-1, s=1, x=4, y=1] [L34] COND TRUE counter++<2 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=3, b=1, counter=2, p=1, q=0, r=-1, s=1, x=4, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=3, b=1, counter=2, p=1, q=0, r=-1, s=1, x=4, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=1, counter=2, p=1, q=0, r=-1, s=1, x=4, y=1] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=3, b=1, counter=2, p=1, q=0, r=-1, s=1, x=4, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=2, b=1, counter=2, p=1, q=0, r=-2, s=1, x=4, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, counter=3, counter++=2, p=1, q=0, r=-2, s=1, x=4, y=1] [L34] COND FALSE !(counter++<2) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.2s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 148 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 1241 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 847 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 695 IncrementalHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 394 mSDtfsCounter, 695 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 494 GetRequests, 431 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=10, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 30 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 47.1s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 495 ConstructedInterpolants, 0 QuantifiedInterpolants, 1417 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1015 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 257/289 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-15 02:39:59,641 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...