/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 02:41:20,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 02:41:20,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 02:41:20,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 02:41:20,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 02:41:20,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 02:41:20,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 02:41:20,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 02:41:20,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 02:41:20,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 02:41:20,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 02:41:20,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 02:41:20,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 02:41:20,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 02:41:20,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 02:41:20,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 02:41:20,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 02:41:20,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 02:41:20,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 02:41:20,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 02:41:20,149 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 02:41:20,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 02:41:20,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 02:41:20,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 02:41:20,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 02:41:20,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 02:41:20,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 02:41:20,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 02:41:20,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 02:41:20,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 02:41:20,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 02:41:20,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 02:41:20,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 02:41:20,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 02:41:20,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 02:41:20,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 02:41:20,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 02:41:20,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 02:41:20,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 02:41:20,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 02:41:20,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 02:41:20,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 02:41:20,166 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 02:41:20,196 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 02:41:20,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 02:41:20,197 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 02:41:20,197 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 02:41:20,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 02:41:20,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 02:41:20,199 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 02:41:20,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 02:41:20,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 02:41:20,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 02:41:20,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 02:41:20,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 02:41:20,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 02:41:20,200 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 02:41:20,200 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 02:41:20,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 02:41:20,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 02:41:20,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 02:41:20,201 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 02:41:20,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 02:41:20,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 02:41:20,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 02:41:20,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 02:41:20,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 02:41:20,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 02:41:20,202 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 02:41:20,202 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 02:41:20,203 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 02:41:20,204 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 02:41:20,204 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 02:41:20,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 02:41:20,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 02:41:20,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 02:41:20,488 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 02:41:20,489 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 02:41:20,490 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound1.c [2022-04-15 02:41:20,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a122f66c/6118c0ee061f4c2485a86b6077010d1a/FLAGa8d3468e8 [2022-04-15 02:41:20,928 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 02:41:20,929 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound1.c [2022-04-15 02:41:20,935 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a122f66c/6118c0ee061f4c2485a86b6077010d1a/FLAGa8d3468e8 [2022-04-15 02:41:20,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a122f66c/6118c0ee061f4c2485a86b6077010d1a [2022-04-15 02:41:20,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 02:41:20,957 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 02:41:20,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 02:41:20,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 02:41:20,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 02:41:20,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:41:20" (1/1) ... [2022-04-15 02:41:20,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180a269d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:41:20, skipping insertion in model container [2022-04-15 02:41:20,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:41:20" (1/1) ... [2022-04-15 02:41:20,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 02:41:20,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 02:41:21,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound1.c[489,502] [2022-04-15 02:41:21,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 02:41:21,206 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 02:41:21,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound1.c[489,502] [2022-04-15 02:41:21,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 02:41:21,238 INFO L208 MainTranslator]: Completed translation [2022-04-15 02:41:21,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:41:21 WrapperNode [2022-04-15 02:41:21,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 02:41:21,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 02:41:21,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 02:41:21,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 02:41:21,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:41:21" (1/1) ... [2022-04-15 02:41:21,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:41:21" (1/1) ... [2022-04-15 02:41:21,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:41:21" (1/1) ... [2022-04-15 02:41:21,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:41:21" (1/1) ... [2022-04-15 02:41:21,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:41:21" (1/1) ... [2022-04-15 02:41:21,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:41:21" (1/1) ... [2022-04-15 02:41:21,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:41:21" (1/1) ... [2022-04-15 02:41:21,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 02:41:21,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 02:41:21,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 02:41:21,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 02:41:21,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:41:21" (1/1) ... [2022-04-15 02:41:21,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 02:41:21,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:41:21,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 02:41:21,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 02:41:21,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 02:41:21,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 02:41:21,369 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 02:41:21,369 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 02:41:21,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 02:41:21,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 02:41:21,370 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 02:41:21,370 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 02:41:21,370 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 02:41:21,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 02:41:21,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 02:41:21,370 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 02:41:21,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 02:41:21,371 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 02:41:21,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 02:41:21,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 02:41:21,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 02:41:21,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 02:41:21,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 02:41:21,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 02:41:21,427 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 02:41:21,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 02:41:21,609 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 02:41:21,616 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 02:41:21,616 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 02:41:21,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:41:21 BoogieIcfgContainer [2022-04-15 02:41:21,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 02:41:21,618 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 02:41:21,619 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 02:41:21,636 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 02:41:21,639 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:41:21" (1/1) ... [2022-04-15 02:41:21,641 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 02:41:21,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 02:41:21 BasicIcfg [2022-04-15 02:41:21,691 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 02:41:21,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 02:41:21,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 02:41:21,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 02:41:21,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:41:20" (1/4) ... [2022-04-15 02:41:21,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271bb608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:41:21, skipping insertion in model container [2022-04-15 02:41:21,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:41:21" (2/4) ... [2022-04-15 02:41:21,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271bb608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:41:21, skipping insertion in model container [2022-04-15 02:41:21,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:41:21" (3/4) ... [2022-04-15 02:41:21,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271bb608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:41:21, skipping insertion in model container [2022-04-15 02:41:21,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 02:41:21" (4/4) ... [2022-04-15 02:41:21,698 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound1.cqvasr [2022-04-15 02:41:21,707 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 02:41:21,707 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 02:41:21,757 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 02:41:21,764 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 02:41:21,765 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 02:41:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 02:41:21,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 02:41:21,792 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:41:21,793 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:41:21,793 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:41:21,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:41:21,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1381881312, now seen corresponding path program 1 times [2022-04-15 02:41:21,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:41:21,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654572756] [2022-04-15 02:41:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:41:21,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:41:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:41:22,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 02:41:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:41:22,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {40#true} is VALID [2022-04-15 02:41:22,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-15 02:41:22,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-15 02:41:22,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 02:41:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:41:22,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 02:41:22,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 02:41:22,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 02:41:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:41:22,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 02:41:22,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 02:41:22,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 02:41:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:41:22,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 02:41:22,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 02:41:22,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 02:41:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:41:22,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 02:41:22,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 02:41:22,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 02:41:22,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {40#true} is VALID [2022-04-15 02:41:22,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-15 02:41:22,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-15 02:41:22,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-15 02:41:22,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {40#true} is VALID [2022-04-15 02:41:22,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-15 02:41:22,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 02:41:22,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,102 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 02:41:22,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {41#false} is VALID [2022-04-15 02:41:22,102 INFO L272 TraceCheckUtils]: 12: Hoare triple {41#false} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-15 02:41:22,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 02:41:22,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,106 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41#false} {41#false} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 02:41:22,106 INFO L272 TraceCheckUtils]: 17: Hoare triple {41#false} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-15 02:41:22,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 02:41:22,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,108 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41#false} {41#false} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 02:41:22,108 INFO L272 TraceCheckUtils]: 22: Hoare triple {41#false} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-15 02:41:22,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 02:41:22,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,110 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41#false} {41#false} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 02:41:22,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {41#false} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {41#false} is VALID [2022-04-15 02:41:22,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {41#false} [107] L43-2-->L35-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,114 INFO L272 TraceCheckUtils]: 29: Hoare triple {41#false} [110] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {41#false} is VALID [2022-04-15 02:41:22,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {41#false} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {41#false} is VALID [2022-04-15 02:41:22,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {41#false} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {41#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:41:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 02:41:22,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:41:22,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654572756] [2022-04-15 02:41:22,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654572756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:41:22,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:41:22,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 02:41:22,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243092935] [2022-04-15 02:41:22,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:41:22,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 02:41:22,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:41:22,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 02:41:22,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:41:22,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 02:41:22,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:41:22,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 02:41:22,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 02:41:22,193 INFO L87 Difference]: Start difference. First operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 02:41:22,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:41:22,396 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions. [2022-04-15 02:41:22,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 02:41:22,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 02:41:22,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:41:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 02:41:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-15 02:41:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 02:41:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-15 02:41:22,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2022-04-15 02:41:22,542 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-15 02:41:22,551 INFO L225 Difference]: With dead ends: 67 [2022-04-15 02:41:22,551 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 02:41:22,554 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 02:41:22,560 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:41:22,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:41:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 02:41:22,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 02:41:22,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:41:22,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 02:41:22,597 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 02:41:22,597 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 02:41:22,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:41:22,603 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-15 02:41:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 02:41:22,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:41:22,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:41:22,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-15 02:41:22,605 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-15 02:41:22,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:41:22,610 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-15 02:41:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 02:41:22,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:41:22,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:41:22,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:41:22,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:41:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 02:41:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-15 02:41:22,630 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 33 [2022-04-15 02:41:22,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:41:22,630 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-15 02:41:22,630 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 02:41:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 02:41:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 02:41:22,632 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:41:22,632 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:41:22,632 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 02:41:22,632 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:41:22,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:41:22,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1975235811, now seen corresponding path program 1 times [2022-04-15 02:41:22,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:41:22,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341972893] [2022-04-15 02:41:22,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:41:22,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:41:22,658 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:41:22,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [547487620] [2022-04-15 02:41:22,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:41:22,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:41:22,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:41:22,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:41:22,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 02:41:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:41:22,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 02:41:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:41:22,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:41:22,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {276#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:41:22,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {276#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {276#true} is VALID [2022-04-15 02:41:22,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {276#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:41:22,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {276#true} {276#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:41:22,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {276#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:41:22,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {276#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {276#true} is VALID [2022-04-15 02:41:22,955 INFO L272 TraceCheckUtils]: 6: Hoare triple {276#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-15 02:41:22,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {276#true} is VALID [2022-04-15 02:41:22,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:41:22,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {276#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:41:22,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {276#true} {276#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-15 02:41:22,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {276#true} is VALID [2022-04-15 02:41:22,956 INFO L272 TraceCheckUtils]: 12: Hoare triple {276#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-15 02:41:22,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {276#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {276#true} is VALID [2022-04-15 02:41:22,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {276#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:41:22,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {276#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:41:22,957 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {276#true} {276#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-15 02:41:22,957 INFO L272 TraceCheckUtils]: 17: Hoare triple {276#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-15 02:41:22,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {276#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {276#true} is VALID [2022-04-15 02:41:22,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {276#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:41:22,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {276#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:41:22,958 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {276#true} {276#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-15 02:41:22,958 INFO L272 TraceCheckUtils]: 22: Hoare triple {276#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-15 02:41:22,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {276#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {276#true} is VALID [2022-04-15 02:41:22,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {276#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:41:22,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {276#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:41:22,958 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {276#true} {276#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-15 02:41:22,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {276#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {362#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-15 02:41:22,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {362#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {362#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-15 02:41:22,964 INFO L272 TraceCheckUtils]: 29: Hoare triple {362#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {369#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:41:22,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {369#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {373#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:41:22,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {373#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {277#false} is VALID [2022-04-15 02:41:22,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {277#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {277#false} is VALID [2022-04-15 02:41:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 02:41:22,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:41:22,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:41:22,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341972893] [2022-04-15 02:41:22,966 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:41:22,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547487620] [2022-04-15 02:41:22,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547487620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:41:22,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:41:22,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 02:41:22,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867195124] [2022-04-15 02:41:22,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:41:22,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-15 02:41:22,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:41:22,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 02:41:23,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:41:23,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:41:23,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:41:23,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:41:23,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:41:23,005 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 02:41:23,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:41:23,272 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-15 02:41:23,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:41:23,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-15 02:41:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:41:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 02:41:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 02:41:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 02:41:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 02:41:23,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-15 02:41:23,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:41:23,366 INFO L225 Difference]: With dead ends: 48 [2022-04-15 02:41:23,367 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 02:41:23,367 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:41:23,369 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:41:23,370 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 143 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:41:23,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 02:41:23,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-15 02:41:23,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:41:23,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 02:41:23,385 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 02:41:23,386 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 02:41:23,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:41:23,390 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-15 02:41:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-15 02:41:23,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:41:23,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:41:23,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-15 02:41:23,392 INFO L87 Difference]: Start difference. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-15 02:41:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:41:23,396 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-15 02:41:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-15 02:41:23,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:41:23,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:41:23,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:41:23,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:41:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 02:41:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-04-15 02:41:23,401 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 33 [2022-04-15 02:41:23,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:41:23,402 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-04-15 02:41:23,402 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 02:41:23,402 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-15 02:41:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 02:41:23,403 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:41:23,403 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:41:23,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 02:41:23,619 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:41:23,620 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:41:23,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:41:23,621 INFO L85 PathProgramCache]: Analyzing trace with hash -759782395, now seen corresponding path program 1 times [2022-04-15 02:41:23,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:41:23,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531444514] [2022-04-15 02:41:23,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:41:23,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:41:23,647 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:41:23,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [209515497] [2022-04-15 02:41:23,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:41:23,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:41:23,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:41:23,648 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:41:23,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 02:41:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:41:23,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 02:41:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:41:23,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:41:24,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {619#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-15 02:41:24,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {619#true} is VALID [2022-04-15 02:41:24,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-15 02:41:24,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {619#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-15 02:41:24,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {619#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-15 02:41:24,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {619#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {619#true} is VALID [2022-04-15 02:41:24,033 INFO L272 TraceCheckUtils]: 6: Hoare triple {619#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {619#true} is VALID [2022-04-15 02:41:24,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {619#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:41:24,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:41:24,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {649#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:41:24,035 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {649#(not (= |assume_abort_if_not_#in~cond| 0))} {619#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {656#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 02:41:24,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {656#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {656#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 02:41:24,036 INFO L272 TraceCheckUtils]: 12: Hoare triple {656#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {619#true} is VALID [2022-04-15 02:41:24,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {619#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {619#true} is VALID [2022-04-15 02:41:24,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {619#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-15 02:41:24,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {619#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-15 02:41:24,037 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {619#true} {656#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {656#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 02:41:24,037 INFO L272 TraceCheckUtils]: 17: Hoare triple {656#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {619#true} is VALID [2022-04-15 02:41:24,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {619#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:41:24,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:41:24,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {649#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:41:24,040 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {649#(not (= |assume_abort_if_not_#in~cond| 0))} {656#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {690#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 02:41:24,040 INFO L272 TraceCheckUtils]: 22: Hoare triple {690#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {619#true} is VALID [2022-04-15 02:41:24,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {619#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {619#true} is VALID [2022-04-15 02:41:24,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {619#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-15 02:41:24,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {619#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-15 02:41:24,041 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {619#true} {690#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {690#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 02:41:24,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {690#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {709#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:41:24,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {709#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {709#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:41:24,042 INFO L272 TraceCheckUtils]: 29: Hoare triple {709#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {619#true} is VALID [2022-04-15 02:41:24,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {619#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {619#true} is VALID [2022-04-15 02:41:24,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {619#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-15 02:41:24,045 INFO L290 TraceCheckUtils]: 32: Hoare triple {619#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-15 02:41:24,046 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {619#true} {709#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {709#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:41:24,047 INFO L272 TraceCheckUtils]: 34: Hoare triple {709#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {731#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:41:24,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {731#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {735#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:41:24,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {735#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {620#false} is VALID [2022-04-15 02:41:24,048 INFO L290 TraceCheckUtils]: 37: Hoare triple {620#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {620#false} is VALID [2022-04-15 02:41:24,049 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 02:41:24,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:41:51,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:41:51,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531444514] [2022-04-15 02:41:51,539 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:41:51,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209515497] [2022-04-15 02:41:51,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209515497] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 02:41:51,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 02:41:51,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-15 02:41:51,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771134792] [2022-04-15 02:41:51,540 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-15 02:41:51,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-04-15 02:41:51,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:41:51,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 02:41:51,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:41:51,571 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 02:41:51,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:41:51,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 02:41:51,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 02:41:51,572 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 02:41:52,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:41:52,149 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-04-15 02:41:52,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 02:41:52,150 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-04-15 02:41:52,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:41:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 02:41:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-15 02:41:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 02:41:52,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-15 02:41:52,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 65 transitions. [2022-04-15 02:41:52,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:41:52,236 INFO L225 Difference]: With dead ends: 52 [2022-04-15 02:41:52,236 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 02:41:52,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-15 02:41:52,238 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 02:41:52,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 190 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 02:41:52,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 02:41:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-15 02:41:52,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:41:52,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 02:41:52,263 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 02:41:52,263 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 02:41:52,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:41:52,266 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-15 02:41:52,266 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-15 02:41:52,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:41:52,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:41:52,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-15 02:41:52,268 INFO L87 Difference]: Start difference. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-15 02:41:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:41:52,271 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-15 02:41:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-15 02:41:52,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:41:52,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:41:52,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:41:52,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:41:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 02:41:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2022-04-15 02:41:52,276 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 38 [2022-04-15 02:41:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:41:52,276 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2022-04-15 02:41:52,277 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 02:41:52,277 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-15 02:41:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 02:41:52,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:41:52,278 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1] [2022-04-15 02:41:52,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 02:41:52,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 02:41:52,506 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:41:52,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:41:52,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1840397536, now seen corresponding path program 1 times [2022-04-15 02:41:52,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:41:52,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670994844] [2022-04-15 02:41:52,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:41:52,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:41:52,524 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:41:52,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1626586587] [2022-04-15 02:41:52,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:41:52,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:41:52,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:41:52,528 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:41:52,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 02:41:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:41:52,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 02:41:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:41:52,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:41:53,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {1017#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1017#true} is VALID [2022-04-15 02:41:53,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {1017#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {1017#true} is VALID [2022-04-15 02:41:53,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {1017#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1017#true} is VALID [2022-04-15 02:41:53,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1017#true} {1017#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1017#true} is VALID [2022-04-15 02:41:53,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {1017#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1017#true} is VALID [2022-04-15 02:41:53,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {1017#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1017#true} is VALID [2022-04-15 02:41:53,064 INFO L272 TraceCheckUtils]: 6: Hoare triple {1017#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1017#true} is VALID [2022-04-15 02:41:53,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {1017#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1017#true} is VALID [2022-04-15 02:41:53,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {1017#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1017#true} is VALID [2022-04-15 02:41:53,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {1017#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1017#true} is VALID [2022-04-15 02:41:53,064 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1017#true} {1017#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1017#true} is VALID [2022-04-15 02:41:53,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {1017#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1017#true} is VALID [2022-04-15 02:41:53,064 INFO L272 TraceCheckUtils]: 12: Hoare triple {1017#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1017#true} is VALID [2022-04-15 02:41:53,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {1017#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1061#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:41:53,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {1061#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1065#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:41:53,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {1065#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1065#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:41:53,067 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1065#(not (= |assume_abort_if_not_#in~cond| 0))} {1017#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1072#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 02:41:53,067 INFO L272 TraceCheckUtils]: 17: Hoare triple {1072#(and (<= 0 main_~y~0) (<= main_~y~0 1))} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1017#true} is VALID [2022-04-15 02:41:53,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {1017#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1017#true} is VALID [2022-04-15 02:41:53,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {1017#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1017#true} is VALID [2022-04-15 02:41:53,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {1017#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1017#true} is VALID [2022-04-15 02:41:53,068 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1017#true} {1072#(and (<= 0 main_~y~0) (<= main_~y~0 1))} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1072#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 02:41:53,068 INFO L272 TraceCheckUtils]: 22: Hoare triple {1072#(and (<= 0 main_~y~0) (<= main_~y~0 1))} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1017#true} is VALID [2022-04-15 02:41:53,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {1017#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1061#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:41:53,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {1061#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1065#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:41:53,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {1065#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1065#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:41:53,070 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1065#(not (= |assume_abort_if_not_#in~cond| 0))} {1072#(and (<= 0 main_~y~0) (<= main_~y~0 1))} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1103#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 02:41:53,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {1103#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1107#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 02:41:53,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {1107#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1107#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 02:41:53,071 INFO L272 TraceCheckUtils]: 29: Hoare triple {1107#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1017#true} is VALID [2022-04-15 02:41:53,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {1017#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1017#true} is VALID [2022-04-15 02:41:53,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {1017#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1017#true} is VALID [2022-04-15 02:41:53,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {1017#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1017#true} is VALID [2022-04-15 02:41:53,073 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1017#true} {1107#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1107#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 02:41:53,073 INFO L272 TraceCheckUtils]: 34: Hoare triple {1107#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1017#true} is VALID [2022-04-15 02:41:53,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {1017#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1017#true} is VALID [2022-04-15 02:41:53,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {1017#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1017#true} is VALID [2022-04-15 02:41:53,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {1017#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1017#true} is VALID [2022-04-15 02:41:53,074 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1017#true} {1107#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1107#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 02:41:53,075 INFO L272 TraceCheckUtils]: 39: Hoare triple {1107#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1144#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:41:53,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {1144#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1148#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:41:53,076 INFO L290 TraceCheckUtils]: 41: Hoare triple {1148#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1018#false} is VALID [2022-04-15 02:41:53,076 INFO L290 TraceCheckUtils]: 42: Hoare triple {1018#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#false} is VALID [2022-04-15 02:41:53,077 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 02:41:53,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:42:26,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:42:26,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670994844] [2022-04-15 02:42:26,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:42:26,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626586587] [2022-04-15 02:42:26,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626586587] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 02:42:26,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 02:42:26,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-15 02:42:26,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298498390] [2022-04-15 02:42:26,252 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-15 02:42:26,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2022-04-15 02:42:26,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:42:26,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 02:42:26,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:26,283 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 02:42:26,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:42:26,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 02:42:26,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 02:42:26,284 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 02:42:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:26,837 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2022-04-15 02:42:26,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 02:42:26,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2022-04-15 02:42:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:42:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 02:42:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-15 02:42:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 02:42:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-15 02:42:26,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 65 transitions. [2022-04-15 02:42:26,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:26,912 INFO L225 Difference]: With dead ends: 74 [2022-04-15 02:42:26,912 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 02:42:26,913 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-15 02:42:26,914 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 30 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 02:42:26,914 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 158 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 02:42:26,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 02:42:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-15 02:42:26,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:42:26,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:42:26,987 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:42:26,988 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:42:26,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:26,994 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-15 02:42:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-15 02:42:26,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:26,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:26,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-15 02:42:26,997 INFO L87 Difference]: Start difference. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-15 02:42:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:27,003 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-15 02:42:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-15 02:42:27,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:27,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:27,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:42:27,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:42:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:42:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2022-04-15 02:42:27,009 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 43 [2022-04-15 02:42:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:42:27,010 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2022-04-15 02:42:27,011 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 02:42:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-15 02:42:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 02:42:27,014 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:42:27,014 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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-15 02:42:27,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 02:42:27,235 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:42:27,236 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:42:27,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:42:27,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1590647429, now seen corresponding path program 1 times [2022-04-15 02:42:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:42:27,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774063698] [2022-04-15 02:42:27,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:27,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:42:27,258 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:42:27,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444587782] [2022-04-15 02:42:27,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:27,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:42:27,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:42:27,260 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:42:27,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 02:42:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:27,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 02:42:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:27,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:42:27,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {1542#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {1542#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {1542#true} is VALID [2022-04-15 02:42:27,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {1542#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1542#true} {1542#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {1542#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {1542#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1542#true} is VALID [2022-04-15 02:42:27,471 INFO L272 TraceCheckUtils]: 6: Hoare triple {1542#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1542#true} is VALID [2022-04-15 02:42:27,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {1542#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1542#true} is VALID [2022-04-15 02:42:27,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {1542#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {1542#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,471 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1542#true} {1542#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1542#true} is VALID [2022-04-15 02:42:27,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {1542#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1542#true} is VALID [2022-04-15 02:42:27,472 INFO L272 TraceCheckUtils]: 12: Hoare triple {1542#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1542#true} is VALID [2022-04-15 02:42:27,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1542#true} is VALID [2022-04-15 02:42:27,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {1542#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {1542#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,473 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1542#true} {1542#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1542#true} is VALID [2022-04-15 02:42:27,473 INFO L272 TraceCheckUtils]: 17: Hoare triple {1542#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1542#true} is VALID [2022-04-15 02:42:27,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {1542#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1542#true} is VALID [2022-04-15 02:42:27,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {1542#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {1542#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,473 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1542#true} {1542#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1542#true} is VALID [2022-04-15 02:42:27,473 INFO L272 TraceCheckUtils]: 22: Hoare triple {1542#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1542#true} is VALID [2022-04-15 02:42:27,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {1542#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1542#true} is VALID [2022-04-15 02:42:27,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {1542#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {1542#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,474 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1542#true} {1542#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1542#true} is VALID [2022-04-15 02:42:27,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {1542#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1542#true} is VALID [2022-04-15 02:42:27,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {1542#true} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,474 INFO L272 TraceCheckUtils]: 29: Hoare triple {1542#true} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1542#true} is VALID [2022-04-15 02:42:27,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {1542#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1542#true} is VALID [2022-04-15 02:42:27,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {1542#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {1542#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,475 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1542#true} {1542#true} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1542#true} is VALID [2022-04-15 02:42:27,475 INFO L272 TraceCheckUtils]: 34: Hoare triple {1542#true} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1542#true} is VALID [2022-04-15 02:42:27,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {1542#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1542#true} is VALID [2022-04-15 02:42:27,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {1542#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,475 INFO L290 TraceCheckUtils]: 37: Hoare triple {1542#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,475 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1542#true} {1542#true} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1542#true} is VALID [2022-04-15 02:42:27,476 INFO L272 TraceCheckUtils]: 39: Hoare triple {1542#true} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1542#true} is VALID [2022-04-15 02:42:27,476 INFO L290 TraceCheckUtils]: 40: Hoare triple {1542#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1542#true} is VALID [2022-04-15 02:42:27,476 INFO L290 TraceCheckUtils]: 41: Hoare triple {1542#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,476 INFO L290 TraceCheckUtils]: 42: Hoare triple {1542#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1542#true} is VALID [2022-04-15 02:42:27,476 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1542#true} {1542#true} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1542#true} is VALID [2022-04-15 02:42:27,477 INFO L290 TraceCheckUtils]: 44: Hoare triple {1542#true} [123] L38-->L35-2: Formula: (= v_main_~a~0_9 v_main_~b~0_11) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {1679#(= main_~b~0 main_~a~0)} is VALID [2022-04-15 02:42:27,477 INFO L272 TraceCheckUtils]: 45: Hoare triple {1679#(= main_~b~0 main_~a~0)} [110] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {1683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:42:27,478 INFO L290 TraceCheckUtils]: 46: Hoare triple {1683#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:42:27,478 INFO L290 TraceCheckUtils]: 47: Hoare triple {1687#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1543#false} is VALID [2022-04-15 02:42:27,478 INFO L290 TraceCheckUtils]: 48: Hoare triple {1543#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#false} is VALID [2022-04-15 02:42:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-15 02:42:27,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:42:27,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:42:27,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774063698] [2022-04-15 02:42:27,479 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:42:27,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444587782] [2022-04-15 02:42:27,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444587782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:42:27,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:42:27,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 02:42:27,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13453052] [2022-04-15 02:42:27,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:42:27,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-15 02:42:27,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:42:27,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-15 02:42:27,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:27,509 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:42:27,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:42:27,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:42:27,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:42:27,510 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-15 02:42:27,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:27,740 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2022-04-15 02:42:27,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:42:27,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-15 02:42:27,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:42:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-15 02:42:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 02:42:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-15 02:42:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 02:42:27,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-15 02:42:27,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:27,806 INFO L225 Difference]: With dead ends: 76 [2022-04-15 02:42:27,806 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 02:42:27,806 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:42:27,807 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:42:27,807 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:42:27,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 02:42:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-15 02:42:27,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:42:27,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:42:27,877 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:42:27,877 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:42:27,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:27,881 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-15 02:42:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-15 02:42:27,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:27,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:27,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-15 02:42:27,889 INFO L87 Difference]: Start difference. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-15 02:42:27,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:27,898 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-15 02:42:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-15 02:42:27,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:27,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:27,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:42:27,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:42:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:42:27,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 101 transitions. [2022-04-15 02:42:27,904 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 101 transitions. Word has length 49 [2022-04-15 02:42:27,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:42:27,905 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 101 transitions. [2022-04-15 02:42:27,906 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-15 02:42:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-15 02:42:27,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 02:42:27,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:42:27,908 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 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, 1, 1, 1] [2022-04-15 02:42:27,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 02:42:28,119 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:42:28,120 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:42:28,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:42:28,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1737902154, now seen corresponding path program 1 times [2022-04-15 02:42:28,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:42:28,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394150771] [2022-04-15 02:42:28,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:28,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:42:28,139 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:42:28,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1776646806] [2022-04-15 02:42:28,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:28,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:42:28,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:42:28,141 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:42:28,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 02:42:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:28,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 02:42:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:28,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:42:28,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {2077#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {2077#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {2077#true} is VALID [2022-04-15 02:42:28,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {2077#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2077#true} {2077#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {2077#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {2077#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2077#true} is VALID [2022-04-15 02:42:28,541 INFO L272 TraceCheckUtils]: 6: Hoare triple {2077#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2077#true} is VALID [2022-04-15 02:42:28,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {2077#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2103#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:42:28,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {2103#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2107#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:28,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {2107#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2107#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:28,543 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2107#(not (= |assume_abort_if_not_#in~cond| 0))} {2077#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2114#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 02:42:28,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {2114#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {2114#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 02:42:28,543 INFO L272 TraceCheckUtils]: 12: Hoare triple {2114#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2077#true} is VALID [2022-04-15 02:42:28,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {2077#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2077#true} is VALID [2022-04-15 02:42:28,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {2077#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {2077#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,544 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2077#true} {2114#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2114#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 02:42:28,544 INFO L272 TraceCheckUtils]: 17: Hoare triple {2114#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2077#true} is VALID [2022-04-15 02:42:28,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {2077#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2077#true} is VALID [2022-04-15 02:42:28,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {2077#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {2077#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,545 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2077#true} {2114#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2114#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 02:42:28,545 INFO L272 TraceCheckUtils]: 22: Hoare triple {2114#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2077#true} is VALID [2022-04-15 02:42:28,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {2077#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2103#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:42:28,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {2103#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2107#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:28,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {2107#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2107#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:28,547 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2107#(not (= |assume_abort_if_not_#in~cond| 0))} {2114#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2163#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0))} is VALID [2022-04-15 02:42:28,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {2163#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0))} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2167#(and (<= main_~a~0 1) (<= 1 main_~b~0))} is VALID [2022-04-15 02:42:28,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {2167#(and (<= main_~a~0 1) (<= 1 main_~b~0))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2167#(and (<= main_~a~0 1) (<= 1 main_~b~0))} is VALID [2022-04-15 02:42:28,555 INFO L272 TraceCheckUtils]: 29: Hoare triple {2167#(and (<= main_~a~0 1) (<= 1 main_~b~0))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2077#true} is VALID [2022-04-15 02:42:28,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {2077#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2077#true} is VALID [2022-04-15 02:42:28,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {2077#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {2077#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,556 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2077#true} {2167#(and (<= main_~a~0 1) (<= 1 main_~b~0))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2167#(and (<= main_~a~0 1) (<= 1 main_~b~0))} is VALID [2022-04-15 02:42:28,556 INFO L272 TraceCheckUtils]: 34: Hoare triple {2167#(and (<= main_~a~0 1) (<= 1 main_~b~0))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2077#true} is VALID [2022-04-15 02:42:28,557 INFO L290 TraceCheckUtils]: 35: Hoare triple {2077#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2077#true} is VALID [2022-04-15 02:42:28,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {2077#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {2077#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,557 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2077#true} {2167#(and (<= main_~a~0 1) (<= 1 main_~b~0))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2167#(and (<= main_~a~0 1) (<= 1 main_~b~0))} is VALID [2022-04-15 02:42:28,558 INFO L272 TraceCheckUtils]: 39: Hoare triple {2167#(and (<= main_~a~0 1) (<= 1 main_~b~0))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2077#true} is VALID [2022-04-15 02:42:28,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {2077#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2077#true} is VALID [2022-04-15 02:42:28,558 INFO L290 TraceCheckUtils]: 41: Hoare triple {2077#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {2077#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,559 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2077#true} {2167#(and (<= main_~a~0 1) (<= 1 main_~b~0))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2167#(and (<= main_~a~0 1) (<= 1 main_~b~0))} is VALID [2022-04-15 02:42:28,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {2167#(and (<= main_~a~0 1) (<= 1 main_~b~0))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {2167#(and (<= main_~a~0 1) (<= 1 main_~b~0))} is VALID [2022-04-15 02:42:28,560 INFO L290 TraceCheckUtils]: 45: Hoare triple {2167#(and (<= main_~a~0 1) (<= 1 main_~b~0))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {2078#false} is VALID [2022-04-15 02:42:28,560 INFO L290 TraceCheckUtils]: 46: Hoare triple {2078#false} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2078#false} is VALID [2022-04-15 02:42:28,560 INFO L272 TraceCheckUtils]: 47: Hoare triple {2078#false} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2078#false} is VALID [2022-04-15 02:42:28,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {2078#false} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2078#false} is VALID [2022-04-15 02:42:28,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {2078#false} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2078#false} is VALID [2022-04-15 02:42:28,561 INFO L290 TraceCheckUtils]: 50: Hoare triple {2078#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2078#false} is VALID [2022-04-15 02:42:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 02:42:28,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:42:28,986 INFO L290 TraceCheckUtils]: 50: Hoare triple {2078#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2078#false} is VALID [2022-04-15 02:42:28,986 INFO L290 TraceCheckUtils]: 49: Hoare triple {2078#false} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2078#false} is VALID [2022-04-15 02:42:28,986 INFO L290 TraceCheckUtils]: 48: Hoare triple {2078#false} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2078#false} is VALID [2022-04-15 02:42:28,986 INFO L272 TraceCheckUtils]: 47: Hoare triple {2078#false} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2078#false} is VALID [2022-04-15 02:42:28,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {2078#false} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2078#false} is VALID [2022-04-15 02:42:28,991 INFO L290 TraceCheckUtils]: 45: Hoare triple {2252#(not (< main_~b~0 main_~a~0))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {2078#false} is VALID [2022-04-15 02:42:28,992 INFO L290 TraceCheckUtils]: 44: Hoare triple {2252#(not (< main_~b~0 main_~a~0))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {2252#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 02:42:28,993 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2077#true} {2252#(not (< main_~b~0 main_~a~0))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2252#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 02:42:28,993 INFO L290 TraceCheckUtils]: 42: Hoare triple {2077#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,993 INFO L290 TraceCheckUtils]: 41: Hoare triple {2077#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {2077#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2077#true} is VALID [2022-04-15 02:42:28,993 INFO L272 TraceCheckUtils]: 39: Hoare triple {2252#(not (< main_~b~0 main_~a~0))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2077#true} is VALID [2022-04-15 02:42:28,994 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2077#true} {2252#(not (< main_~b~0 main_~a~0))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2252#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 02:42:28,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {2077#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {2077#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:28,994 INFO L290 TraceCheckUtils]: 35: Hoare triple {2077#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2077#true} is VALID [2022-04-15 02:42:28,995 INFO L272 TraceCheckUtils]: 34: Hoare triple {2252#(not (< main_~b~0 main_~a~0))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2077#true} is VALID [2022-04-15 02:42:28,999 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2077#true} {2252#(not (< main_~b~0 main_~a~0))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2252#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 02:42:29,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {2077#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:29,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {2077#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:29,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {2077#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2077#true} is VALID [2022-04-15 02:42:29,000 INFO L272 TraceCheckUtils]: 29: Hoare triple {2252#(not (< main_~b~0 main_~a~0))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2077#true} is VALID [2022-04-15 02:42:29,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {2252#(not (< main_~b~0 main_~a~0))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2252#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 02:42:29,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {2307#(<= main_~x~0 main_~y~0)} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2252#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 02:42:29,002 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2107#(not (= |assume_abort_if_not_#in~cond| 0))} {2311#(<= main_~x~0 1)} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2307#(<= main_~x~0 main_~y~0)} is VALID [2022-04-15 02:42:29,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {2107#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2107#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:29,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {2321#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2107#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:29,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {2077#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2321#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 02:42:29,003 INFO L272 TraceCheckUtils]: 22: Hoare triple {2311#(<= main_~x~0 1)} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2077#true} is VALID [2022-04-15 02:42:29,003 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2077#true} {2311#(<= main_~x~0 1)} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2311#(<= main_~x~0 1)} is VALID [2022-04-15 02:42:29,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {2077#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:29,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {2077#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:29,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {2077#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2077#true} is VALID [2022-04-15 02:42:29,004 INFO L272 TraceCheckUtils]: 17: Hoare triple {2311#(<= main_~x~0 1)} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2077#true} is VALID [2022-04-15 02:42:29,004 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2077#true} {2311#(<= main_~x~0 1)} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2311#(<= main_~x~0 1)} is VALID [2022-04-15 02:42:29,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {2077#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:29,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {2077#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:29,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {2077#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2077#true} is VALID [2022-04-15 02:42:29,006 INFO L272 TraceCheckUtils]: 12: Hoare triple {2311#(<= main_~x~0 1)} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2077#true} is VALID [2022-04-15 02:42:29,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {2311#(<= main_~x~0 1)} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {2311#(<= main_~x~0 1)} is VALID [2022-04-15 02:42:29,008 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2107#(not (= |assume_abort_if_not_#in~cond| 0))} {2077#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2311#(<= main_~x~0 1)} is VALID [2022-04-15 02:42:29,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {2107#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2107#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:29,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {2321#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2107#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:29,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {2077#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2321#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 02:42:29,011 INFO L272 TraceCheckUtils]: 6: Hoare triple {2077#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2077#true} is VALID [2022-04-15 02:42:29,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {2077#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2077#true} is VALID [2022-04-15 02:42:29,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {2077#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:29,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2077#true} {2077#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:29,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {2077#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:29,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {2077#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {2077#true} is VALID [2022-04-15 02:42:29,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {2077#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2077#true} is VALID [2022-04-15 02:42:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 02:42:29,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:42:29,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394150771] [2022-04-15 02:42:29,015 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:42:29,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776646806] [2022-04-15 02:42:29,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776646806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:42:29,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 02:42:29,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-04-15 02:42:29,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440646313] [2022-04-15 02:42:29,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 02:42:29,017 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) Word has length 51 [2022-04-15 02:42:29,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:42:29,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-15 02:42:29,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:29,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 02:42:29,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:42:29,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 02:42:29,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 02:42:29,066 INFO L87 Difference]: Start difference. First operand 74 states and 101 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-15 02:42:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:29,575 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2022-04-15 02:42:29,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 02:42:29,575 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) Word has length 51 [2022-04-15 02:42:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:42:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-15 02:42:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-04-15 02:42:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-15 02:42:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-04-15 02:42:29,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2022-04-15 02:42:29,667 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-15 02:42:29,669 INFO L225 Difference]: With dead ends: 98 [2022-04-15 02:42:29,669 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 02:42:29,670 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-15 02:42:29,671 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 32 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 02:42:29,671 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 137 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 02:42:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 02:42:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 02:42:29,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:42:29,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 02:42:29,763 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 02:42:29,763 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 02:42:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:29,766 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-15 02:42:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-04-15 02:42:29,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:29,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:29,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 65 states. [2022-04-15 02:42:29,767 INFO L87 Difference]: Start difference. First operand has 65 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 65 states. [2022-04-15 02:42:29,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:29,770 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-15 02:42:29,770 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-04-15 02:42:29,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:29,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:29,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:42:29,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:42:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 02:42:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-04-15 02:42:29,774 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 51 [2022-04-15 02:42:29,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:42:29,774 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-04-15 02:42:29,774 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-15 02:42:29,774 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-04-15 02:42:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 02:42:29,775 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:42:29,775 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1] [2022-04-15 02:42:29,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 02:42:29,991 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-15 02:42:29,992 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:42:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:42:29,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1046589490, now seen corresponding path program 1 times [2022-04-15 02:42:29,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:42:29,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279177017] [2022-04-15 02:42:29,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:29,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:42:30,007 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:42:30,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141786232] [2022-04-15 02:42:30,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:30,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:42:30,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:42:30,009 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:42:30,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 02:42:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:30,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 02:42:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:30,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:42:30,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {2780#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {2780#true} is VALID [2022-04-15 02:42:30,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2780#true} {2780#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {2780#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2780#true} is VALID [2022-04-15 02:42:30,232 INFO L272 TraceCheckUtils]: 6: Hoare triple {2780#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2780#true} is VALID [2022-04-15 02:42:30,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {2780#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2780#true} is VALID [2022-04-15 02:42:30,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {2780#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {2780#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,233 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2780#true} {2780#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2780#true} is VALID [2022-04-15 02:42:30,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {2780#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {2780#true} is VALID [2022-04-15 02:42:30,233 INFO L272 TraceCheckUtils]: 12: Hoare triple {2780#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2780#true} is VALID [2022-04-15 02:42:30,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {2780#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2780#true} is VALID [2022-04-15 02:42:30,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {2780#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {2780#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,233 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2780#true} {2780#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2780#true} is VALID [2022-04-15 02:42:30,233 INFO L272 TraceCheckUtils]: 17: Hoare triple {2780#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2780#true} is VALID [2022-04-15 02:42:30,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {2780#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2780#true} is VALID [2022-04-15 02:42:30,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {2780#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {2780#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,234 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2780#true} {2780#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2780#true} is VALID [2022-04-15 02:42:30,234 INFO L272 TraceCheckUtils]: 22: Hoare triple {2780#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2780#true} is VALID [2022-04-15 02:42:30,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {2780#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2780#true} is VALID [2022-04-15 02:42:30,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {2780#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {2780#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,234 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2780#true} {2780#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2780#true} is VALID [2022-04-15 02:42:30,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {2780#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2780#true} is VALID [2022-04-15 02:42:30,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {2780#true} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,235 INFO L272 TraceCheckUtils]: 29: Hoare triple {2780#true} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2780#true} is VALID [2022-04-15 02:42:30,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {2780#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2780#true} is VALID [2022-04-15 02:42:30,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {2780#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {2780#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,235 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2780#true} {2780#true} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2780#true} is VALID [2022-04-15 02:42:30,235 INFO L272 TraceCheckUtils]: 34: Hoare triple {2780#true} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2780#true} is VALID [2022-04-15 02:42:30,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {2780#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2890#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:42:30,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {2890#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2894#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:42:30,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {2894#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2894#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:42:30,238 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2894#(not (= |__VERIFIER_assert_#in~cond| 0))} {2780#true} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2901#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:42:30,239 INFO L272 TraceCheckUtils]: 39: Hoare triple {2901#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2780#true} is VALID [2022-04-15 02:42:30,239 INFO L290 TraceCheckUtils]: 40: Hoare triple {2780#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2780#true} is VALID [2022-04-15 02:42:30,239 INFO L290 TraceCheckUtils]: 41: Hoare triple {2780#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {2780#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,239 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2780#true} {2901#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2901#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:42:30,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {2901#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [123] L38-->L35-2: Formula: (= v_main_~a~0_9 v_main_~b~0_11) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {2920#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:42:30,240 INFO L272 TraceCheckUtils]: 45: Hoare triple {2920#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [110] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2780#true} is VALID [2022-04-15 02:42:30,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {2780#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2780#true} is VALID [2022-04-15 02:42:30,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {2780#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {2780#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:30,241 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2780#true} {2920#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [137] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2920#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:42:30,241 INFO L272 TraceCheckUtils]: 50: Hoare triple {2920#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [112] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* (- 1) v_main_~b~0_14) (* v_main_~p~0_12 v_main_~x~0_15) (* v_main_~r~0_12 v_main_~y~0_14)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_15, main_~b~0=v_main_~b~0_14, main_~p~0=v_main_~p~0_12, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0] {2939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:42:30,242 INFO L290 TraceCheckUtils]: 51: Hoare triple {2939#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:42:30,242 INFO L290 TraceCheckUtils]: 52: Hoare triple {2943#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2781#false} is VALID [2022-04-15 02:42:30,242 INFO L290 TraceCheckUtils]: 53: Hoare triple {2781#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2781#false} is VALID [2022-04-15 02:42:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-15 02:42:30,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:42:42,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {2781#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2781#false} is VALID [2022-04-15 02:42:42,899 INFO L290 TraceCheckUtils]: 52: Hoare triple {2943#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2781#false} is VALID [2022-04-15 02:42:42,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {2939#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:42:42,901 INFO L272 TraceCheckUtils]: 50: Hoare triple {2920#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [112] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* (- 1) v_main_~b~0_14) (* v_main_~p~0_12 v_main_~x~0_15) (* v_main_~r~0_12 v_main_~y~0_14)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_15, main_~b~0=v_main_~b~0_14, main_~p~0=v_main_~p~0_12, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0] {2939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:42:42,901 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2780#true} {2920#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [137] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2920#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:42:42,902 INFO L290 TraceCheckUtils]: 48: Hoare triple {2780#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,902 INFO L290 TraceCheckUtils]: 47: Hoare triple {2780#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,902 INFO L290 TraceCheckUtils]: 46: Hoare triple {2780#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2780#true} is VALID [2022-04-15 02:42:42,902 INFO L272 TraceCheckUtils]: 45: Hoare triple {2920#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [110] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2780#true} is VALID [2022-04-15 02:42:42,902 INFO L290 TraceCheckUtils]: 44: Hoare triple {2901#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [123] L38-->L35-2: Formula: (= v_main_~a~0_9 v_main_~b~0_11) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {2920#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:42:42,903 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2780#true} {2901#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2901#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:42:42,903 INFO L290 TraceCheckUtils]: 42: Hoare triple {2780#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {2780#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {2780#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2780#true} is VALID [2022-04-15 02:42:42,904 INFO L272 TraceCheckUtils]: 39: Hoare triple {2901#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2780#true} is VALID [2022-04-15 02:42:42,905 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2894#(not (= |__VERIFIER_assert_#in~cond| 0))} {2780#true} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2901#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:42:42,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {2894#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2894#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:42:42,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {3004#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2894#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:42:42,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {2780#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3004#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 02:42:42,906 INFO L272 TraceCheckUtils]: 34: Hoare triple {2780#true} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2780#true} is VALID [2022-04-15 02:42:42,906 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2780#true} {2780#true} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2780#true} is VALID [2022-04-15 02:42:42,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {2780#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {2780#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {2780#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2780#true} is VALID [2022-04-15 02:42:42,907 INFO L272 TraceCheckUtils]: 29: Hoare triple {2780#true} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2780#true} is VALID [2022-04-15 02:42:42,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {2780#true} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {2780#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2780#true} is VALID [2022-04-15 02:42:42,907 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2780#true} {2780#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2780#true} is VALID [2022-04-15 02:42:42,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {2780#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {2780#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {2780#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2780#true} is VALID [2022-04-15 02:42:42,907 INFO L272 TraceCheckUtils]: 22: Hoare triple {2780#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2780#true} is VALID [2022-04-15 02:42:42,908 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2780#true} {2780#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2780#true} is VALID [2022-04-15 02:42:42,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {2780#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {2780#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {2780#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2780#true} is VALID [2022-04-15 02:42:42,908 INFO L272 TraceCheckUtils]: 17: Hoare triple {2780#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2780#true} is VALID [2022-04-15 02:42:42,908 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2780#true} {2780#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2780#true} is VALID [2022-04-15 02:42:42,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {2780#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {2780#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {2780#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2780#true} is VALID [2022-04-15 02:42:42,908 INFO L272 TraceCheckUtils]: 12: Hoare triple {2780#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2780#true} is VALID [2022-04-15 02:42:42,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {2780#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {2780#true} is VALID [2022-04-15 02:42:42,909 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2780#true} {2780#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2780#true} is VALID [2022-04-15 02:42:42,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {2780#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {2780#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {2780#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2780#true} is VALID [2022-04-15 02:42:42,909 INFO L272 TraceCheckUtils]: 6: Hoare triple {2780#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2780#true} is VALID [2022-04-15 02:42:42,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {2780#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2780#true} is VALID [2022-04-15 02:42:42,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2780#true} {2780#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {2780#true} is VALID [2022-04-15 02:42:42,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {2780#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2780#true} is VALID [2022-04-15 02:42:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-15 02:42:42,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:42:42,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279177017] [2022-04-15 02:42:42,910 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:42:42,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141786232] [2022-04-15 02:42:42,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141786232] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:42:42,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 02:42:42,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-15 02:42:42,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566026932] [2022-04-15 02:42:42,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 02:42:42,911 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-15 02:42:42,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:42:42,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 02:42:42,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:42,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 02:42:42,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:42:42,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 02:42:42,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 02:42:42,940 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 02:42:43,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:43,619 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-15 02:42:43,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 02:42:43,619 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-15 02:42:43,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:42:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 02:42:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-15 02:42:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 02:42:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-15 02:42:43,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-04-15 02:42:43,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:43,675 INFO L225 Difference]: With dead ends: 74 [2022-04-15 02:42:43,676 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 02:42:43,676 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 02:42:43,677 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 02:42:43,677 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 109 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 02:42:43,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 02:42:43,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-15 02:42:43,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:42:43,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 02:42:43,748 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 02:42:43,749 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 02:42:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:43,751 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2022-04-15 02:42:43,751 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2022-04-15 02:42:43,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:43,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:43,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 70 states. [2022-04-15 02:42:43,752 INFO L87 Difference]: Start difference. First operand has 70 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 70 states. [2022-04-15 02:42:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:43,755 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2022-04-15 02:42:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2022-04-15 02:42:43,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:43,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:43,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:42:43,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:42:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 02:42:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2022-04-15 02:42:43,758 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 54 [2022-04-15 02:42:43,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:42:43,759 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2022-04-15 02:42:43,759 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 02:42:43,759 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2022-04-15 02:42:43,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 02:42:43,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:42:43,760 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 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] [2022-04-15 02:42:43,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 02:42:43,975 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-15 02:42:43,975 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:42:43,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:42:43,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1746772058, now seen corresponding path program 1 times [2022-04-15 02:42:43,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:42:43,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151257385] [2022-04-15 02:42:43,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:43,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:42:43,996 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:42:43,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1228534080] [2022-04-15 02:42:43,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:43,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:42:43,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:42:43,998 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:42:44,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 02:42:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:44,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 02:42:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:44,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:42:44,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {3478#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:44,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {3478#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {3478#true} is VALID [2022-04-15 02:42:44,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {3478#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:44,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3478#true} {3478#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:44,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {3478#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:44,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {3478#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3478#true} is VALID [2022-04-15 02:42:44,502 INFO L272 TraceCheckUtils]: 6: Hoare triple {3478#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3478#true} is VALID [2022-04-15 02:42:44,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {3478#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3478#true} is VALID [2022-04-15 02:42:44,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {3478#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:44,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {3478#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:44,502 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3478#true} {3478#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3478#true} is VALID [2022-04-15 02:42:44,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {3478#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {3478#true} is VALID [2022-04-15 02:42:44,503 INFO L272 TraceCheckUtils]: 12: Hoare triple {3478#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3478#true} is VALID [2022-04-15 02:42:44,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {3478#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3522#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:42:44,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {3522#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3526#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:44,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {3526#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3526#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:44,504 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3526#(not (= |assume_abort_if_not_#in~cond| 0))} {3478#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3533#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 02:42:44,504 INFO L272 TraceCheckUtils]: 17: Hoare triple {3533#(and (<= 0 main_~y~0) (<= main_~y~0 1))} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3478#true} is VALID [2022-04-15 02:42:44,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {3478#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3522#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:42:44,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {3522#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3526#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:44,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {3526#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3526#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:44,506 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3526#(not (= |assume_abort_if_not_#in~cond| 0))} {3533#(and (<= 0 main_~y~0) (<= main_~y~0 1))} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3549#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 1))} is VALID [2022-04-15 02:42:44,506 INFO L272 TraceCheckUtils]: 22: Hoare triple {3549#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 1))} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3478#true} is VALID [2022-04-15 02:42:44,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {3478#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3478#true} is VALID [2022-04-15 02:42:44,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {3478#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:44,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {3478#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:44,507 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3478#true} {3549#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 1))} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3549#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 1))} is VALID [2022-04-15 02:42:44,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {3549#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 1))} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3568#(and (<= main_~b~0 1) (<= 1 main_~a~0))} is VALID [2022-04-15 02:42:44,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {3568#(and (<= main_~b~0 1) (<= 1 main_~a~0))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3568#(and (<= main_~b~0 1) (<= 1 main_~a~0))} is VALID [2022-04-15 02:42:44,508 INFO L272 TraceCheckUtils]: 29: Hoare triple {3568#(and (<= main_~b~0 1) (<= 1 main_~a~0))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3478#true} is VALID [2022-04-15 02:42:44,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {3478#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3478#true} is VALID [2022-04-15 02:42:44,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {3478#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:44,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {3478#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:44,508 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3478#true} {3568#(and (<= main_~b~0 1) (<= 1 main_~a~0))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3568#(and (<= main_~b~0 1) (<= 1 main_~a~0))} is VALID [2022-04-15 02:42:44,508 INFO L272 TraceCheckUtils]: 34: Hoare triple {3568#(and (<= main_~b~0 1) (<= 1 main_~a~0))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3478#true} is VALID [2022-04-15 02:42:44,509 INFO L290 TraceCheckUtils]: 35: Hoare triple {3478#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3478#true} is VALID [2022-04-15 02:42:44,509 INFO L290 TraceCheckUtils]: 36: Hoare triple {3478#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:44,509 INFO L290 TraceCheckUtils]: 37: Hoare triple {3478#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:44,509 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3478#true} {3568#(and (<= main_~b~0 1) (<= 1 main_~a~0))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3568#(and (<= main_~b~0 1) (<= 1 main_~a~0))} is VALID [2022-04-15 02:42:44,509 INFO L272 TraceCheckUtils]: 39: Hoare triple {3568#(and (<= main_~b~0 1) (<= 1 main_~a~0))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3478#true} is VALID [2022-04-15 02:42:44,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {3478#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3478#true} is VALID [2022-04-15 02:42:44,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {3478#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:44,511 INFO L290 TraceCheckUtils]: 42: Hoare triple {3478#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:44,512 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3478#true} {3568#(and (<= main_~b~0 1) (<= 1 main_~a~0))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3568#(and (<= main_~b~0 1) (<= 1 main_~a~0))} is VALID [2022-04-15 02:42:44,513 INFO L290 TraceCheckUtils]: 44: Hoare triple {3568#(and (<= main_~b~0 1) (<= 1 main_~a~0))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {3620#(and (<= main_~b~0 1) (<= 1 main_~a~0) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-15 02:42:44,513 INFO L290 TraceCheckUtils]: 45: Hoare triple {3620#(and (<= main_~b~0 1) (<= 1 main_~a~0) (not (= main_~b~0 main_~a~0)))} [127] L43-->L43-2: Formula: (and (not (< v_main_~b~0_4 v_main_~a~0_4)) (= v_main_~b~0_3 (+ v_main_~b~0_4 (* (- 1) v_main_~a~0_4))) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {3479#false} is VALID [2022-04-15 02:42:44,513 INFO L290 TraceCheckUtils]: 46: Hoare triple {3479#false} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-15 02:42:44,514 INFO L272 TraceCheckUtils]: 47: Hoare triple {3479#false} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3479#false} is VALID [2022-04-15 02:42:44,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {3479#false} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3479#false} is VALID [2022-04-15 02:42:44,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {3479#false} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-15 02:42:44,514 INFO L290 TraceCheckUtils]: 50: Hoare triple {3479#false} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-15 02:42:44,514 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3479#false} {3479#false} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3479#false} is VALID [2022-04-15 02:42:44,514 INFO L272 TraceCheckUtils]: 52: Hoare triple {3479#false} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3479#false} is VALID [2022-04-15 02:42:44,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {3479#false} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3479#false} is VALID [2022-04-15 02:42:44,514 INFO L290 TraceCheckUtils]: 54: Hoare triple {3479#false} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-15 02:42:44,514 INFO L290 TraceCheckUtils]: 55: Hoare triple {3479#false} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-15 02:42:44,514 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3479#false} {3479#false} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3479#false} is VALID [2022-04-15 02:42:44,514 INFO L272 TraceCheckUtils]: 57: Hoare triple {3479#false} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3479#false} is VALID [2022-04-15 02:42:44,515 INFO L290 TraceCheckUtils]: 58: Hoare triple {3479#false} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3479#false} is VALID [2022-04-15 02:42:44,515 INFO L290 TraceCheckUtils]: 59: Hoare triple {3479#false} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-15 02:42:44,515 INFO L290 TraceCheckUtils]: 60: Hoare triple {3479#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-15 02:42:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-15 02:42:44,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:42:45,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {3479#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-15 02:42:45,070 INFO L290 TraceCheckUtils]: 59: Hoare triple {3479#false} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-15 02:42:45,070 INFO L290 TraceCheckUtils]: 58: Hoare triple {3479#false} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3479#false} is VALID [2022-04-15 02:42:45,070 INFO L272 TraceCheckUtils]: 57: Hoare triple {3479#false} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3479#false} is VALID [2022-04-15 02:42:45,070 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3478#true} {3479#false} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3479#false} is VALID [2022-04-15 02:42:45,070 INFO L290 TraceCheckUtils]: 55: Hoare triple {3478#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {3478#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,071 INFO L290 TraceCheckUtils]: 53: Hoare triple {3478#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3478#true} is VALID [2022-04-15 02:42:45,071 INFO L272 TraceCheckUtils]: 52: Hoare triple {3479#false} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3478#true} is VALID [2022-04-15 02:42:45,071 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3478#true} {3479#false} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3479#false} is VALID [2022-04-15 02:42:45,071 INFO L290 TraceCheckUtils]: 50: Hoare triple {3478#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,071 INFO L290 TraceCheckUtils]: 49: Hoare triple {3478#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,071 INFO L290 TraceCheckUtils]: 48: Hoare triple {3478#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3478#true} is VALID [2022-04-15 02:42:45,071 INFO L272 TraceCheckUtils]: 47: Hoare triple {3479#false} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3478#true} is VALID [2022-04-15 02:42:45,071 INFO L290 TraceCheckUtils]: 46: Hoare triple {3479#false} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-15 02:42:45,072 INFO L290 TraceCheckUtils]: 45: Hoare triple {3714#(< main_~b~0 main_~a~0)} [127] L43-->L43-2: Formula: (and (not (< v_main_~b~0_4 v_main_~a~0_4)) (= v_main_~b~0_3 (+ v_main_~b~0_4 (* (- 1) v_main_~a~0_4))) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {3479#false} is VALID [2022-04-15 02:42:45,072 INFO L290 TraceCheckUtils]: 44: Hoare triple {3718#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {3714#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 02:42:45,073 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3478#true} {3718#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3718#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-15 02:42:45,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {3478#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,073 INFO L290 TraceCheckUtils]: 41: Hoare triple {3478#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {3478#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3478#true} is VALID [2022-04-15 02:42:45,073 INFO L272 TraceCheckUtils]: 39: Hoare triple {3718#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3478#true} is VALID [2022-04-15 02:42:45,074 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3478#true} {3718#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3718#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-15 02:42:45,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {3478#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {3478#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {3478#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3478#true} is VALID [2022-04-15 02:42:45,075 INFO L272 TraceCheckUtils]: 34: Hoare triple {3718#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3478#true} is VALID [2022-04-15 02:42:45,075 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3478#true} {3718#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3718#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-15 02:42:45,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {3478#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {3478#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {3478#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3478#true} is VALID [2022-04-15 02:42:45,076 INFO L272 TraceCheckUtils]: 29: Hoare triple {3718#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3478#true} is VALID [2022-04-15 02:42:45,076 INFO L290 TraceCheckUtils]: 28: Hoare triple {3718#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3718#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-15 02:42:45,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {3770#(<= main_~y~0 main_~x~0)} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3718#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-15 02:42:45,078 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3478#true} {3770#(<= main_~y~0 main_~x~0)} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3770#(<= main_~y~0 main_~x~0)} is VALID [2022-04-15 02:42:45,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {3478#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {3478#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {3478#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3478#true} is VALID [2022-04-15 02:42:45,078 INFO L272 TraceCheckUtils]: 22: Hoare triple {3770#(<= main_~y~0 main_~x~0)} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3478#true} is VALID [2022-04-15 02:42:45,079 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3526#(not (= |assume_abort_if_not_#in~cond| 0))} {3789#(<= main_~y~0 1)} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3770#(<= main_~y~0 main_~x~0)} is VALID [2022-04-15 02:42:45,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {3526#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3526#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:45,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {3799#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3526#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:45,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {3478#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3799#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 02:42:45,080 INFO L272 TraceCheckUtils]: 17: Hoare triple {3789#(<= main_~y~0 1)} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3478#true} is VALID [2022-04-15 02:42:45,081 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3526#(not (= |assume_abort_if_not_#in~cond| 0))} {3478#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3789#(<= main_~y~0 1)} is VALID [2022-04-15 02:42:45,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {3526#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3526#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:45,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {3799#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3526#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:45,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {3478#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3799#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 02:42:45,082 INFO L272 TraceCheckUtils]: 12: Hoare triple {3478#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 1) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3478#true} is VALID [2022-04-15 02:42:45,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {3478#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {3478#true} is VALID [2022-04-15 02:42:45,082 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3478#true} {3478#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3478#true} is VALID [2022-04-15 02:42:45,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {3478#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {3478#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {3478#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3478#true} is VALID [2022-04-15 02:42:45,083 INFO L272 TraceCheckUtils]: 6: Hoare triple {3478#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~x~0_11 1) (<= 0 v_main_~x~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3478#true} is VALID [2022-04-15 02:42:45,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {3478#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3478#true} is VALID [2022-04-15 02:42:45,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {3478#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3478#true} {3478#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {3478#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {3478#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {3478#true} is VALID [2022-04-15 02:42:45,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {3478#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-15 02:42:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-15 02:42:45,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:42:45,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151257385] [2022-04-15 02:42:45,084 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:42:45,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228534080] [2022-04-15 02:42:45,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228534080] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:42:45,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 02:42:45,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-04-15 02:42:45,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752255383] [2022-04-15 02:42:45,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 02:42:45,085 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 8 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 61 [2022-04-15 02:42:45,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:42:45,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 8 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 02:42:45,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:45,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 02:42:45,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:42:45,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 02:42:45,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-15 02:42:45,137 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 13 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 8 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 02:42:45,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:45,439 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2022-04-15 02:42:45,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 02:42:45,440 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 8 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 61 [2022-04-15 02:42:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:42:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 8 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 02:42:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-15 02:42:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 8 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 02:42:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-15 02:42:45,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-15 02:42:45,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:45,494 INFO L225 Difference]: With dead ends: 78 [2022-04-15 02:42:45,494 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 02:42:45,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-15 02:42:45,497 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 02:42:45,497 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 123 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 02:42:45,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 02:42:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 02:42:45,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:42:45,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 02:42:45,498 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 02:42:45,498 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 02:42:45,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:45,498 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 02:42:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 02:42:45,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:45,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:45,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 02:42:45,499 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 02:42:45,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:45,499 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 02:42:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 02:42:45,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:45,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:45,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:42:45,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:42:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 02:42:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 02:42:45,499 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2022-04-15 02:42:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:42:45,500 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 02:42:45,500 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 8 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 02:42:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 02:42:45,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:45,504 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 02:42:45,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 02:42:45,704 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-15 02:42:45,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 02:42:46,173 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 02:42:46,173 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 02:42:46,173 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 02:42:46,173 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 02:42:46,173 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 02:42:46,173 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 02:42:46,173 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 02:42:46,174 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-04-15 02:42:46,174 INFO L882 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-15 02:42:46,174 INFO L882 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2022-04-15 02:42:46,174 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-04-15 02:42:46,174 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 18 59) the Hoare annotation is: true [2022-04-15 02:42:46,174 INFO L885 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2022-04-15 02:42:46,174 INFO L882 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-04-15 02:42:46,174 INFO L878 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 1)) [2022-04-15 02:42:46,174 INFO L878 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1)) [2022-04-15 02:42:46,174 INFO L878 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1)) [2022-04-15 02:42:46,174 INFO L882 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-15 02:42:46,174 INFO L878 garLoopResultBuilder]: At program point L43-2(lines 35 52) the Hoare annotation is: (and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 1) (<= 1 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1)) [2022-04-15 02:42:46,174 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 35 52) the Hoare annotation is: (and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1)) [2022-04-15 02:42:46,175 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 1) (<= 1 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1)) [2022-04-15 02:42:46,175 INFO L878 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1)) [2022-04-15 02:42:46,175 INFO L878 garLoopResultBuilder]: At program point L36-1(line 36) the Hoare annotation is: (and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 1) (<= 1 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1)) [2022-04-15 02:42:46,175 INFO L878 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1)) [2022-04-15 02:42:46,175 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 1) (<= 1 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1)) [2022-04-15 02:42:46,175 INFO L878 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1)) [2022-04-15 02:42:46,175 INFO L882 garLoopResultBuilder]: For program point L38(lines 35 52) no Hoare annotation was computed. [2022-04-15 02:42:46,175 INFO L882 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2022-04-15 02:42:46,175 INFO L882 garLoopResultBuilder]: For program point L43(lines 43 51) no Hoare annotation was computed. [2022-04-15 02:42:46,175 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 18 59) no Hoare annotation was computed. [2022-04-15 02:42:46,175 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 18 59) no Hoare annotation was computed. [2022-04-15 02:42:46,175 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 16) the Hoare annotation is: true [2022-04-15 02:42:46,175 INFO L882 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2022-04-15 02:42:46,175 INFO L882 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2022-04-15 02:42:46,175 INFO L882 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2022-04-15 02:42:46,176 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-04-15 02:42:46,176 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2022-04-15 02:42:46,178 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:42:46,180 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 02:42:46,184 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 02:42:46,184 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 02:42:46,184 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 02:42:46,184 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 02:42:46,184 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 02:42:46,184 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 02:42:46,184 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 02:42:46,184 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 02:42:46,184 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 02:42:46,184 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-15 02:42:46,184 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 02:42:46,184 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 02:42:46,184 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-15 02:42:46,184 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 02:42:46,185 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 02:42:46,185 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 02:42:46,185 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 02:42:46,185 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:42:46,185 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:42:46,185 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:42:46,185 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:42:46,185 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:42:46,185 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:42:46,185 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:42:46,185 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-04-15 02:42:46,185 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 02:42:46,185 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 02:42:46,185 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 02:42:46,185 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-15 02:42:46,190 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-15 02:42:46,190 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-15 02:42:46,190 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 02:42:46,190 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 02:42:46,190 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 02:42:46,191 INFO L163 areAnnotationChecker]: CFG has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 02:42:46,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:42:46 BasicIcfg [2022-04-15 02:42:46,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 02:42:46,202 INFO L158 Benchmark]: Toolchain (without parser) took 85245.11ms. Allocated memory was 175.1MB in the beginning and 246.4MB in the end (delta: 71.3MB). Free memory was 121.8MB in the beginning and 211.5MB in the end (delta: -89.7MB). Peak memory consumption was 115.1MB. Max. memory is 8.0GB. [2022-04-15 02:42:46,203 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 175.1MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 02:42:46,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.31ms. Allocated memory was 175.1MB in the beginning and 246.4MB in the end (delta: 71.3MB). Free memory was 121.7MB in the beginning and 222.2MB in the end (delta: -100.5MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2022-04-15 02:42:46,203 INFO L158 Benchmark]: Boogie Preprocessor took 45.24ms. Allocated memory is still 246.4MB. Free memory was 222.2MB in the beginning and 220.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 02:42:46,203 INFO L158 Benchmark]: RCFGBuilder took 331.56ms. Allocated memory is still 246.4MB. Free memory was 220.7MB in the beginning and 208.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 02:42:46,203 INFO L158 Benchmark]: IcfgTransformer took 72.19ms. Allocated memory is still 246.4MB. Free memory was 208.1MB in the beginning and 206.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 02:42:46,205 INFO L158 Benchmark]: TraceAbstraction took 84508.74ms. Allocated memory is still 246.4MB. Free memory was 206.0MB in the beginning and 211.5MB in the end (delta: -5.5MB). Peak memory consumption was 128.2MB. Max. memory is 8.0GB. [2022-04-15 02:42:46,208 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 175.1MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.31ms. Allocated memory was 175.1MB in the beginning and 246.4MB in the end (delta: 71.3MB). Free memory was 121.7MB in the beginning and 222.2MB in the end (delta: -100.5MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.24ms. Allocated memory is still 246.4MB. Free memory was 222.2MB in the beginning and 220.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 331.56ms. Allocated memory is still 246.4MB. Free memory was 220.7MB in the beginning and 208.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 72.19ms. Allocated memory is still 246.4MB. Free memory was 208.1MB in the beginning and 206.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 84508.74ms. Allocated memory is still 246.4MB. Free memory was 206.0MB in the beginning and 211.5MB in the end (delta: -5.5MB). Peak memory consumption was 128.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 84.4s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 1038 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 751 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 649 IncrementalHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 287 mSDtfsCounter, 649 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 529 GetRequests, 461 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=5, 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.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 65 PreInvPairs, 76 NumberOfFragments, 321 HoareAnnotationTreeSize, 65 FomulaSimplifications, 33 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FomulaSimplificationsInter, 120 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 76.8s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 517 ConstructedInterpolants, 0 QuantifiedInterpolants, 1120 SizeOfPredicates, 23 NumberOfNonLiveVariables, 919 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 454/504 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: 35]: Loop Invariant Derived loop invariant: ((((((((s == 1 && a == y * r + p * x) && x <= 1) && 1 <= a) && b == y) && q == 0) && 1 <= y) && a == x) && y <= 1) && p == 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 02:42:46,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...