/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/prod4br-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 04:16:45,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 04:16:45,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 04:16:45,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 04:16:45,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 04:16:45,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 04:16:45,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 04:16:45,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 04:16:45,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 04:16:45,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 04:16:45,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 04:16:45,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 04:16:45,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 04:16:45,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 04:16:45,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 04:16:45,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 04:16:45,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 04:16:45,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 04:16:45,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 04:16:46,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 04:16:46,003 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 04:16:46,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 04:16:46,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 04:16:46,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 04:16:46,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 04:16:46,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 04:16:46,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 04:16:46,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 04:16:46,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 04:16:46,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 04:16:46,014 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 04:16:46,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 04:16:46,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 04:16:46,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 04:16:46,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 04:16:46,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 04:16:46,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 04:16:46,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 04:16:46,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 04:16:46,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 04:16:46,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 04:16:46,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 04:16:46,021 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 04:16:46,044 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 04:16:46,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 04:16:46,046 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 04:16:46,046 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 04:16:46,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 04:16:46,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 04:16:46,047 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 04:16:46,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 04:16:46,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 04:16:46,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 04:16:46,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 04:16:46,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 04:16:46,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 04:16:46,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 04:16:46,049 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 04:16:46,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 04:16:46,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 04:16:46,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 04:16:46,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 04:16:46,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 04:16:46,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 04:16:46,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 04:16:46,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 04:16:46,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 04:16:46,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 04:16:46,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 04:16:46,051 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 04:16:46,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 04:16:46,052 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 04:16:46,052 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 04:16:46,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 04:16:46,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 04:16:46,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 04:16:46,298 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 04:16:46,298 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 04:16:46,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound10.c [2022-04-15 04:16:46,357 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a065ef1/014daa25a6454ef986cd9efc0cc763dd/FLAG050a3fc3e [2022-04-15 04:16:46,683 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 04:16:46,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound10.c [2022-04-15 04:16:46,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a065ef1/014daa25a6454ef986cd9efc0cc763dd/FLAG050a3fc3e [2022-04-15 04:16:47,107 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a065ef1/014daa25a6454ef986cd9efc0cc763dd [2022-04-15 04:16:47,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 04:16:47,110 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 04:16:47,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 04:16:47,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 04:16:47,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 04:16:47,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:16:47" (1/1) ... [2022-04-15 04:16:47,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7afc191f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:16:47, skipping insertion in model container [2022-04-15 04:16:47,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:16:47" (1/1) ... [2022-04-15 04:16:47,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 04:16:47,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 04:16:47,335 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/prod4br-ll_valuebound10.c[524,537] [2022-04-15 04:16:47,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 04:16:47,376 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 04:16:47,389 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/prod4br-ll_valuebound10.c[524,537] [2022-04-15 04:16:47,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 04:16:47,426 INFO L208 MainTranslator]: Completed translation [2022-04-15 04:16:47,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:16:47 WrapperNode [2022-04-15 04:16:47,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 04:16:47,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 04:16:47,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 04:16:47,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 04:16:47,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:16:47" (1/1) ... [2022-04-15 04:16:47,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:16:47" (1/1) ... [2022-04-15 04:16:47,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:16:47" (1/1) ... [2022-04-15 04:16:47,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:16:47" (1/1) ... [2022-04-15 04:16:47,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:16:47" (1/1) ... [2022-04-15 04:16:47,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:16:47" (1/1) ... [2022-04-15 04:16:47,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:16:47" (1/1) ... [2022-04-15 04:16:47,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 04:16:47,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 04:16:47,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 04:16:47,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 04:16:47,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:16:47" (1/1) ... [2022-04-15 04:16:47,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 04:16:47,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:16:47,503 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 04:16:47,525 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 04:16:47,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 04:16:47,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 04:16:47,538 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 04:16:47,538 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 04:16:47,539 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 04:16:47,539 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 04:16:47,539 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 04:16:47,540 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 04:16:47,540 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 04:16:47,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 04:16:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 04:16:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 04:16:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 04:16:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 04:16:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 04:16:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 04:16:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 04:16:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 04:16:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 04:16:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 04:16:47,598 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 04:16:47,600 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 04:16:47,771 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 04:16:47,783 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 04:16:47,783 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 04:16:47,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:16:47 BoogieIcfgContainer [2022-04-15 04:16:47,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 04:16:47,785 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 04:16:47,785 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 04:16:47,800 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 04:16:47,802 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:16:47" (1/1) ... [2022-04-15 04:16:47,803 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 04:16:47,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 04:16:47 BasicIcfg [2022-04-15 04:16:47,862 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 04:16:47,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 04:16:47,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 04:16:47,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 04:16:47,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 04:16:47" (1/4) ... [2022-04-15 04:16:47,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322103f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:16:47, skipping insertion in model container [2022-04-15 04:16:47,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:16:47" (2/4) ... [2022-04-15 04:16:47,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322103f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:16:47, skipping insertion in model container [2022-04-15 04:16:47,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:16:47" (3/4) ... [2022-04-15 04:16:47,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322103f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 04:16:47, skipping insertion in model container [2022-04-15 04:16:47,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 04:16:47" (4/4) ... [2022-04-15 04:16:47,871 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound10.cqvasr [2022-04-15 04:16:47,875 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 04:16:47,875 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 04:16:47,916 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 04:16:47,926 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 04:16:47,926 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 04:16:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 04:16:47,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 04:16:47,951 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:16:47,952 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:16:47,952 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:16:47,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:16:47,958 INFO L85 PathProgramCache]: Analyzing trace with hash 574541465, now seen corresponding path program 1 times [2022-04-15 04:16:47,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:16:47,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53516003] [2022-04-15 04:16:47,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:16:47,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:16:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:16:48,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 04:16:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:16:48,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {37#true} is VALID [2022-04-15 04:16:48,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-15 04:16:48,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-15 04:16:48,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 04:16:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:16:48,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-15 04:16:48,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 04:16:48,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 04:16:48,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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#false} is VALID [2022-04-15 04:16:48,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 04:16:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:16:48,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-15 04:16:48,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 04:16:48,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 04:16:48,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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#false} is VALID [2022-04-15 04:16:48,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 04:16:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:16:48,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-15 04:16:48,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 04:16:48,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 04:16:48,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-15 04:16:48,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 04:16:48,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {37#true} is VALID [2022-04-15 04:16:48,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-15 04:16:48,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-15 04:16:48,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-15 04:16:48,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {37#true} is VALID [2022-04-15 04:16:48,227 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {37#true} is VALID [2022-04-15 04:16:48,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-15 04:16:48,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 04:16:48,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 04:16:48,229 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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#false} is VALID [2022-04-15 04:16:48,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {38#false} is VALID [2022-04-15 04:16:48,230 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {37#true} is VALID [2022-04-15 04:16:48,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-15 04:16:48,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 04:16:48,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 04:16:48,232 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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#false} is VALID [2022-04-15 04:16:48,232 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-15 04:16:48,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-15 04:16:48,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 04:16:48,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 04:16:48,235 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-15 04:16:48,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {38#false} is VALID [2022-04-15 04:16:48,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} [101] L47-2-->L34-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 04:16:48,237 INFO L272 TraceCheckUtils]: 24: Hoare triple {38#false} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {38#false} is VALID [2022-04-15 04:16:48,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {38#false} is VALID [2022-04-15 04:16:48,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {38#false} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 04:16:48,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 04:16:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 04:16:48,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:16:48,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53516003] [2022-04-15 04:16:48,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53516003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 04:16:48,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 04:16:48,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 04:16:48,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829911818] [2022-04-15 04:16:48,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 04:16:48,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 04:16:48,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:16:48,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 04:16:48,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:16:48,274 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 04:16:48,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:16:48,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 04:16:48,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 04:16:48,300 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 04:16:48,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:16:48,462 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-04-15 04:16:48,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 04:16:48,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 04:16:48,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:16:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 04:16:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-15 04:16:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 04:16:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-15 04:16:48,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2022-04-15 04:16:48,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:16:48,603 INFO L225 Difference]: With dead ends: 61 [2022-04-15 04:16:48,603 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 04:16:48,605 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 04:16:48,610 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 04:16:48,611 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 04:16:48,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 04:16:48,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 04:16:48,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:16:48,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:16:48,637 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:16:48,638 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:16:48,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:16:48,642 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-15 04:16:48,654 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-15 04:16:48,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:16:48,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:16:48,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-15 04:16:48,656 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-15 04:16:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:16:48,659 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-15 04:16:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-15 04:16:48,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:16:48,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:16:48,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:16:48,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:16:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:16:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-15 04:16:48,665 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2022-04-15 04:16:48,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:16:48,665 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-15 04:16:48,665 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 04:16:48,666 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-15 04:16:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 04:16:48,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:16:48,667 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:16:48,667 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 04:16:48,667 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:16:48,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:16:48,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2145419015, now seen corresponding path program 1 times [2022-04-15 04:16:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:16:48,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239180393] [2022-04-15 04:16:48,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:16:48,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:16:48,691 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:16:48,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218496552] [2022-04-15 04:16:48,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:16:48,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:16:48,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:16:48,701 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 04:16:48,702 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 04:16:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:16:48,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 04:16:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:16:48,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:16:49,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 04:16:49,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {239#true} is VALID [2022-04-15 04:16:49,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 04:16:49,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 04:16:49,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 04:16:49,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {239#true} is VALID [2022-04-15 04:16:49,281 INFO L272 TraceCheckUtils]: 6: Hoare triple {239#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {239#true} is VALID [2022-04-15 04:16:49,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 04:16:49,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 04:16:49,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {269#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 04:16:49,286 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {269#(not (= |assume_abort_if_not_#in~cond| 0))} {239#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {276#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 04:16:49,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#(and (<= main_~x~0 10) (<= 0 main_~x~0))} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {276#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 04:16:49,287 INFO L272 TraceCheckUtils]: 12: Hoare triple {276#(and (<= main_~x~0 10) (<= 0 main_~x~0))} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {239#true} is VALID [2022-04-15 04:16:49,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {239#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {239#true} is VALID [2022-04-15 04:16:49,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 04:16:49,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 04:16:49,289 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {239#true} {276#(and (<= main_~x~0 10) (<= 0 main_~x~0))} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {276#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 04:16:49,290 INFO L272 TraceCheckUtils]: 17: Hoare triple {276#(and (<= main_~x~0 10) (<= 0 main_~x~0))} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {239#true} is VALID [2022-04-15 04:16:49,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {239#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 04:16:49,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 04:16:49,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {269#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 04:16:49,292 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {269#(not (= |assume_abort_if_not_#in~cond| 0))} {276#(and (<= main_~x~0 10) (<= 0 main_~x~0))} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {310#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-15 04:16:49,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {310#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {314#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 04:16:49,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {314#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 04:16:49,295 INFO L272 TraceCheckUtils]: 24: Hoare triple {314#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:16:49,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {321#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {325#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:16:49,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {325#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-15 04:16:49,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {240#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-15 04:16:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 04:16:49,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:16:49,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {240#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-15 04:16:49,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {325#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-15 04:16:49,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {321#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {325#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:16:49,621 INFO L272 TraceCheckUtils]: 24: Hoare triple {341#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:16:49,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {341#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {341#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 04:16:49,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {239#true} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {341#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 04:16:49,622 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {239#true} {239#true} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {239#true} is VALID [2022-04-15 04:16:49,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {239#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 04:16:49,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {239#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 04:16:49,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {239#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {239#true} is VALID [2022-04-15 04:16:49,623 INFO L272 TraceCheckUtils]: 17: Hoare triple {239#true} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {239#true} is VALID [2022-04-15 04:16:49,623 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {239#true} {239#true} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {239#true} is VALID [2022-04-15 04:16:49,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 04:16:49,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 04:16:49,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {239#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {239#true} is VALID [2022-04-15 04:16:49,624 INFO L272 TraceCheckUtils]: 12: Hoare triple {239#true} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {239#true} is VALID [2022-04-15 04:16:49,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {239#true} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {239#true} is VALID [2022-04-15 04:16:49,625 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {239#true} {239#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {239#true} is VALID [2022-04-15 04:16:49,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {239#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 04:16:49,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {239#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 04:16:49,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {239#true} is VALID [2022-04-15 04:16:49,626 INFO L272 TraceCheckUtils]: 6: Hoare triple {239#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {239#true} is VALID [2022-04-15 04:16:49,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {239#true} is VALID [2022-04-15 04:16:49,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 04:16:49,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 04:16:49,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 04:16:49,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {239#true} is VALID [2022-04-15 04:16:49,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 04:16:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 04:16:49,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:16:49,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239180393] [2022-04-15 04:16:49,628 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:16:49,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218496552] [2022-04-15 04:16:49,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218496552] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 04:16:49,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 04:16:49,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-15 04:16:49,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510612075] [2022-04-15 04:16:49,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 04:16:49,630 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-15 04:16:49,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:16:49,631 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 04:16:49,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:16:49,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 04:16:49,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:16:49,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 04:16:49,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 04:16:49,650 INFO L87 Difference]: Start difference. First operand 29 states and 36 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 04:16:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:16:50,001 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 04:16:50,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 04:16:50,001 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-15 04:16:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:16:50,002 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 04:16:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 04:16:50,004 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 04:16:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 04:16:50,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-15 04:16:50,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:16:50,089 INFO L225 Difference]: With dead ends: 35 [2022-04-15 04:16:50,089 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 04:16:50,089 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-15 04:16:50,091 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 04:16:50,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 83 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 04:16:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 04:16:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 04:16:50,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:16:50,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:16:50,097 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:16:50,098 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:16:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:16:50,100 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 04:16:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 04:16:50,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:16:50,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:16:50,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-15 04:16:50,102 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-15 04:16:50,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:16:50,104 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 04:16:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 04:16:50,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:16:50,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:16:50,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:16:50,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:16:50,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:16:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-15 04:16:50,107 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2022-04-15 04:16:50,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:16:50,107 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-15 04:16:50,107 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 04:16:50,107 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 04:16:50,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 04:16:50,108 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:16:50,109 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:16:50,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 04:16:50,330 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:16:50,331 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:16:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:16:50,332 INFO L85 PathProgramCache]: Analyzing trace with hash -257170002, now seen corresponding path program 1 times [2022-04-15 04:16:50,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:16:50,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129537519] [2022-04-15 04:16:50,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:16:50,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:16:50,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:16:50,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1189392820] [2022-04-15 04:16:50,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:16:50,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:16:50,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:16:50,351 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 04:16:50,372 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 04:16:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:16:50,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 04:16:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:16:50,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:17:00,636 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 04:17:01,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {580#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:01,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {580#true} is VALID [2022-04-15 04:17:01,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {580#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:01,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {580#true} {580#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:01,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {580#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:01,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {580#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {580#true} is VALID [2022-04-15 04:17:01,191 INFO L272 TraceCheckUtils]: 6: Hoare triple {580#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {580#true} is VALID [2022-04-15 04:17:01,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {580#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {580#true} is VALID [2022-04-15 04:17:01,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:01,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {580#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:01,192 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {580#true} {580#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {580#true} is VALID [2022-04-15 04:17:01,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {580#true} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {580#true} is VALID [2022-04-15 04:17:01,193 INFO L272 TraceCheckUtils]: 12: Hoare triple {580#true} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {580#true} is VALID [2022-04-15 04:17:01,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {580#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {580#true} is VALID [2022-04-15 04:17:01,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {580#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:01,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {580#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:01,194 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {580#true} {580#true} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {580#true} is VALID [2022-04-15 04:17:01,194 INFO L272 TraceCheckUtils]: 17: Hoare triple {580#true} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {580#true} is VALID [2022-04-15 04:17:01,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {580#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 04:17:01,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 04:17:01,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {643#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 04:17:01,198 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {643#(not (= |assume_abort_if_not_#in~cond| 0))} {580#true} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {650#(<= 1 main_~y~0)} is VALID [2022-04-15 04:17:01,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {650#(<= 1 main_~y~0)} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 04:17:01,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 04:17:01,199 INFO L272 TraceCheckUtils]: 24: Hoare triple {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {580#true} is VALID [2022-04-15 04:17:01,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {580#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:17:01,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 04:17:01,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 04:17:03,203 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {675#(and (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-15 04:17:03,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {675#(and (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [108] L35-1-->L34-2: Formula: (or (= 0 v_main_~b~0_14) (= 0 v_main_~a~0_14)) InVars {main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} OutVars{main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} AuxVars[] AssignedVars[] {679#(and (<= 0 main_~x~0) (<= main_~q~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} is VALID [2022-04-15 04:17:03,220 INFO L272 TraceCheckUtils]: 30: Hoare triple {679#(and (<= 0 main_~x~0) (<= main_~q~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:17:03,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:17:03,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {687#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {581#false} is VALID [2022-04-15 04:17:03,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {581#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {581#false} is VALID [2022-04-15 04:17:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 04:17:03,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:17:42,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {581#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {581#false} is VALID [2022-04-15 04:17:42,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {687#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {581#false} is VALID [2022-04-15 04:17:42,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:17:42,974 INFO L272 TraceCheckUtils]: 30: Hoare triple {703#(= main_~q~0 (* main_~y~0 main_~x~0))} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:17:42,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {707#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} [108] L35-1-->L34-2: Formula: (or (= 0 v_main_~b~0_14) (= 0 v_main_~a~0_14)) InVars {main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} OutVars{main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} AuxVars[] AssignedVars[] {703#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 04:17:42,976 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} {580#true} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {707#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 04:17:42,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 04:17:42,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {720#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 04:17:42,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {580#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {720#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 04:17:42,978 INFO L272 TraceCheckUtils]: 24: Hoare triple {580#true} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {580#true} is VALID [2022-04-15 04:17:42,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {580#true} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:42,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {580#true} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {580#true} is VALID [2022-04-15 04:17:42,978 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {580#true} {580#true} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {580#true} is VALID [2022-04-15 04:17:42,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {580#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:42,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {580#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:42,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {580#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {580#true} is VALID [2022-04-15 04:17:42,979 INFO L272 TraceCheckUtils]: 17: Hoare triple {580#true} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {580#true} is VALID [2022-04-15 04:17:42,979 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {580#true} {580#true} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {580#true} is VALID [2022-04-15 04:17:42,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {580#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:42,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {580#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:42,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {580#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {580#true} is VALID [2022-04-15 04:17:42,980 INFO L272 TraceCheckUtils]: 12: Hoare triple {580#true} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {580#true} is VALID [2022-04-15 04:17:42,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {580#true} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {580#true} is VALID [2022-04-15 04:17:42,980 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {580#true} {580#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {580#true} is VALID [2022-04-15 04:17:42,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {580#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:42,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:42,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {580#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {580#true} is VALID [2022-04-15 04:17:42,981 INFO L272 TraceCheckUtils]: 6: Hoare triple {580#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {580#true} is VALID [2022-04-15 04:17:42,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {580#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {580#true} is VALID [2022-04-15 04:17:42,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {580#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:42,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {580#true} {580#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:42,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {580#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:42,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {580#true} is VALID [2022-04-15 04:17:42,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {580#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {580#true} is VALID [2022-04-15 04:17:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 04:17:42,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:17:42,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129537519] [2022-04-15 04:17:42,983 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:17:42,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189392820] [2022-04-15 04:17:42,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189392820] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 04:17:42,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 04:17:42,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-15 04:17:42,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87509420] [2022-04-15 04:17:42,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 04:17:42,985 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 34 [2022-04-15 04:17:42,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:17:42,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 04:17:45,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 04:17:45,041 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 04:17:45,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:17:45,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 04:17:45,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-15 04:17:45,042 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 04:17:47,655 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 04:17:54,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 04:17:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:17:54,621 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-15 04:17:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 04:17:54,621 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 34 [2022-04-15 04:17:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:17:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 04:17:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2022-04-15 04:17:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 04:17:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2022-04-15 04:17:54,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 55 transitions. [2022-04-15 04:17:54,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:17:54,686 INFO L225 Difference]: With dead ends: 47 [2022-04-15 04:17:54,686 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 04:17:54,687 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-04-15 04:17:54,687 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 19 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-15 04:17:54,688 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 153 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 266 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-04-15 04:17:54,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 04:17:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-04-15 04:17:54,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:17:54,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 04:17:54,713 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 04:17:54,714 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 04:17:54,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:17:54,722 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 04:17:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-15 04:17:54,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:17:54,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:17:54,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-15 04:17:54,723 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-15 04:17:54,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:17:54,725 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 04:17:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-15 04:17:54,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:17:54,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:17:54,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:17:54,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:17:54,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 04:17:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-15 04:17:54,734 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 34 [2022-04-15 04:17:54,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:17:54,734 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-15 04:17:54,735 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 04:17:54,735 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-15 04:17:54,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 04:17:54,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:17:54,739 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2022-04-15 04:17:54,766 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 04:17:54,962 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 04:17:54,962 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:17:54,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:17:54,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1300735059, now seen corresponding path program 1 times [2022-04-15 04:17:54,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:17:54,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508402356] [2022-04-15 04:17:54,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:17:54,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:17:54,985 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:17:54,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1623512200] [2022-04-15 04:17:54,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:17:54,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:17:54,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:17:54,987 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 04:17:54,988 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 04:17:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:17:55,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 04:17:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:17:55,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:17:55,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {1016#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:55,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {1016#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1016#true} is VALID [2022-04-15 04:17:55,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {1016#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:55,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1016#true} {1016#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:55,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {1016#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:55,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {1016#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1016#true} is VALID [2022-04-15 04:17:55,464 INFO L272 TraceCheckUtils]: 6: Hoare triple {1016#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {1016#true} is VALID [2022-04-15 04:17:55,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {1016#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1042#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 04:17:55,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1046#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 04:17:55,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {1046#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1046#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 04:17:55,467 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1046#(not (= |assume_abort_if_not_#in~cond| 0))} {1016#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {1053#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 04:17:55,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {1053#(and (<= main_~x~0 10) (<= 0 main_~x~0))} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1053#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 04:17:55,468 INFO L272 TraceCheckUtils]: 12: Hoare triple {1053#(and (<= main_~x~0 10) (<= 0 main_~x~0))} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {1016#true} is VALID [2022-04-15 04:17:55,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {1016#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1016#true} is VALID [2022-04-15 04:17:55,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {1016#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:55,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {1016#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:55,469 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1016#true} {1053#(and (<= main_~x~0 10) (<= 0 main_~x~0))} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {1053#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 04:17:55,472 INFO L272 TraceCheckUtils]: 17: Hoare triple {1053#(and (<= main_~x~0 10) (<= 0 main_~x~0))} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1016#true} is VALID [2022-04-15 04:17:55,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {1016#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1016#true} is VALID [2022-04-15 04:17:55,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {1016#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:55,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {1016#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:55,474 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1016#true} {1053#(and (<= main_~x~0 10) (<= 0 main_~x~0))} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1053#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 04:17:55,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {1053#(and (<= main_~x~0 10) (<= 0 main_~x~0))} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {1090#(<= 0 main_~a~0)} is VALID [2022-04-15 04:17:55,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {1090#(<= 0 main_~a~0)} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#(<= 0 main_~a~0)} is VALID [2022-04-15 04:17:55,478 INFO L272 TraceCheckUtils]: 24: Hoare triple {1090#(<= 0 main_~a~0)} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1016#true} is VALID [2022-04-15 04:17:55,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {1016#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1016#true} is VALID [2022-04-15 04:17:55,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {1016#true} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:55,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {1016#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:55,479 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1016#true} {1090#(<= 0 main_~a~0)} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1090#(<= 0 main_~a~0)} is VALID [2022-04-15 04:17:55,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {1090#(<= 0 main_~a~0)} [109] L35-1-->L40: Formula: (and (not (= 0 v_main_~b~0_15)) (not (= 0 v_main_~a~0_15))) InVars {main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} OutVars{main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[] {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-15 04:17:55,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [113] L40-->L47-2: Formula: (let ((.cse5 (mod v_main_~a~0_2 2)) (.cse1 (mod v_main_~b~0_2 2))) (let ((.cse0 (and (not (= .cse1 0)) (< v_main_~b~0_2 0))) (.cse3 (and (not (= .cse5 0)) (< v_main_~a~0_2 0)))) (and (= v_main_~p~0_1 (* v_main_~p~0_2 4)) (= (ite .cse0 (+ (- 2) .cse1) .cse1) 0) (= v_main_~b~0_1 (let ((.cse2 (div v_main_~b~0_2 2))) (ite .cse0 (+ .cse2 1) .cse2))) (= v_main_~a~0_1 (let ((.cse4 (div v_main_~a~0_2 2))) (ite .cse3 (+ .cse4 1) .cse4))) (= 0 (ite .cse3 (+ .cse5 (- 2)) .cse5))))) InVars {main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~a~0=v_main_~a~0_2} OutVars{main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~b~0, main_~p~0, main_~a~0] {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-15 04:17:55,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-15 04:17:55,485 INFO L272 TraceCheckUtils]: 32: Hoare triple {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1016#true} is VALID [2022-04-15 04:17:55,485 INFO L290 TraceCheckUtils]: 33: Hoare triple {1016#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1016#true} is VALID [2022-04-15 04:17:55,485 INFO L290 TraceCheckUtils]: 34: Hoare triple {1016#true} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:55,485 INFO L290 TraceCheckUtils]: 35: Hoare triple {1016#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:55,486 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1016#true} {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-15 04:17:55,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [108] L35-1-->L34-2: Formula: (or (= 0 v_main_~b~0_14) (= 0 v_main_~a~0_14)) InVars {main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} OutVars{main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} AuxVars[] AssignedVars[] {1017#false} is VALID [2022-04-15 04:17:55,487 INFO L272 TraceCheckUtils]: 38: Hoare triple {1017#false} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1017#false} is VALID [2022-04-15 04:17:55,487 INFO L290 TraceCheckUtils]: 39: Hoare triple {1017#false} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1017#false} is VALID [2022-04-15 04:17:55,487 INFO L290 TraceCheckUtils]: 40: Hoare triple {1017#false} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1017#false} is VALID [2022-04-15 04:17:55,487 INFO L290 TraceCheckUtils]: 41: Hoare triple {1017#false} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1017#false} is VALID [2022-04-15 04:17:55,487 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1017#false} {1017#false} [129] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1017#false} is VALID [2022-04-15 04:17:55,487 INFO L272 TraceCheckUtils]: 43: Hoare triple {1017#false} [106] L57-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~a~0_17 v_main_~b~0_17) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~b~0=v_main_~b~0_17, main_~a~0=v_main_~a~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {1017#false} is VALID [2022-04-15 04:17:55,488 INFO L290 TraceCheckUtils]: 44: Hoare triple {1017#false} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1017#false} is VALID [2022-04-15 04:17:55,488 INFO L290 TraceCheckUtils]: 45: Hoare triple {1017#false} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1017#false} is VALID [2022-04-15 04:17:55,488 INFO L290 TraceCheckUtils]: 46: Hoare triple {1017#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1017#false} is VALID [2022-04-15 04:17:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 04:17:55,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:17:56,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {1017#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1017#false} is VALID [2022-04-15 04:17:56,671 INFO L290 TraceCheckUtils]: 45: Hoare triple {1017#false} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1017#false} is VALID [2022-04-15 04:17:56,671 INFO L290 TraceCheckUtils]: 44: Hoare triple {1017#false} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1017#false} is VALID [2022-04-15 04:17:56,671 INFO L272 TraceCheckUtils]: 43: Hoare triple {1017#false} [106] L57-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~a~0_17 v_main_~b~0_17) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~b~0=v_main_~b~0_17, main_~a~0=v_main_~a~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {1017#false} is VALID [2022-04-15 04:17:56,671 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1016#true} {1017#false} [129] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1017#false} is VALID [2022-04-15 04:17:56,671 INFO L290 TraceCheckUtils]: 41: Hoare triple {1016#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:56,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {1016#true} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:56,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {1016#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1016#true} is VALID [2022-04-15 04:17:56,672 INFO L272 TraceCheckUtils]: 38: Hoare triple {1017#false} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1016#true} is VALID [2022-04-15 04:17:56,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {1191#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [108] L35-1-->L34-2: Formula: (or (= 0 v_main_~b~0_14) (= 0 v_main_~a~0_14)) InVars {main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} OutVars{main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} AuxVars[] AssignedVars[] {1017#false} is VALID [2022-04-15 04:17:56,675 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1016#true} {1191#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1191#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-15 04:17:56,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {1016#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:56,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {1016#true} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:56,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {1016#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1016#true} is VALID [2022-04-15 04:17:56,675 INFO L272 TraceCheckUtils]: 32: Hoare triple {1191#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1016#true} is VALID [2022-04-15 04:17:56,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {1191#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1191#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-15 04:17:56,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {1213#(or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0)) (and (not (<= (div main_~a~0 2) 0)) (not (= (div main_~b~0 2) 0))))} [113] L40-->L47-2: Formula: (let ((.cse5 (mod v_main_~a~0_2 2)) (.cse1 (mod v_main_~b~0_2 2))) (let ((.cse0 (and (not (= .cse1 0)) (< v_main_~b~0_2 0))) (.cse3 (and (not (= .cse5 0)) (< v_main_~a~0_2 0)))) (and (= v_main_~p~0_1 (* v_main_~p~0_2 4)) (= (ite .cse0 (+ (- 2) .cse1) .cse1) 0) (= v_main_~b~0_1 (let ((.cse2 (div v_main_~b~0_2 2))) (ite .cse0 (+ .cse2 1) .cse2))) (= v_main_~a~0_1 (let ((.cse4 (div v_main_~a~0_2 2))) (ite .cse3 (+ .cse4 1) .cse4))) (= 0 (ite .cse3 (+ .cse5 (- 2)) .cse5))))) InVars {main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~a~0=v_main_~a~0_2} OutVars{main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~b~0, main_~p~0, main_~a~0] {1191#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-15 04:17:56,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {1217#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} [109] L35-1-->L40: Formula: (and (not (= 0 v_main_~b~0_15)) (not (= 0 v_main_~a~0_15))) InVars {main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} OutVars{main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[] {1213#(or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0)) (and (not (<= (div main_~a~0 2) 0)) (not (= (div main_~b~0 2) 0))))} is VALID [2022-04-15 04:17:56,679 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1016#true} {1217#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1217#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-15 04:17:56,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {1016#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:56,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {1016#true} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:56,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {1016#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1016#true} is VALID [2022-04-15 04:17:56,680 INFO L272 TraceCheckUtils]: 24: Hoare triple {1217#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1016#true} is VALID [2022-04-15 04:17:56,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {1217#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1217#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-15 04:17:56,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {1217#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-15 04:17:56,681 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1016#true} {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-15 04:17:56,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {1016#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:56,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {1016#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:56,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {1016#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1016#true} is VALID [2022-04-15 04:17:56,682 INFO L272 TraceCheckUtils]: 17: Hoare triple {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1016#true} is VALID [2022-04-15 04:17:56,682 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1016#true} {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-15 04:17:56,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {1016#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:56,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {1016#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:56,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {1016#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1016#true} is VALID [2022-04-15 04:17:56,683 INFO L272 TraceCheckUtils]: 12: Hoare triple {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {1016#true} is VALID [2022-04-15 04:17:56,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-15 04:17:56,686 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1046#(not (= |assume_abort_if_not_#in~cond| 0))} {1016#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-15 04:17:56,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {1046#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1046#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 04:17:56,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {1285#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1046#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 04:17:56,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {1016#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1285#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 04:17:56,690 INFO L272 TraceCheckUtils]: 6: Hoare triple {1016#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {1016#true} is VALID [2022-04-15 04:17:56,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {1016#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1016#true} is VALID [2022-04-15 04:17:56,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {1016#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:56,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1016#true} {1016#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:56,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {1016#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:56,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {1016#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1016#true} is VALID [2022-04-15 04:17:56,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {1016#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#true} is VALID [2022-04-15 04:17:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 04:17:56,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:17:56,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508402356] [2022-04-15 04:17:56,695 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:17:56,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623512200] [2022-04-15 04:17:56,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623512200] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 04:17:56,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 04:17:56,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2022-04-15 04:17:56,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597337415] [2022-04-15 04:17:56,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 04:17:56,696 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 47 [2022-04-15 04:17:56,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:17:56,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-15 04:17:56,753 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 04:17:56,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 04:17:56,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:17:56,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 04:17:56,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-15 04:17:56,755 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-15 04:17:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:17:57,119 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-15 04:17:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 04:17:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 47 [2022-04-15 04:17:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:17:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-15 04:17:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-15 04:17:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-15 04:17:57,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-15 04:17:57,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-15 04:17:57,165 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 04:17:57,167 INFO L225 Difference]: With dead ends: 51 [2022-04-15 04:17:57,167 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 04:17:57,167 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-15 04:17:57,168 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 04:17:57,169 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 122 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 04:17:57,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 04:17:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-04-15 04:17:57,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:17:57,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 04:17:57,193 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 04:17:57,194 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 04:17:57,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:17:57,196 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 04:17:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-15 04:17:57,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:17:57,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:17:57,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-15 04:17:57,197 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-15 04:17:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:17:57,199 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 04:17:57,199 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-15 04:17:57,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:17:57,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:17:57,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:17:57,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:17:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 04:17:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-15 04:17:57,202 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 47 [2022-04-15 04:17:57,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:17:57,202 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-15 04:17:57,202 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-15 04:17:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-15 04:17:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 04:17:57,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:17:57,203 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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 04:17:57,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 04:17:57,420 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:17:57,421 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:17:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:17:57,422 INFO L85 PathProgramCache]: Analyzing trace with hash 125449199, now seen corresponding path program 1 times [2022-04-15 04:17:57,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:17:57,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143905147] [2022-04-15 04:17:57,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:17:57,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:17:57,446 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:17:57,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [805416307] [2022-04-15 04:17:57,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:17:57,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:17:57,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:17:57,455 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 04:17:57,455 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 04:17:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:17:57,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 04:17:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:17:57,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:17:57,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {1526#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:57,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {1526#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1526#true} is VALID [2022-04-15 04:17:57,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {1526#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:57,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1526#true} {1526#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:57,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {1526#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:57,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {1526#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1526#true} is VALID [2022-04-15 04:17:57,808 INFO L272 TraceCheckUtils]: 6: Hoare triple {1526#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {1526#true} is VALID [2022-04-15 04:17:57,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {1526#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1526#true} is VALID [2022-04-15 04:17:57,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {1526#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:57,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {1526#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:57,809 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1526#true} {1526#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {1526#true} is VALID [2022-04-15 04:17:57,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {1526#true} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1526#true} is VALID [2022-04-15 04:17:57,809 INFO L272 TraceCheckUtils]: 12: Hoare triple {1526#true} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {1526#true} is VALID [2022-04-15 04:17:57,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {1526#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1570#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 04:17:57,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {1570#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1574#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 04:17:57,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {1574#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 04:17:57,810 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1574#(not (= |assume_abort_if_not_#in~cond| 0))} {1526#true} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {1581#(and (<= 0 main_~y~0) (<= main_~y~0 10))} is VALID [2022-04-15 04:17:57,811 INFO L272 TraceCheckUtils]: 17: Hoare triple {1581#(and (<= 0 main_~y~0) (<= main_~y~0 10))} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1526#true} is VALID [2022-04-15 04:17:57,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {1526#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1526#true} is VALID [2022-04-15 04:17:57,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {1526#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:57,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {1526#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:57,811 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1526#true} {1581#(and (<= 0 main_~y~0) (<= main_~y~0 10))} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1581#(and (<= 0 main_~y~0) (<= main_~y~0 10))} is VALID [2022-04-15 04:17:57,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {1581#(and (<= 0 main_~y~0) (<= main_~y~0 10))} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {1600#(<= 0 main_~b~0)} is VALID [2022-04-15 04:17:57,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {1600#(<= 0 main_~b~0)} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1600#(<= 0 main_~b~0)} is VALID [2022-04-15 04:17:57,812 INFO L272 TraceCheckUtils]: 24: Hoare triple {1600#(<= 0 main_~b~0)} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1526#true} is VALID [2022-04-15 04:17:57,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1526#true} is VALID [2022-04-15 04:17:57,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#true} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:57,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:57,813 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1526#true} {1600#(<= 0 main_~b~0)} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1600#(<= 0 main_~b~0)} is VALID [2022-04-15 04:17:57,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {1600#(<= 0 main_~b~0)} [109] L35-1-->L40: Formula: (and (not (= 0 v_main_~b~0_15)) (not (= 0 v_main_~a~0_15))) InVars {main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} OutVars{main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[] {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 04:17:57,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} [114] L40-->L44: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_3 2))) (ite (and (< v_main_~a~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0)) (not (= 0 (let ((.cse1 (mod v_main_~b~0_3 2))) (ite (and (not (= .cse1 0)) (< v_main_~b~0_3 0)) (+ .cse1 (- 2)) .cse1))))) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 04:17:57,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} [119] L44-->L47-2: Formula: (and (= v_main_~a~0_4 (+ (- 1) v_main_~a~0_5)) (= (let ((.cse0 (mod v_main_~b~0_4 2))) (ite (and (< v_main_~b~0_4 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 0) (= v_main_~q~0_1 (+ (* v_main_~b~0_4 v_main_~p~0_3) v_main_~q~0_2)) (= (let ((.cse1 (mod v_main_~a~0_5 2))) (ite (and (not (= .cse1 0)) (< v_main_~a~0_5 0)) (+ .cse1 (- 2)) .cse1)) 1)) InVars {main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~a~0=v_main_~a~0_5} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~a~0] {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 04:17:57,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 04:17:57,815 INFO L272 TraceCheckUtils]: 33: Hoare triple {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1526#true} is VALID [2022-04-15 04:17:57,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {1526#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1526#true} is VALID [2022-04-15 04:17:57,815 INFO L290 TraceCheckUtils]: 35: Hoare triple {1526#true} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:57,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {1526#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:57,816 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1526#true} {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 04:17:57,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} [108] L35-1-->L34-2: Formula: (or (= 0 v_main_~b~0_14) (= 0 v_main_~a~0_14)) InVars {main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} OutVars{main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} AuxVars[] AssignedVars[] {1650#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 04:17:57,816 INFO L272 TraceCheckUtils]: 39: Hoare triple {1650#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1526#true} is VALID [2022-04-15 04:17:57,816 INFO L290 TraceCheckUtils]: 40: Hoare triple {1526#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1526#true} is VALID [2022-04-15 04:17:57,817 INFO L290 TraceCheckUtils]: 41: Hoare triple {1526#true} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:57,817 INFO L290 TraceCheckUtils]: 42: Hoare triple {1526#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:57,817 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1526#true} {1650#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} [129] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1650#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 04:17:57,818 INFO L272 TraceCheckUtils]: 44: Hoare triple {1650#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} [106] L57-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~a~0_17 v_main_~b~0_17) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~b~0=v_main_~b~0_17, main_~a~0=v_main_~a~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {1669#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:17:57,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {1669#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1673#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:17:57,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {1673#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1527#false} is VALID [2022-04-15 04:17:57,820 INFO L290 TraceCheckUtils]: 47: Hoare triple {1527#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1527#false} is VALID [2022-04-15 04:17:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 04:17:57,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:17:58,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {1527#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1527#false} is VALID [2022-04-15 04:17:58,106 INFO L290 TraceCheckUtils]: 46: Hoare triple {1673#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1527#false} is VALID [2022-04-15 04:17:58,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {1669#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1673#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:17:58,111 INFO L272 TraceCheckUtils]: 44: Hoare triple {1689#(= (* main_~b~0 main_~a~0) 0)} [106] L57-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~a~0_17 v_main_~b~0_17) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~b~0=v_main_~b~0_17, main_~a~0=v_main_~a~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {1669#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:17:58,113 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1526#true} {1689#(= (* main_~b~0 main_~a~0) 0)} [129] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1689#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-15 04:17:58,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {1526#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {1526#true} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,113 INFO L290 TraceCheckUtils]: 40: Hoare triple {1526#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1526#true} is VALID [2022-04-15 04:17:58,113 INFO L272 TraceCheckUtils]: 39: Hoare triple {1689#(= (* main_~b~0 main_~a~0) 0)} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1526#true} is VALID [2022-04-15 04:17:58,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {1526#true} [108] L35-1-->L34-2: Formula: (or (= 0 v_main_~b~0_14) (= 0 v_main_~a~0_14)) InVars {main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} OutVars{main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} AuxVars[] AssignedVars[] {1689#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-15 04:17:58,115 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1526#true} {1526#true} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1526#true} is VALID [2022-04-15 04:17:58,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {1526#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,115 INFO L290 TraceCheckUtils]: 35: Hoare triple {1526#true} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,115 INFO L290 TraceCheckUtils]: 34: Hoare triple {1526#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1526#true} is VALID [2022-04-15 04:17:58,115 INFO L272 TraceCheckUtils]: 33: Hoare triple {1526#true} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1526#true} is VALID [2022-04-15 04:17:58,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {1526#true} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {1526#true} [119] L44-->L47-2: Formula: (and (= v_main_~a~0_4 (+ (- 1) v_main_~a~0_5)) (= (let ((.cse0 (mod v_main_~b~0_4 2))) (ite (and (< v_main_~b~0_4 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 0) (= v_main_~q~0_1 (+ (* v_main_~b~0_4 v_main_~p~0_3) v_main_~q~0_2)) (= (let ((.cse1 (mod v_main_~a~0_5 2))) (ite (and (not (= .cse1 0)) (< v_main_~a~0_5 0)) (+ .cse1 (- 2)) .cse1)) 1)) InVars {main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~a~0=v_main_~a~0_5} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~a~0] {1526#true} is VALID [2022-04-15 04:17:58,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {1526#true} [114] L40-->L44: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_3 2))) (ite (and (< v_main_~a~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0)) (not (= 0 (let ((.cse1 (mod v_main_~b~0_3 2))) (ite (and (not (= .cse1 0)) (< v_main_~b~0_3 0)) (+ .cse1 (- 2)) .cse1))))) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {1526#true} [109] L35-1-->L40: Formula: (and (not (= 0 v_main_~b~0_15)) (not (= 0 v_main_~a~0_15))) InVars {main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} OutVars{main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,116 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1526#true} {1526#true} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1526#true} is VALID [2022-04-15 04:17:58,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#true} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1526#true} is VALID [2022-04-15 04:17:58,117 INFO L272 TraceCheckUtils]: 24: Hoare triple {1526#true} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1526#true} is VALID [2022-04-15 04:17:58,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {1526#true} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {1526#true} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {1526#true} is VALID [2022-04-15 04:17:58,117 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1526#true} {1526#true} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1526#true} is VALID [2022-04-15 04:17:58,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {1526#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {1526#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {1526#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1526#true} is VALID [2022-04-15 04:17:58,118 INFO L272 TraceCheckUtils]: 17: Hoare triple {1526#true} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1526#true} is VALID [2022-04-15 04:17:58,118 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1526#true} {1526#true} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {1526#true} is VALID [2022-04-15 04:17:58,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {1526#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {1526#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {1526#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1526#true} is VALID [2022-04-15 04:17:58,118 INFO L272 TraceCheckUtils]: 12: Hoare triple {1526#true} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 10) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} 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] {1526#true} is VALID [2022-04-15 04:17:58,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {1526#true} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1526#true} is VALID [2022-04-15 04:17:58,119 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1526#true} {1526#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {1526#true} is VALID [2022-04-15 04:17:58,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {1526#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {1526#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {1526#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1526#true} is VALID [2022-04-15 04:17:58,119 INFO L272 TraceCheckUtils]: 6: Hoare triple {1526#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 10)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} 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] {1526#true} is VALID [2022-04-15 04:17:58,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {1526#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1526#true} is VALID [2022-04-15 04:17:58,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {1526#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1526#true} {1526#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {1526#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {1526#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1526#true} is VALID [2022-04-15 04:17:58,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {1526#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1526#true} is VALID [2022-04-15 04:17:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 04:17:58,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:17:58,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143905147] [2022-04-15 04:17:58,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:17:58,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805416307] [2022-04-15 04:17:58,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805416307] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 04:17:58,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 04:17:58,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-15 04:17:58,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122840619] [2022-04-15 04:17:58,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 04:17:58,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 48 [2022-04-15 04:17:58,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:17:58,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 04:17:58,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:17:58,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 04:17:58,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:17:58,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 04:17:58,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-15 04:17:58,150 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 04:17:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:17:58,495 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-04-15 04:17:58,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 04:17:58,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 48 [2022-04-15 04:17:58,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:17:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 04:17:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-15 04:17:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 04:17:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-15 04:17:58,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-15 04:17:58,540 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 04:17:58,541 INFO L225 Difference]: With dead ends: 38 [2022-04-15 04:17:58,541 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 04:17:58,541 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-15 04:17:58,543 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 04:17:58,546 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 116 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 04:17:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 04:17:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 04:17:58,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:17:58,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 04:17:58,548 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 04:17:58,548 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 04:17:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:17:58,548 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 04:17:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 04:17:58,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:17:58,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:17:58,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 04:17:58,549 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 04:17:58,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:17:58,549 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 04:17:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 04:17:58,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:17:58,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:17:58,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:17:58,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:17:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 04:17:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 04:17:58,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2022-04-15 04:17:58,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:17:58,550 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 04:17:58,550 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 04:17:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 04:17:58,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:17:58,556 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 04:17:58,587 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 04:17:58,780 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:17:58,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 04:18:12,194 WARN L232 SmtUtils]: Spent 13.40s on a formula simplification. DAG size of input: 41 DAG size of output: 18 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 04:18:24,251 WARN L232 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 41 DAG size of output: 18 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 04:18:24,346 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 04:18:24,346 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 04:18:24,346 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 04:18:24,346 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 04:18:24,346 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 04:18:24,346 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 04:18:24,346 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 04:18:24,346 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-15 04:18:24,346 INFO L882 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-15 04:18:24,346 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-15 04:18:24,347 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-15 04:18:24,347 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 60) the Hoare annotation is: true [2022-04-15 04:18:24,347 INFO L885 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-15 04:18:24,347 INFO L882 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-04-15 04:18:24,347 INFO L878 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (and (<= main_~x~0 10) (<= 0 main_~x~0)) [2022-04-15 04:18:24,347 INFO L878 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (<= main_~x~0 10) (<= 0 main_~x~0)) [2022-04-15 04:18:24,347 INFO L882 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-04-15 04:18:24,347 INFO L878 garLoopResultBuilder]: At program point L47-2(lines 34 55) the Hoare annotation is: (and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 0 main_~a~0) (<= 1 main_~y~0)) [2022-04-15 04:18:24,347 INFO L878 garLoopResultBuilder]: At program point L34-2(lines 34 55) the Hoare annotation is: (and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 0 main_~a~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-15 04:18:24,347 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 0 main_~a~0) (<= 1 main_~y~0)) [2022-04-15 04:18:24,347 INFO L878 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 0 main_~a~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-15 04:18:24,348 INFO L882 garLoopResultBuilder]: For program point L35-1(lines 34 55) no Hoare annotation was computed. [2022-04-15 04:18:24,348 INFO L882 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2022-04-15 04:18:24,348 INFO L882 garLoopResultBuilder]: For program point L40(lines 40 54) no Hoare annotation was computed. [2022-04-15 04:18:24,348 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 60) no Hoare annotation was computed. [2022-04-15 04:18:24,348 INFO L882 garLoopResultBuilder]: For program point L44(lines 44 54) no Hoare annotation was computed. [2022-04-15 04:18:24,348 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 60) no Hoare annotation was computed. [2022-04-15 04:18:24,348 INFO L882 garLoopResultBuilder]: For program point L47(lines 47 54) no Hoare annotation was computed. [2022-04-15 04:18:24,348 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-15 04:18:24,348 INFO L882 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-15 04:18:24,348 INFO L882 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-15 04:18:24,348 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-15 04:18:24,348 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-15 04:18:24,349 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-15 04:18:24,351 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-15 04:18:24,352 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 04:18:24,355 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 04:18:24,355 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 04:18:24,356 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 04:18:24,357 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-15 04:18:24,357 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 04:18:24,357 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 04:18:24,357 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 04:18:24,357 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-15 04:18:24,360 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 04:18:24,360 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 04:18:24,360 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 04:18:24,360 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-15 04:18:24,361 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-15 04:18:24,361 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 04:18:24,361 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 04:18:24,361 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 04:18:24,361 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 04:18:24,361 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 04:18:24,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 04:18:24 BasicIcfg [2022-04-15 04:18:24,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 04:18:24,370 INFO L158 Benchmark]: Toolchain (without parser) took 97260.16ms. Allocated memory was 232.8MB in the beginning and 293.6MB in the end (delta: 60.8MB). Free memory was 179.6MB in the beginning and 203.5MB in the end (delta: -23.9MB). Peak memory consumption was 38.0MB. Max. memory is 8.0GB. [2022-04-15 04:18:24,370 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 232.8MB. Free memory was 195.5MB in the beginning and 195.3MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 04:18:24,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.58ms. Allocated memory is still 232.8MB. Free memory was 179.3MB in the beginning and 207.2MB in the end (delta: -27.9MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-04-15 04:18:24,371 INFO L158 Benchmark]: Boogie Preprocessor took 43.00ms. Allocated memory is still 232.8MB. Free memory was 207.2MB in the beginning and 205.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 04:18:24,371 INFO L158 Benchmark]: RCFGBuilder took 312.79ms. Allocated memory is still 232.8MB. Free memory was 205.7MB in the beginning and 192.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 04:18:24,371 INFO L158 Benchmark]: IcfgTransformer took 76.43ms. Allocated memory is still 232.8MB. Free memory was 192.7MB in the beginning and 190.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 04:18:24,372 INFO L158 Benchmark]: TraceAbstraction took 96506.11ms. Allocated memory was 232.8MB in the beginning and 293.6MB in the end (delta: 60.8MB). Free memory was 190.3MB in the beginning and 203.5MB in the end (delta: -13.1MB). Peak memory consumption was 49.2MB. Max. memory is 8.0GB. [2022-04-15 04:18:24,373 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 232.8MB. Free memory was 195.5MB in the beginning and 195.3MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 316.58ms. Allocated memory is still 232.8MB. Free memory was 179.3MB in the beginning and 207.2MB in the end (delta: -27.9MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.00ms. Allocated memory is still 232.8MB. Free memory was 207.2MB in the beginning and 205.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 312.79ms. Allocated memory is still 232.8MB. Free memory was 205.7MB in the beginning and 192.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 76.43ms. Allocated memory is still 232.8MB. Free memory was 192.7MB in the beginning and 190.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 96506.11ms. Allocated memory was 232.8MB in the beginning and 293.6MB in the end (delta: 60.8MB). Free memory was 190.3MB in the beginning and 203.5MB in the end (delta: -13.1MB). Peak memory consumption was 49.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 96.4s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 25.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 512 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 372 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 438 IncrementalHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 140 mSDtfsCounter, 438 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 279 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=3, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 27 PreInvPairs, 37 NumberOfFragments, 119 HoareAnnotationTreeSize, 27 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 314 FormulaSimplificationTreeSizeReductionInter, 25.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 55.9s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 957 SizeOfPredicates, 18 NumberOfNonLiveVariables, 459 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 173/196 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((x <= 10 && 0 <= x) && q + b * a * p == y * x) && 0 <= a) && 1 <= y RESULT: Ultimate proved your program to be correct! [2022-04-15 04:18:24,395 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...