/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/cohendiv-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 23:33:24,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 23:33:24,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 23:33:24,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 23:33:24,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 23:33:24,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 23:33:24,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 23:33:24,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 23:33:24,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 23:33:24,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 23:33:24,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 23:33:24,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 23:33:24,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 23:33:24,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 23:33:24,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 23:33:24,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 23:33:24,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 23:33:24,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 23:33:24,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 23:33:24,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 23:33:24,459 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 23:33:24,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 23:33:24,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 23:33:24,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 23:33:24,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 23:33:24,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 23:33:24,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 23:33:24,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 23:33:24,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 23:33:24,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 23:33:24,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 23:33:24,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 23:33:24,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 23:33:24,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 23:33:24,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 23:33:24,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 23:33:24,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 23:33:24,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 23:33:24,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 23:33:24,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 23:33:24,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 23:33:24,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 23:33:24,469 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 23:33:24,484 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 23:33:24,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 23:33:24,485 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 23:33:24,485 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 23:33:24,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 23:33:24,485 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 23:33:24,485 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 23:33:24,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 23:33:24,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 23:33:24,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 23:33:24,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 23:33:24,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 23:33:24,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 23:33:24,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 23:33:24,486 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 23:33:24,486 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 23:33:24,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 23:33:24,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 23:33:24,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 23:33:24,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:33:24,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 23:33:24,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 23:33:24,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 23:33:24,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 23:33:24,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 23:33:24,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 23:33:24,488 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 23:33:24,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 23:33:24,489 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 23:33:24,489 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-07 23:33:24,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 23:33:24,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 23:33:24,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 23:33:24,703 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 23:33:24,703 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 23:33:24,704 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2022-04-07 23:33:24,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324a28180/f4dca2f7e5ac4a608fa57d78afaf16bf/FLAG84bac2b78 [2022-04-07 23:33:25,104 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 23:33:25,104 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2022-04-07 23:33:25,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324a28180/f4dca2f7e5ac4a608fa57d78afaf16bf/FLAG84bac2b78 [2022-04-07 23:33:25,121 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324a28180/f4dca2f7e5ac4a608fa57d78afaf16bf [2022-04-07 23:33:25,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 23:33:25,123 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 23:33:25,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 23:33:25,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 23:33:25,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 23:33:25,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:33:25" (1/1) ... [2022-04-07 23:33:25,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ba95f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:33:25, skipping insertion in model container [2022-04-07 23:33:25,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:33:25" (1/1) ... [2022-04-07 23:33:25,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 23:33:25,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 23:33:25,265 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/cohendiv-ll.c[576,589] [2022-04-07 23:33:25,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:33:25,290 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 23:33:25,297 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/cohendiv-ll.c[576,589] [2022-04-07 23:33:25,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:33:25,310 INFO L208 MainTranslator]: Completed translation [2022-04-07 23:33:25,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:33:25 WrapperNode [2022-04-07 23:33:25,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 23:33:25,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 23:33:25,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 23:33:25,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 23:33:25,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:33:25" (1/1) ... [2022-04-07 23:33:25,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:33:25" (1/1) ... [2022-04-07 23:33:25,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:33:25" (1/1) ... [2022-04-07 23:33:25,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:33:25" (1/1) ... [2022-04-07 23:33:25,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:33:25" (1/1) ... [2022-04-07 23:33:25,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:33:25" (1/1) ... [2022-04-07 23:33:25,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:33:25" (1/1) ... [2022-04-07 23:33:25,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 23:33:25,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 23:33:25,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 23:33:25,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 23:33:25,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:33:25" (1/1) ... [2022-04-07 23:33:25,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:33:25,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:33:25,372 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-07 23:33:25,389 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-07 23:33:25,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 23:33:25,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 23:33:25,398 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 23:33:25,398 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 23:33:25,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 23:33:25,399 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 23:33:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 23:33:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 23:33:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 23:33:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 23:33:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 23:33:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 23:33:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 23:33:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 23:33:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 23:33:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 23:33:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 23:33:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 23:33:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 23:33:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 23:33:25,448 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 23:33:25,449 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 23:33:25,551 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 23:33:25,556 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 23:33:25,556 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 23:33:25,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:33:25 BoogieIcfgContainer [2022-04-07 23:33:25,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 23:33:25,558 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 23:33:25,558 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 23:33:25,565 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 23:33:25,567 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:33:25" (1/1) ... [2022-04-07 23:33:25,569 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 23:33:25,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:33:25 BasicIcfg [2022-04-07 23:33:25,615 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 23:33:25,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 23:33:25,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 23:33:25,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 23:33:25,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:33:25" (1/4) ... [2022-04-07 23:33:25,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b02310b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:33:25, skipping insertion in model container [2022-04-07 23:33:25,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:33:25" (2/4) ... [2022-04-07 23:33:25,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b02310b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:33:25, skipping insertion in model container [2022-04-07 23:33:25,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:33:25" (3/4) ... [2022-04-07 23:33:25,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b02310b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:33:25, skipping insertion in model container [2022-04-07 23:33:25,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:33:25" (4/4) ... [2022-04-07 23:33:25,620 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll.cqvasr [2022-04-07 23:33:25,623 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 23:33:25,623 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 23:33:25,659 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 23:33:25,663 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-07 23:33:25,663 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 23:33:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 23:33:25,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 23:33:25,679 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:33:25,679 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:33:25,680 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:33:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:33:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1858340770, now seen corresponding path program 1 times [2022-04-07 23:33:25,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:33:25,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026488018] [2022-04-07 23:33:25,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:33:25,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:33:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:33:25,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:33:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:33:25,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {39#true} is VALID [2022-04-07 23:33:25,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-07 23:33:25,873 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-07 23:33:25,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 23:33:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:33:25,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} [102] assume_abort_if_notENTRY-->L12: 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] {39#true} is VALID [2022-04-07 23:33:25,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} [106] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-07 23:33:25,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-07 23:33:25,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {40#false} is VALID [2022-04-07 23:33:25,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:33:25,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {39#true} is VALID [2022-04-07 23:33:25,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-07 23:33:25,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-07 23:33:25,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-07 23:33:25,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {39#true} is VALID [2022-04-07 23:33:25,887 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {39#true} is VALID [2022-04-07 23:33:25,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} [102] assume_abort_if_notENTRY-->L12: 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] {39#true} is VALID [2022-04-07 23:33:25,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} [106] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-07 23:33:25,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-07 23:33:25,888 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {40#false} is VALID [2022-04-07 23:33:25,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {40#false} is VALID [2022-04-07 23:33:25,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} [103] L36-2-->L36-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-07 23:33:25,888 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} [108] L36-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {40#false} is VALID [2022-04-07 23:33:25,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {40#false} is VALID [2022-04-07 23:33:25,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-07 23:33:25,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-07 23:33:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:33:25,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:33:25,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026488018] [2022-04-07 23:33:25,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026488018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:33:25,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:33:25,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 23:33:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933072829] [2022-04-07 23:33:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:33:25,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 23:33:25,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:33:25,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:33:25,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:33:25,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 23:33:25,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:33:25,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 23:33:25,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 23:33:25,944 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:33:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:26,096 INFO L93 Difference]: Finished difference Result 63 states and 95 transitions. [2022-04-07 23:33:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 23:33:26,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 23:33:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:33:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:33:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-07 23:33:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:33:26,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-07 23:33:26,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-07 23:33:26,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:33:26,222 INFO L225 Difference]: With dead ends: 63 [2022-04-07 23:33:26,222 INFO L226 Difference]: Without dead ends: 31 [2022-04-07 23:33:26,224 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-07 23:33:26,228 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:33:26,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:33:26,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-07 23:33:26,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-07 23:33:26,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:33:26,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 23:33:26,249 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 23:33:26,249 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 23:33:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:26,252 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-07 23:33:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-07 23:33:26,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:33:26,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:33:26,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 31 states. [2022-04-07 23:33:26,260 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 31 states. [2022-04-07 23:33:26,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:26,263 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-07 23:33:26,263 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-07 23:33:26,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:33:26,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:33:26,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:33:26,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:33:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 23:33:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-04-07 23:33:26,268 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 17 [2022-04-07 23:33:26,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:33:26,268 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-04-07 23:33:26,269 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:33:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-07 23:33:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 23:33:26,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:33:26,269 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:33:26,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 23:33:26,270 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:33:26,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:33:26,270 INFO L85 PathProgramCache]: Analyzing trace with hash 52763140, now seen corresponding path program 1 times [2022-04-07 23:33:26,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:33:26,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915930898] [2022-04-07 23:33:26,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:33:26,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:33:26,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:33:26,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1762824012] [2022-04-07 23:33:26,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:33:26,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:33:26,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:33:26,293 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-07 23:33:26,301 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-07 23:33:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:33:26,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 23:33:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:33:26,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:33:26,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {249#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {249#true} is VALID [2022-04-07 23:33:26,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {249#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {249#true} is VALID [2022-04-07 23:33:26,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {249#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {249#true} is VALID [2022-04-07 23:33:26,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {249#true} {249#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {249#true} is VALID [2022-04-07 23:33:26,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {249#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {249#true} is VALID [2022-04-07 23:33:26,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {249#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {249#true} is VALID [2022-04-07 23:33:26,470 INFO L272 TraceCheckUtils]: 6: Hoare triple {249#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {249#true} is VALID [2022-04-07 23:33:26,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {249#true} [102] assume_abort_if_notENTRY-->L12: 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] {249#true} is VALID [2022-04-07 23:33:26,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {249#true} [107] L12-->L12-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[] {249#true} is VALID [2022-04-07 23:33:26,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {249#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {249#true} is VALID [2022-04-07 23:33:26,479 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {249#true} {249#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {249#true} is VALID [2022-04-07 23:33:26,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {249#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {287#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-07 23:33:26,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {287#(and (= main_~a~0 0) (= main_~b~0 0))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {287#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-07 23:33:26,482 INFO L272 TraceCheckUtils]: 13: Hoare triple {287#(and (= main_~a~0 0) (= main_~b~0 0))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:33:26,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:33:26,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {298#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {250#false} is VALID [2022-04-07 23:33:26,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {250#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#false} is VALID [2022-04-07 23:33:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:33:26,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 23:33:26,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:33:26,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915930898] [2022-04-07 23:33:26,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:33:26,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762824012] [2022-04-07 23:33:26,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762824012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:33:26,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:33:26,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 23:33:26,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803455465] [2022-04-07 23:33:26,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:33:26,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 23:33:26,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:33:26,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:33:26,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:33:26,503 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 23:33:26,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:33:26,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 23:33:26,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 23:33:26,504 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:33:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:26,653 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-07 23:33:26,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 23:33:26,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 23:33:26,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:33:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:33:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-07 23:33:26,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:33:26,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-07 23:33:26,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-07 23:33:26,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:33:26,710 INFO L225 Difference]: With dead ends: 42 [2022-04-07 23:33:26,711 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 23:33:26,711 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 23:33:26,712 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:33:26,713 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:33:26,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 23:33:26,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-07 23:33:26,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:33:26,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 23:33:26,725 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 23:33:26,727 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 23:33:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:26,734 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-07 23:33:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-07 23:33:26,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:33:26,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:33:26,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 40 states. [2022-04-07 23:33:26,740 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 40 states. [2022-04-07 23:33:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:26,745 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-07 23:33:26,745 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-07 23:33:26,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:33:26,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:33:26,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:33:26,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:33:26,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 23:33:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-04-07 23:33:26,747 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 17 [2022-04-07 23:33:26,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:33:26,748 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-04-07 23:33:26,748 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:33:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-07 23:33:26,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 23:33:26,748 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:33:26,748 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:33:26,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 23:33:26,959 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-07 23:33:26,960 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:33:26,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:33:26,960 INFO L85 PathProgramCache]: Analyzing trace with hash -791674298, now seen corresponding path program 1 times [2022-04-07 23:33:26,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:33:26,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515453554] [2022-04-07 23:33:26,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:33:26,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:33:26,978 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:33:26,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [432548948] [2022-04-07 23:33:26,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:33:26,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:33:26,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:33:26,983 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-07 23:33:26,984 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-07 23:33:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:33:27,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 23:33:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:33:27,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:33:27,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {505#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#true} is VALID [2022-04-07 23:33:27,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {505#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {505#true} is VALID [2022-04-07 23:33:27,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {505#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#true} is VALID [2022-04-07 23:33:27,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {505#true} {505#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#true} is VALID [2022-04-07 23:33:27,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {505#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#true} is VALID [2022-04-07 23:33:27,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {505#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {505#true} is VALID [2022-04-07 23:33:27,113 INFO L272 TraceCheckUtils]: 6: Hoare triple {505#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {505#true} is VALID [2022-04-07 23:33:27,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#true} [102] assume_abort_if_notENTRY-->L12: 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] {505#true} is VALID [2022-04-07 23:33:27,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {505#true} [107] L12-->L12-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[] {505#true} is VALID [2022-04-07 23:33:27,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#true} is VALID [2022-04-07 23:33:27,113 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {505#true} {505#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {505#true} is VALID [2022-04-07 23:33:27,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {505#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 23:33:27,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 23:33:27,114 INFO L272 TraceCheckUtils]: 13: Hoare triple {543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {505#true} is VALID [2022-04-07 23:33:27,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {505#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {505#true} is VALID [2022-04-07 23:33:27,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {505#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {505#true} is VALID [2022-04-07 23:33:27,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {505#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#true} is VALID [2022-04-07 23:33:27,116 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {505#true} {543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 23:33:27,116 INFO L272 TraceCheckUtils]: 18: Hoare triple {543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {565#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:33:27,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {565#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {569#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:33:27,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {569#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {506#false} is VALID [2022-04-07 23:33:27,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {506#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#false} is VALID [2022-04-07 23:33:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:33:27,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 23:33:27,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:33:27,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515453554] [2022-04-07 23:33:27,118 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:33:27,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432548948] [2022-04-07 23:33:27,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432548948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:33:27,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:33:27,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 23:33:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872052059] [2022-04-07 23:33:27,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:33:27,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 23:33:27,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:33:27,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 23:33:27,135 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-07 23:33:27,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 23:33:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:33:27,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 23:33:27,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 23:33:27,136 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 23:33:27,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:27,321 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-04-07 23:33:27,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 23:33:27,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 23:33:27,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:33:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 23:33:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 23:33:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 23:33:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 23:33:27,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-07 23:33:27,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:33:27,371 INFO L225 Difference]: With dead ends: 54 [2022-04-07 23:33:27,371 INFO L226 Difference]: Without dead ends: 51 [2022-04-07 23:33:27,371 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 23:33:27,372 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:33:27,372 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 123 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:33:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-07 23:33:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-07 23:33:27,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:33:27,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 23:33:27,388 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 23:33:27,388 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 23:33:27,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:27,393 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-07 23:33:27,393 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-07 23:33:27,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:33:27,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:33:27,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 51 states. [2022-04-07 23:33:27,395 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 51 states. [2022-04-07 23:33:27,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:27,398 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-07 23:33:27,399 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-07 23:33:27,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:33:27,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:33:27,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:33:27,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:33:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 23:33:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-07 23:33:27,404 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 22 [2022-04-07 23:33:27,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:33:27,404 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-07 23:33:27,404 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 23:33:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 23:33:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 23:33:27,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:33:27,404 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:33:27,422 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-07 23:33:27,615 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-07 23:33:27,615 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:33:27,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:33:27,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1388492510, now seen corresponding path program 1 times [2022-04-07 23:33:27,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:33:27,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609254621] [2022-04-07 23:33:27,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:33:27,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:33:27,629 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:33:27,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326264161] [2022-04-07 23:33:27,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:33:27,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:33:27,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:33:27,630 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-07 23:33:27,635 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-07 23:33:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:33:27,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 23:33:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:33:27,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:33:27,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {836#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-07 23:33:27,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {836#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {836#true} is VALID [2022-04-07 23:33:27,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {836#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-07 23:33:27,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {836#true} {836#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-07 23:33:27,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {836#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-07 23:33:27,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {836#true} is VALID [2022-04-07 23:33:27,769 INFO L272 TraceCheckUtils]: 6: Hoare triple {836#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {836#true} is VALID [2022-04-07 23:33:27,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {836#true} [102] assume_abort_if_notENTRY-->L12: 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] {836#true} is VALID [2022-04-07 23:33:27,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {836#true} [107] L12-->L12-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[] {836#true} is VALID [2022-04-07 23:33:27,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {836#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-07 23:33:27,770 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {836#true} {836#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {836#true} is VALID [2022-04-07 23:33:27,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {836#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {836#true} is VALID [2022-04-07 23:33:27,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {836#true} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-07 23:33:27,770 INFO L272 TraceCheckUtils]: 13: Hoare triple {836#true} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {836#true} is VALID [2022-04-07 23:33:27,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {836#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {836#true} is VALID [2022-04-07 23:33:27,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {836#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-07 23:33:27,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {836#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-07 23:33:27,771 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {836#true} {836#true} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {836#true} is VALID [2022-04-07 23:33:27,771 INFO L272 TraceCheckUtils]: 18: Hoare triple {836#true} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {836#true} is VALID [2022-04-07 23:33:27,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {836#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {836#true} is VALID [2022-04-07 23:33:27,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {836#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-07 23:33:27,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {836#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-07 23:33:27,772 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {836#true} {836#true} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {836#true} is VALID [2022-04-07 23:33:27,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {836#true} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {910#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-07 23:33:27,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {910#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-07 23:33:27,776 INFO L272 TraceCheckUtils]: 25: Hoare triple {910#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:33:27,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {917#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:33:27,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {921#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {837#false} is VALID [2022-04-07 23:33:27,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {837#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {837#false} is VALID [2022-04-07 23:33:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 23:33:27,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 23:33:27,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:33:27,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609254621] [2022-04-07 23:33:27,778 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:33:27,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326264161] [2022-04-07 23:33:27,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326264161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:33:27,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:33:27,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 23:33:27,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826499709] [2022-04-07 23:33:27,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:33:27,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 29 [2022-04-07 23:33:27,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:33:27,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-07 23:33:27,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:33:27,796 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 23:33:27,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:33:27,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 23:33:27,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 23:33:27,796 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-07 23:33:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:27,959 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2022-04-07 23:33:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 23:33:27,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 29 [2022-04-07 23:33:27,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:33:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-07 23:33:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 23:33:27,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-07 23:33:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 23:33:27,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-07 23:33:28,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:33:28,021 INFO L225 Difference]: With dead ends: 76 [2022-04-07 23:33:28,021 INFO L226 Difference]: Without dead ends: 74 [2022-04-07 23:33:28,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 23:33:28,022 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:33:28,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 126 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:33:28,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-07 23:33:28,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2022-04-07 23:33:28,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:33:28,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 23:33:28,030 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 23:33:28,030 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 23:33:28,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:28,033 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-07 23:33:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-04-07 23:33:28,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:33:28,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:33:28,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 74 states. [2022-04-07 23:33:28,034 INFO L87 Difference]: Start difference. First operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 74 states. [2022-04-07 23:33:28,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:28,037 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-07 23:33:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-04-07 23:33:28,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:33:28,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:33:28,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:33:28,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:33:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 23:33:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2022-04-07 23:33:28,040 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 29 [2022-04-07 23:33:28,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:33:28,040 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2022-04-07 23:33:28,040 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-07 23:33:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2022-04-07 23:33:28,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-07 23:33:28,041 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:33:28,041 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:33:28,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 23:33:28,259 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-07 23:33:28,260 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:33:28,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:33:28,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1377643522, now seen corresponding path program 1 times [2022-04-07 23:33:28,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:33:28,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883122839] [2022-04-07 23:33:28,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:33:28,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:33:28,276 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:33:28,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [555629615] [2022-04-07 23:33:28,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:33:28,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:33:28,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:33:28,278 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-07 23:33:28,281 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-07 23:33:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:33:28,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 23:33:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:33:28,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:33:28,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {1298#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-07 23:33:28,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {1298#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {1298#true} is VALID [2022-04-07 23:33:28,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {1298#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-07 23:33:28,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1298#true} {1298#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-07 23:33:28,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {1298#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-07 23:33:28,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {1298#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1298#true} is VALID [2022-04-07 23:33:28,529 INFO L272 TraceCheckUtils]: 6: Hoare triple {1298#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1298#true} is VALID [2022-04-07 23:33:28,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {1298#true} [102] assume_abort_if_notENTRY-->L12: 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] {1324#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 23:33:28,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {1324#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [107] L12-->L12-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[] {1328#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 23:33:28,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {1328#(not (= |assume_abort_if_not_#in~cond| 0))} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1328#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 23:33:28,531 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1328#(not (= |assume_abort_if_not_#in~cond| 0))} {1298#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1335#(<= 1 main_~y~0)} is VALID [2022-04-07 23:33:28,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {1335#(<= 1 main_~y~0)} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1335#(<= 1 main_~y~0)} is VALID [2022-04-07 23:33:28,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {1335#(<= 1 main_~y~0)} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1335#(<= 1 main_~y~0)} is VALID [2022-04-07 23:33:28,533 INFO L272 TraceCheckUtils]: 13: Hoare triple {1335#(<= 1 main_~y~0)} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1298#true} is VALID [2022-04-07 23:33:28,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {1298#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1298#true} is VALID [2022-04-07 23:33:28,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {1298#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-07 23:33:28,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {1298#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-07 23:33:28,534 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1298#true} {1335#(<= 1 main_~y~0)} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1335#(<= 1 main_~y~0)} is VALID [2022-04-07 23:33:28,535 INFO L272 TraceCheckUtils]: 18: Hoare triple {1335#(<= 1 main_~y~0)} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {1298#true} is VALID [2022-04-07 23:33:28,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {1298#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1298#true} is VALID [2022-04-07 23:33:28,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {1298#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-07 23:33:28,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {1298#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-07 23:33:28,556 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1298#true} {1335#(<= 1 main_~y~0)} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {1335#(<= 1 main_~y~0)} is VALID [2022-04-07 23:33:28,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {1335#(<= 1 main_~y~0)} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1375#(<= 1 main_~r~0)} is VALID [2022-04-07 23:33:28,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {1375#(<= 1 main_~r~0)} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1375#(<= 1 main_~r~0)} is VALID [2022-04-07 23:33:28,559 INFO L272 TraceCheckUtils]: 25: Hoare triple {1375#(<= 1 main_~r~0)} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1298#true} is VALID [2022-04-07 23:33:28,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {1298#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1298#true} is VALID [2022-04-07 23:33:28,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {1298#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-07 23:33:28,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {1298#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-07 23:33:28,569 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1298#true} {1375#(<= 1 main_~r~0)} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1375#(<= 1 main_~r~0)} is VALID [2022-04-07 23:33:28,570 INFO L272 TraceCheckUtils]: 30: Hoare triple {1375#(<= 1 main_~r~0)} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1298#true} is VALID [2022-04-07 23:33:28,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {1298#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1298#true} is VALID [2022-04-07 23:33:28,570 INFO L290 TraceCheckUtils]: 32: Hoare triple {1298#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-07 23:33:28,570 INFO L290 TraceCheckUtils]: 33: Hoare triple {1298#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-07 23:33:28,570 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1298#true} {1375#(<= 1 main_~r~0)} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1375#(<= 1 main_~r~0)} is VALID [2022-04-07 23:33:28,571 INFO L272 TraceCheckUtils]: 35: Hoare triple {1375#(<= 1 main_~r~0)} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1412#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:33:28,571 INFO L290 TraceCheckUtils]: 36: Hoare triple {1412#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:33:28,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {1416#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1299#false} is VALID [2022-04-07 23:33:28,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {1299#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1299#false} is VALID [2022-04-07 23:33:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 23:33:28,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 23:33:28,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:33:28,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883122839] [2022-04-07 23:33:28,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:33:28,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555629615] [2022-04-07 23:33:28,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555629615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:33:28,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:33:28,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-07 23:33:28,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131449548] [2022-04-07 23:33:28,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:33:28,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-07 23:33:28,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:33:28,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 23:33:28,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:33:28,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 23:33:28,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:33:28,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 23:33:28,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-07 23:33:28,593 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 23:33:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:28,826 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-07 23:33:28,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 23:33:28,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-07 23:33:28,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:33:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 23:33:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-07 23:33:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 23:33:28,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-07 23:33:28,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-07 23:33:28,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:33:28,855 INFO L225 Difference]: With dead ends: 73 [2022-04-07 23:33:28,855 INFO L226 Difference]: Without dead ends: 71 [2022-04-07 23:33:28,855 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-07 23:33:28,856 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:33:28,856 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:33:28,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-07 23:33:28,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-07 23:33:28,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:33:28,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 23:33:28,880 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 23:33:28,880 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 23:33:28,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:28,883 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-07 23:33:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-07 23:33:28,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:33:28,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:33:28,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 71 states. [2022-04-07 23:33:28,884 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 71 states. [2022-04-07 23:33:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:28,886 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-07 23:33:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-07 23:33:28,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:33:28,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:33:28,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:33:28,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:33:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 23:33:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-04-07 23:33:28,888 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 39 [2022-04-07 23:33:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:33:28,889 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-04-07 23:33:28,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 23:33:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-07 23:33:28,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-07 23:33:28,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:33:28,889 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:33:28,912 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-07 23:33:29,090 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-07 23:33:29,090 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:33:29,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:33:29,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1134631717, now seen corresponding path program 1 times [2022-04-07 23:33:29,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:33:29,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26804985] [2022-04-07 23:33:29,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:33:29,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:33:29,107 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:33:29,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1527119165] [2022-04-07 23:33:29,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:33:29,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:33:29,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:33:29,111 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:33:29,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 23:33:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:33:29,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 23:33:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:33:29,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:33:29,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {1790#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:29,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {1790#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {1790#true} is VALID [2022-04-07 23:33:29,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {1790#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:29,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1790#true} {1790#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:29,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {1790#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:29,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {1790#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1790#true} is VALID [2022-04-07 23:33:29,390 INFO L272 TraceCheckUtils]: 6: Hoare triple {1790#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1790#true} is VALID [2022-04-07 23:33:29,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {1790#true} [102] assume_abort_if_notENTRY-->L12: 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] {1790#true} is VALID [2022-04-07 23:33:29,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {1790#true} [107] L12-->L12-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[] {1790#true} is VALID [2022-04-07 23:33:29,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {1790#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:29,391 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1790#true} {1790#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1790#true} is VALID [2022-04-07 23:33:29,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {1790#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1790#true} is VALID [2022-04-07 23:33:29,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {1790#true} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:29,391 INFO L272 TraceCheckUtils]: 13: Hoare triple {1790#true} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1790#true} is VALID [2022-04-07 23:33:29,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {1790#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1790#true} is VALID [2022-04-07 23:33:29,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {1790#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:29,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {1790#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:29,392 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1790#true} {1790#true} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1790#true} is VALID [2022-04-07 23:33:29,392 INFO L272 TraceCheckUtils]: 18: Hoare triple {1790#true} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {1790#true} is VALID [2022-04-07 23:33:29,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {1790#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1790#true} is VALID [2022-04-07 23:33:29,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {1790#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:29,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {1790#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:29,393 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1790#true} {1790#true} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {1790#true} is VALID [2022-04-07 23:33:29,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {1790#true} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1790#true} is VALID [2022-04-07 23:33:29,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {1790#true} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:29,395 INFO L272 TraceCheckUtils]: 25: Hoare triple {1790#true} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1790#true} is VALID [2022-04-07 23:33:29,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {1790#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:33:29,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {1873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:33:29,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:33:29,397 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} {1790#true} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1884#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-07 23:33:29,397 INFO L272 TraceCheckUtils]: 30: Hoare triple {1884#(= main_~b~0 (* main_~a~0 main_~y~0))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1790#true} is VALID [2022-04-07 23:33:29,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {1790#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1790#true} is VALID [2022-04-07 23:33:29,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {1790#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:29,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {1790#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:29,398 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1790#true} {1884#(= main_~b~0 (* main_~a~0 main_~y~0))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1884#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-07 23:33:29,398 INFO L272 TraceCheckUtils]: 35: Hoare triple {1884#(= main_~b~0 (* main_~a~0 main_~y~0))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1790#true} is VALID [2022-04-07 23:33:29,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {1790#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1790#true} is VALID [2022-04-07 23:33:29,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {1790#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:29,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {1790#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:29,399 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1790#true} {1884#(= main_~b~0 (* main_~a~0 main_~y~0))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1884#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-07 23:33:29,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {1884#(= main_~b~0 (* main_~a~0 main_~y~0))} [130] L48-->L53: Formula: (<= (* v_main_~b~0_5 2) v_main_~r~0_6) InVars {main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[] {1918#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-07 23:33:29,400 INFO L272 TraceCheckUtils]: 41: Hoare triple {1918#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} [132] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {1922#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:33:29,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {1922#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:33:29,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {1926#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1791#false} is VALID [2022-04-07 23:33:29,401 INFO L290 TraceCheckUtils]: 44: Hoare triple {1791#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1791#false} is VALID [2022-04-07 23:33:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-07 23:33:29,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:33:32,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {1791#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1791#false} is VALID [2022-04-07 23:33:32,357 INFO L290 TraceCheckUtils]: 43: Hoare triple {1926#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1791#false} is VALID [2022-04-07 23:33:32,358 INFO L290 TraceCheckUtils]: 42: Hoare triple {1922#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:33:32,358 INFO L272 TraceCheckUtils]: 41: Hoare triple {1918#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} [132] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {1922#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:33:32,359 INFO L290 TraceCheckUtils]: 40: Hoare triple {1945#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [130] L48-->L53: Formula: (<= (* v_main_~b~0_5 2) v_main_~r~0_6) InVars {main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[] {1918#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-07 23:33:32,359 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1790#true} {1945#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1945#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-07 23:33:32,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {1790#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:32,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {1790#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:32,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {1790#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1790#true} is VALID [2022-04-07 23:33:32,362 INFO L272 TraceCheckUtils]: 35: Hoare triple {1945#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1790#true} is VALID [2022-04-07 23:33:32,363 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1790#true} {1945#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1945#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-07 23:33:32,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {1790#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:32,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {1790#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:32,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {1790#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1790#true} is VALID [2022-04-07 23:33:32,363 INFO L272 TraceCheckUtils]: 30: Hoare triple {1945#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1790#true} is VALID [2022-04-07 23:33:32,364 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} {1790#true} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1945#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-07 23:33:32,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:33:32,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {1988#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:33:32,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {1790#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1988#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 23:33:32,366 INFO L272 TraceCheckUtils]: 25: Hoare triple {1790#true} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1790#true} is VALID [2022-04-07 23:33:32,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {1790#true} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:32,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {1790#true} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1790#true} is VALID [2022-04-07 23:33:32,369 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1790#true} {1790#true} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {1790#true} is VALID [2022-04-07 23:33:32,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {1790#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:32,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {1790#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:32,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {1790#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1790#true} is VALID [2022-04-07 23:33:32,369 INFO L272 TraceCheckUtils]: 18: Hoare triple {1790#true} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {1790#true} is VALID [2022-04-07 23:33:32,369 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1790#true} {1790#true} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1790#true} is VALID [2022-04-07 23:33:32,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {1790#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:32,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {1790#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:32,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {1790#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1790#true} is VALID [2022-04-07 23:33:32,370 INFO L272 TraceCheckUtils]: 13: Hoare triple {1790#true} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1790#true} is VALID [2022-04-07 23:33:32,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {1790#true} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:32,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {1790#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1790#true} is VALID [2022-04-07 23:33:32,370 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1790#true} {1790#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1790#true} is VALID [2022-04-07 23:33:32,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {1790#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:32,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {1790#true} [107] L12-->L12-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[] {1790#true} is VALID [2022-04-07 23:33:32,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {1790#true} [102] assume_abort_if_notENTRY-->L12: 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] {1790#true} is VALID [2022-04-07 23:33:32,371 INFO L272 TraceCheckUtils]: 6: Hoare triple {1790#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1790#true} is VALID [2022-04-07 23:33:32,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {1790#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1790#true} is VALID [2022-04-07 23:33:32,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {1790#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:32,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1790#true} {1790#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:32,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {1790#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:32,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {1790#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {1790#true} is VALID [2022-04-07 23:33:32,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {1790#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#true} is VALID [2022-04-07 23:33:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-07 23:33:32,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:33:32,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26804985] [2022-04-07 23:33:32,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:33:32,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527119165] [2022-04-07 23:33:32,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527119165] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:33:32,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:33:32,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-07 23:33:32,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811833401] [2022-04-07 23:33:32,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 23:33:32,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 45 [2022-04-07 23:33:32,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:33:32,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-07 23:33:32,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:33:32,402 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 23:33:32,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:33:32,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 23:33:32,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-07 23:33:32,403 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-07 23:33:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:32,768 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2022-04-07 23:33:32,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 23:33:32,769 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 45 [2022-04-07 23:33:32,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:33:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-07 23:33:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-07 23:33:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-07 23:33:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-07 23:33:32,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-07 23:33:32,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:33:32,803 INFO L225 Difference]: With dead ends: 77 [2022-04-07 23:33:32,803 INFO L226 Difference]: Without dead ends: 75 [2022-04-07 23:33:32,803 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-07 23:33:32,804 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:33:32,804 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 136 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:33:32,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-07 23:33:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-07 23:33:32,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:33:32,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 23:33:32,833 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 23:33:32,833 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 23:33:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:32,836 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-07 23:33:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-07 23:33:32,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:33:32,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:33:32,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 75 states. [2022-04-07 23:33:32,836 INFO L87 Difference]: Start difference. First operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 75 states. [2022-04-07 23:33:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:32,838 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-07 23:33:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-07 23:33:32,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:33:32,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:33:32,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:33:32,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:33:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 23:33:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2022-04-07 23:33:32,841 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 45 [2022-04-07 23:33:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:33:32,841 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2022-04-07 23:33:32,842 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-07 23:33:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-07 23:33:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-07 23:33:32,842 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:33:32,842 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:33:32,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 23:33:33,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:33:33,048 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:33:33,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:33:33,048 INFO L85 PathProgramCache]: Analyzing trace with hash 239949443, now seen corresponding path program 1 times [2022-04-07 23:33:33,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:33:33,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336228432] [2022-04-07 23:33:33,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:33:33,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:33:33,057 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:33:33,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47367382] [2022-04-07 23:33:33,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:33:33,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:33:33,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:33:33,058 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:33:33,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-07 23:33:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:33:33,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-07 23:33:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:33:33,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:33:33,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {2455#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2455#true} is VALID [2022-04-07 23:33:33,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {2455#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {2455#true} is VALID [2022-04-07 23:33:33,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {2455#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2455#true} is VALID [2022-04-07 23:33:33,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2455#true} {2455#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2455#true} is VALID [2022-04-07 23:33:33,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {2455#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2455#true} is VALID [2022-04-07 23:33:33,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {2455#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {2455#true} is VALID [2022-04-07 23:33:33,543 INFO L272 TraceCheckUtils]: 6: Hoare triple {2455#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2455#true} is VALID [2022-04-07 23:33:33,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {2455#true} [102] assume_abort_if_notENTRY-->L12: 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] {2455#true} is VALID [2022-04-07 23:33:33,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {2455#true} [107] L12-->L12-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[] {2455#true} is VALID [2022-04-07 23:33:33,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {2455#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2455#true} is VALID [2022-04-07 23:33:33,544 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2455#true} {2455#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2455#true} is VALID [2022-04-07 23:33:33,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {2455#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 23:33:33,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 23:33:33,545 INFO L272 TraceCheckUtils]: 13: Hoare triple {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2455#true} is VALID [2022-04-07 23:33:33,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {2455#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2455#true} is VALID [2022-04-07 23:33:33,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {2455#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2455#true} is VALID [2022-04-07 23:33:33,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {2455#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2455#true} is VALID [2022-04-07 23:33:33,546 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2455#true} {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 23:33:33,546 INFO L272 TraceCheckUtils]: 18: Hoare triple {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {2455#true} is VALID [2022-04-07 23:33:33,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {2455#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2455#true} is VALID [2022-04-07 23:33:33,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {2455#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2455#true} is VALID [2022-04-07 23:33:33,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {2455#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2455#true} is VALID [2022-04-07 23:33:33,551 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2455#true} {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 23:33:33,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 23:33:33,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 23:33:33,557 INFO L272 TraceCheckUtils]: 25: Hoare triple {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2455#true} is VALID [2022-04-07 23:33:33,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {2455#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2455#true} is VALID [2022-04-07 23:33:33,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {2455#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2455#true} is VALID [2022-04-07 23:33:33,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {2455#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2455#true} is VALID [2022-04-07 23:33:33,560 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2455#true} {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 23:33:33,560 INFO L272 TraceCheckUtils]: 30: Hoare triple {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2455#true} is VALID [2022-04-07 23:33:33,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {2455#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2455#true} is VALID [2022-04-07 23:33:33,560 INFO L290 TraceCheckUtils]: 32: Hoare triple {2455#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2455#true} is VALID [2022-04-07 23:33:33,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {2455#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2455#true} is VALID [2022-04-07 23:33:33,561 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2455#true} {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 23:33:33,561 INFO L272 TraceCheckUtils]: 35: Hoare triple {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2455#true} is VALID [2022-04-07 23:33:33,561 INFO L290 TraceCheckUtils]: 36: Hoare triple {2455#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2455#true} is VALID [2022-04-07 23:33:33,561 INFO L290 TraceCheckUtils]: 37: Hoare triple {2455#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2455#true} is VALID [2022-04-07 23:33:33,561 INFO L290 TraceCheckUtils]: 38: Hoare triple {2455#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2455#true} is VALID [2022-04-07 23:33:33,562 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2455#true} {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 23:33:33,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [129] L48-->L45-3: Formula: (not (<= (* v_main_~b~0_3 2) v_main_~r~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} OutVars{main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {2582#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 23:33:33,563 INFO L290 TraceCheckUtils]: 41: Hoare triple {2582#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [125] L45-3-->L36-2: Formula: (and (= v_main_~r~0_8 (+ (* (- 1) v_main_~b~0_8) v_main_~r~0_9)) (= (+ v_main_~a~0_7 v_main_~q~0_5) v_main_~q~0_4)) InVars {main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_9, main_~a~0=v_main_~a~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {2586#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} is VALID [2022-04-07 23:33:33,563 INFO L290 TraceCheckUtils]: 42: Hoare triple {2586#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2586#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} is VALID [2022-04-07 23:33:33,563 INFO L272 TraceCheckUtils]: 43: Hoare triple {2586#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2455#true} is VALID [2022-04-07 23:33:33,564 INFO L290 TraceCheckUtils]: 44: Hoare triple {2455#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2596#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:33:33,564 INFO L290 TraceCheckUtils]: 45: Hoare triple {2596#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2600#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:33:33,564 INFO L290 TraceCheckUtils]: 46: Hoare triple {2600#(not (= |__VERIFIER_assert_#in~cond| 0))} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2600#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:33:33,565 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2600#(not (= |__VERIFIER_assert_#in~cond| 0))} {2586#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2607#(and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-07 23:33:33,566 INFO L272 TraceCheckUtils]: 48: Hoare triple {2607#(and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {2611#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:33:33,566 INFO L290 TraceCheckUtils]: 49: Hoare triple {2611#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2615#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:33:33,566 INFO L290 TraceCheckUtils]: 50: Hoare triple {2615#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2456#false} is VALID [2022-04-07 23:33:33,566 INFO L290 TraceCheckUtils]: 51: Hoare triple {2456#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2456#false} is VALID [2022-04-07 23:33:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-07 23:33:33,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:34:26,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:34:26,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336228432] [2022-04-07 23:34:26,103 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:34:26,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47367382] [2022-04-07 23:34:26,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47367382] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:34:26,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 23:34:26,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-07 23:34:26,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810785897] [2022-04-07 23:34:26,103 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 23:34:26,104 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 52 [2022-04-07 23:34:26,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:34:26,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-07 23:34:26,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:34:26,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-07 23:34:26,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:34:26,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-07 23:34:26,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-07 23:34:26,135 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-07 23:34:26,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:26,835 INFO L93 Difference]: Finished difference Result 131 states and 161 transitions. [2022-04-07 23:34:26,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 23:34:26,835 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 52 [2022-04-07 23:34:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:34:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-07 23:34:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2022-04-07 23:34:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-07 23:34:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2022-04-07 23:34:26,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 108 transitions. [2022-04-07 23:34:26,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:34:26,923 INFO L225 Difference]: With dead ends: 131 [2022-04-07 23:34:26,923 INFO L226 Difference]: Without dead ends: 82 [2022-04-07 23:34:26,924 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-07 23:34:26,924 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 23:34:26,924 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 129 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 23:34:26,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-07 23:34:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-04-07 23:34:26,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:34:26,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 23:34:26,964 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 23:34:26,965 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 23:34:26,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:26,968 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-07 23:34:26,968 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-07 23:34:26,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:34:26,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:34:26,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-07 23:34:26,969 INFO L87 Difference]: Start difference. First operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-07 23:34:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:26,972 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-07 23:34:26,972 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-07 23:34:26,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:34:26,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:34:26,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:34:26,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:34:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 23:34:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-07 23:34:26,976 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 52 [2022-04-07 23:34:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:34:26,976 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-07 23:34:26,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-07 23:34:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-07 23:34:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-07 23:34:26,976 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:34:26,977 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:34:26,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 23:34:27,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:34:27,191 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:34:27,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:34:27,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1565775829, now seen corresponding path program 1 times [2022-04-07 23:34:27,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:34:27,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291589787] [2022-04-07 23:34:27,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:34:27,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:34:27,204 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:34:27,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1560296625] [2022-04-07 23:34:27,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:34:27,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:34:27,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:34:27,205 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:34:27,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-07 23:34:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:34:27,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 23:34:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:34:27,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:34:27,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {3199#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {3199#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {3199#true} is VALID [2022-04-07 23:34:27,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {3199#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3199#true} {3199#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {3199#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {3199#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {3199#true} is VALID [2022-04-07 23:34:27,777 INFO L272 TraceCheckUtils]: 6: Hoare triple {3199#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3199#true} is VALID [2022-04-07 23:34:27,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {3199#true} [102] assume_abort_if_notENTRY-->L12: 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] {3199#true} is VALID [2022-04-07 23:34:27,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {3199#true} [107] L12-->L12-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[] {3199#true} is VALID [2022-04-07 23:34:27,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {3199#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,777 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3199#true} {3199#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3199#true} is VALID [2022-04-07 23:34:27,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {3199#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 23:34:27,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 23:34:27,778 INFO L272 TraceCheckUtils]: 13: Hoare triple {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3199#true} is VALID [2022-04-07 23:34:27,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:27,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,779 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3199#true} {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 23:34:27,779 INFO L272 TraceCheckUtils]: 18: Hoare triple {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {3199#true} is VALID [2022-04-07 23:34:27,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:27,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,780 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3199#true} {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 23:34:27,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 23:34:27,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 23:34:27,781 INFO L272 TraceCheckUtils]: 25: Hoare triple {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3199#true} is VALID [2022-04-07 23:34:27,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:27,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,782 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3199#true} {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 23:34:27,782 INFO L272 TraceCheckUtils]: 30: Hoare triple {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3199#true} is VALID [2022-04-07 23:34:27,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:27,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,783 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3199#true} {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 23:34:27,783 INFO L272 TraceCheckUtils]: 35: Hoare triple {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {3199#true} is VALID [2022-04-07 23:34:27,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:27,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,783 INFO L290 TraceCheckUtils]: 38: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,784 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3199#true} {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 23:34:27,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [130] L48-->L53: Formula: (<= (* v_main_~b~0_5 2) v_main_~r~0_6) InVars {main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[] {3326#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 23:34:27,784 INFO L272 TraceCheckUtils]: 41: Hoare triple {3326#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [132] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {3199#true} is VALID [2022-04-07 23:34:27,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:27,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,785 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3199#true} {3326#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [141] __VERIFIER_assertEXIT-->L53-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {3326#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 23:34:27,786 INFO L290 TraceCheckUtils]: 46: Hoare triple {3326#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [131] L53-1-->L45-2: Formula: (and (= v_main_~a~0_5 (* v_main_~a~0_6 2)) (= v_main_~b~0_6 (* v_main_~b~0_7 2))) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-07 23:34:27,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-07 23:34:27,786 INFO L272 TraceCheckUtils]: 48: Hoare triple {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3199#true} is VALID [2022-04-07 23:34:27,787 INFO L290 TraceCheckUtils]: 49: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:27,787 INFO L290 TraceCheckUtils]: 50: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,787 INFO L290 TraceCheckUtils]: 51: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,787 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3199#true} {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-07 23:34:27,788 INFO L272 TraceCheckUtils]: 53: Hoare triple {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3199#true} is VALID [2022-04-07 23:34:27,788 INFO L290 TraceCheckUtils]: 54: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:27,788 INFO L290 TraceCheckUtils]: 55: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,788 INFO L290 TraceCheckUtils]: 56: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,788 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3199#true} {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-07 23:34:27,790 INFO L272 TraceCheckUtils]: 58: Hoare triple {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {3199#true} is VALID [2022-04-07 23:34:27,790 INFO L290 TraceCheckUtils]: 59: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:27,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,791 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {3199#true} {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-07 23:34:27,791 INFO L290 TraceCheckUtils]: 63: Hoare triple {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [129] L48-->L45-3: Formula: (not (<= (* v_main_~b~0_3 2) v_main_~r~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} OutVars{main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {3397#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-07 23:34:27,792 INFO L290 TraceCheckUtils]: 64: Hoare triple {3397#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [125] L45-3-->L36-2: Formula: (and (= v_main_~r~0_8 (+ (* (- 1) v_main_~b~0_8) v_main_~r~0_9)) (= (+ v_main_~a~0_7 v_main_~q~0_5) v_main_~q~0_4)) InVars {main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_9, main_~a~0=v_main_~a~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {3401#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-07 23:34:27,792 INFO L290 TraceCheckUtils]: 65: Hoare triple {3401#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3401#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-07 23:34:27,793 INFO L272 TraceCheckUtils]: 66: Hoare triple {3401#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3199#true} is VALID [2022-04-07 23:34:27,793 INFO L290 TraceCheckUtils]: 67: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:27,793 INFO L290 TraceCheckUtils]: 68: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,793 INFO L290 TraceCheckUtils]: 69: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:27,793 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3199#true} {3401#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3401#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-07 23:34:27,794 INFO L272 TraceCheckUtils]: 71: Hoare triple {3401#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {3423#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:34:27,794 INFO L290 TraceCheckUtils]: 72: Hoare triple {3423#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3427#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:34:27,795 INFO L290 TraceCheckUtils]: 73: Hoare triple {3427#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3200#false} is VALID [2022-04-07 23:34:27,795 INFO L290 TraceCheckUtils]: 74: Hoare triple {3200#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3200#false} is VALID [2022-04-07 23:34:27,795 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-07 23:34:27,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:34:28,299 INFO L290 TraceCheckUtils]: 74: Hoare triple {3200#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3200#false} is VALID [2022-04-07 23:34:28,300 INFO L290 TraceCheckUtils]: 73: Hoare triple {3427#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3200#false} is VALID [2022-04-07 23:34:28,300 INFO L290 TraceCheckUtils]: 72: Hoare triple {3423#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3427#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:34:28,301 INFO L272 TraceCheckUtils]: 71: Hoare triple {3443#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {3423#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:34:28,301 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3199#true} {3443#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3443#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-07 23:34:28,301 INFO L290 TraceCheckUtils]: 69: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,301 INFO L290 TraceCheckUtils]: 68: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,302 INFO L290 TraceCheckUtils]: 67: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:28,302 INFO L272 TraceCheckUtils]: 66: Hoare triple {3443#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3199#true} is VALID [2022-04-07 23:34:28,302 INFO L290 TraceCheckUtils]: 65: Hoare triple {3443#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3443#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-07 23:34:28,309 INFO L290 TraceCheckUtils]: 64: Hoare triple {3465#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [125] L45-3-->L36-2: Formula: (and (= v_main_~r~0_8 (+ (* (- 1) v_main_~b~0_8) v_main_~r~0_9)) (= (+ v_main_~a~0_7 v_main_~q~0_5) v_main_~q~0_4)) InVars {main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_9, main_~a~0=v_main_~a~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {3443#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-07 23:34:28,309 INFO L290 TraceCheckUtils]: 63: Hoare triple {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [129] L48-->L45-3: Formula: (not (<= (* v_main_~b~0_3 2) v_main_~r~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} OutVars{main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {3465#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-07 23:34:28,310 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {3199#true} {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-07 23:34:28,310 INFO L290 TraceCheckUtils]: 61: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,310 INFO L290 TraceCheckUtils]: 60: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:28,310 INFO L272 TraceCheckUtils]: 58: Hoare triple {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {3199#true} is VALID [2022-04-07 23:34:28,311 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3199#true} {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-07 23:34:28,311 INFO L290 TraceCheckUtils]: 56: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,311 INFO L290 TraceCheckUtils]: 55: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:28,311 INFO L272 TraceCheckUtils]: 53: Hoare triple {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3199#true} is VALID [2022-04-07 23:34:28,312 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3199#true} {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-07 23:34:28,312 INFO L290 TraceCheckUtils]: 51: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,312 INFO L290 TraceCheckUtils]: 50: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,312 INFO L290 TraceCheckUtils]: 49: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:28,312 INFO L272 TraceCheckUtils]: 48: Hoare triple {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3199#true} is VALID [2022-04-07 23:34:28,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-07 23:34:28,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {3521#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [131] L53-1-->L45-2: Formula: (and (= v_main_~a~0_5 (* v_main_~a~0_6 2)) (= v_main_~b~0_6 (* v_main_~b~0_7 2))) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-07 23:34:28,315 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3199#true} {3521#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [141] __VERIFIER_assertEXIT-->L53-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {3521#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-07 23:34:28,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:28,316 INFO L272 TraceCheckUtils]: 41: Hoare triple {3521#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [132] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {3199#true} is VALID [2022-04-07 23:34:28,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [130] L48-->L53: Formula: (<= (* v_main_~b~0_5 2) v_main_~r~0_6) InVars {main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[] {3521#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-07 23:34:28,317 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3199#true} {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-07 23:34:28,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:28,317 INFO L272 TraceCheckUtils]: 35: Hoare triple {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {3199#true} is VALID [2022-04-07 23:34:28,318 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3199#true} {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-07 23:34:28,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:28,318 INFO L272 TraceCheckUtils]: 30: Hoare triple {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3199#true} is VALID [2022-04-07 23:34:28,319 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3199#true} {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-07 23:34:28,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:28,319 INFO L272 TraceCheckUtils]: 25: Hoare triple {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3199#true} is VALID [2022-04-07 23:34:28,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-07 23:34:28,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-07 23:34:28,321 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3199#true} {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} is VALID [2022-04-07 23:34:28,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:28,321 INFO L272 TraceCheckUtils]: 18: Hoare triple {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {3199#true} is VALID [2022-04-07 23:34:28,322 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3199#true} {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} is VALID [2022-04-07 23:34:28,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {3199#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {3199#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {3199#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3199#true} is VALID [2022-04-07 23:34:28,322 INFO L272 TraceCheckUtils]: 13: Hoare triple {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3199#true} is VALID [2022-04-07 23:34:28,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} is VALID [2022-04-07 23:34:28,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {3199#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} is VALID [2022-04-07 23:34:28,323 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3199#true} {3199#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3199#true} is VALID [2022-04-07 23:34:28,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {3199#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {3199#true} [107] L12-->L12-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[] {3199#true} is VALID [2022-04-07 23:34:28,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {3199#true} [102] assume_abort_if_notENTRY-->L12: 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] {3199#true} is VALID [2022-04-07 23:34:28,324 INFO L272 TraceCheckUtils]: 6: Hoare triple {3199#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3199#true} is VALID [2022-04-07 23:34:28,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {3199#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {3199#true} is VALID [2022-04-07 23:34:28,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {3199#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3199#true} {3199#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {3199#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {3199#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {3199#true} is VALID [2022-04-07 23:34:28,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {3199#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3199#true} is VALID [2022-04-07 23:34:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-07 23:34:28,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:34:28,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291589787] [2022-04-07 23:34:28,325 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:34:28,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560296625] [2022-04-07 23:34:28,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560296625] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:34:28,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:34:28,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-07 23:34:28,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575812156] [2022-04-07 23:34:28,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 23:34:28,326 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) Word has length 75 [2022-04-07 23:34:28,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:34:28,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-07 23:34:28,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:34:28,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 23:34:28,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:34:28,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 23:34:28,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-04-07 23:34:28,401 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-07 23:34:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:30,319 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions. [2022-04-07 23:34:30,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 23:34:30,319 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) Word has length 75 [2022-04-07 23:34:30,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:34:30,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-07 23:34:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2022-04-07 23:34:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-07 23:34:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2022-04-07 23:34:30,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 105 transitions. [2022-04-07 23:34:30,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:34:30,489 INFO L225 Difference]: With dead ends: 117 [2022-04-07 23:34:30,489 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 23:34:30,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-04-07 23:34:30,491 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 85 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-07 23:34:30,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 162 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-07 23:34:30,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 23:34:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 23:34:30,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:34:30,491 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-07 23:34:30,491 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-07 23:34:30,491 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-07 23:34:30,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:30,492 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:34:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:34:30,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:34:30,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:34:30,492 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-07 23:34:30,492 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-07 23:34:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:30,492 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:34:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:34:30,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:34:30,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:34:30,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:34:30,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:34:30,492 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-07 23:34:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 23:34:30,492 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2022-04-07 23:34:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:34:30,493 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 23:34:30,493 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-07 23:34:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:34:30,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:34:30,495 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 23:34:30,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-07 23:34:30,710 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:34:30,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 23:34:31,324 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-07 23:34:31,325 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:34:31,325 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:34:31,325 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 23:34:31,325 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 23:34:31,325 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:34:31,325 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:34:31,325 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-07 23:34:31,325 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-07 23:34:31,325 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-07 23:34:31,325 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-07 23:34:31,325 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 64) the Hoare annotation is: true [2022-04-07 23:34:31,325 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-07 23:34:31,326 INFO L882 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-04-07 23:34:31,326 INFO L878 garLoopResultBuilder]: At program point L36-2(lines 36 60) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-07 23:34:31,326 INFO L878 garLoopResultBuilder]: At program point L36-3(lines 36 60) the Hoare annotation is: (or (and (= main_~x~0 main_~r~0) (= main_~q~0 0)) (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0)))) [2022-04-07 23:34:31,326 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-07 23:34:31,326 INFO L882 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2022-04-07 23:34:31,326 INFO L878 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-07 23:34:31,326 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 22 64) no Hoare annotation was computed. [2022-04-07 23:34:31,326 INFO L882 garLoopResultBuilder]: For program point L38(lines 36 60) no Hoare annotation was computed. [2022-04-07 23:34:31,326 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 22 64) no Hoare annotation was computed. [2022-04-07 23:34:31,326 INFO L878 garLoopResultBuilder]: At program point L45-2(lines 45 57) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (<= 1 main_~r~0) (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-07 23:34:31,327 INFO L882 garLoopResultBuilder]: For program point L45-3(lines 45 57) no Hoare annotation was computed. [2022-04-07 23:34:31,327 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (<= 1 main_~r~0) (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-07 23:34:31,327 INFO L878 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (<= 1 main_~r~0) (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-07 23:34:31,327 INFO L878 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (<= 1 main_~r~0) (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-07 23:34:31,327 INFO L882 garLoopResultBuilder]: For program point L48(lines 45 57) no Hoare annotation was computed. [2022-04-07 23:34:31,327 INFO L882 garLoopResultBuilder]: For program point L53-1(line 53) no Hoare annotation was computed. [2022-04-07 23:34:31,327 INFO L878 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (<= (* 2 .cse0) main_~r~0) (<= 1 main_~r~0) (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-07 23:34:31,327 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-07 23:34:31,327 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-07 23:34:31,327 INFO L882 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-07 23:34:31,327 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-07 23:34:31,328 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-07 23:34:31,328 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-07 23:34:31,334 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:34:31,335 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 23:34:31,339 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:34:31,339 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 23:34:31,339 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 23:34:31,339 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:34:31,339 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 23:34:31,339 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 23:34:31,339 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 23:34:31,339 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 23:34:31,339 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 23:34:31,339 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-07 23:34:31,339 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2022-04-07 23:34:31,340 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-04-07 23:34:31,342 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2022-04-07 23:34:31,342 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2022-04-07 23:34:31,342 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2022-04-07 23:34:31,342 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 23:34:31,343 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 23:34:31,343 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 23:34:31,343 INFO L163 areAnnotationChecker]: CFG has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 23:34:31,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:34:31 BasicIcfg [2022-04-07 23:34:31,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 23:34:31,350 INFO L158 Benchmark]: Toolchain (without parser) took 66227.04ms. Allocated memory was 198.2MB in the beginning and 280.0MB in the end (delta: 81.8MB). Free memory was 142.4MB in the beginning and 187.6MB in the end (delta: -45.2MB). Peak memory consumption was 37.3MB. Max. memory is 8.0GB. [2022-04-07 23:34:31,351 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory was 158.4MB in the beginning and 158.4MB in the end (delta: 72.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 23:34:31,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.66ms. Allocated memory was 198.2MB in the beginning and 280.0MB in the end (delta: 81.8MB). Free memory was 142.2MB in the beginning and 252.8MB in the end (delta: -110.6MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. [2022-04-07 23:34:31,351 INFO L158 Benchmark]: Boogie Preprocessor took 26.73ms. Allocated memory is still 280.0MB. Free memory was 252.8MB in the beginning and 251.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 23:34:31,352 INFO L158 Benchmark]: RCFGBuilder took 215.54ms. Allocated memory is still 280.0MB. Free memory was 251.4MB in the beginning and 239.5MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 23:34:31,352 INFO L158 Benchmark]: IcfgTransformer took 57.72ms. Allocated memory is still 280.0MB. Free memory was 239.5MB in the beginning and 237.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 23:34:31,352 INFO L158 Benchmark]: TraceAbstraction took 65733.29ms. Allocated memory is still 280.0MB. Free memory was 237.1MB in the beginning and 187.6MB in the end (delta: 49.5MB). Peak memory consumption was 48.8MB. Max. memory is 8.0GB. [2022-04-07 23:34:31,354 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory was 158.4MB in the beginning and 158.4MB in the end (delta: 72.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.66ms. Allocated memory was 198.2MB in the beginning and 280.0MB in the end (delta: 81.8MB). Free memory was 142.2MB in the beginning and 252.8MB in the end (delta: -110.6MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.73ms. Allocated memory is still 280.0MB. Free memory was 252.8MB in the beginning and 251.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 215.54ms. Allocated memory is still 280.0MB. Free memory was 251.4MB in the beginning and 239.5MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 57.72ms. Allocated memory is still 280.0MB. Free memory was 239.5MB in the beginning and 237.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 65733.29ms. Allocated memory is still 280.0MB. Free memory was 237.1MB in the beginning and 187.6MB in the end (delta: 49.5MB). Peak memory consumption was 48.8MB. 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: 17]: 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, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 65.7s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 218 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 988 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 712 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1000 IncrementalHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 276 mSDtfsCounter, 1000 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 373 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=7, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 72 PreInvPairs, 123 NumberOfFragments, 232 HoareAnnotationTreeSize, 72 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 1781 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 58.0s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 406 ConstructedInterpolants, 0 QuantifiedInterpolants, 1447 SizeOfPredicates, 20 NumberOfNonLiveVariables, 819 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 602/633 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: 45]: Loop Invariant Derived loop invariant: ((1 <= r && q * y + r + a * y == b + x) && 1 <= y) && b == a * y - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (q * y + r + a * y == b + x && 1 <= y) && b == a * y RESULT: Ultimate proved your program to be correct! [2022-04-07 23:34:31,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...