/usr/bin/java -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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/systemc/bist_cell.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 18:26:19,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 18:26:19,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 18:26:19,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 18:26:19,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 18:26:19,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 18:26:19,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 18:26:19,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 18:26:19,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 18:26:19,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 18:26:19,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 18:26:19,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 18:26:19,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 18:26:19,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 18:26:19,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 18:26:19,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 18:26:19,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 18:26:19,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 18:26:19,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 18:26:19,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 18:26:19,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 18:26:19,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 18:26:19,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 18:26:19,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 18:26:19,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 18:26:19,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 18:26:19,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 18:26:19,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 18:26:19,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 18:26:19,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 18:26:19,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 18:26:19,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 18:26:19,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 18:26:19,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 18:26:19,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 18:26:19,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 18:26:19,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 18:26:19,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 18:26:19,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 18:26:19,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 18:26:19,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 18:26:19,356 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 18:26:19,368 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 18:26:19,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 18:26:19,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 18:26:19,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 18:26:19,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 18:26:19,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 18:26:19,369 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 18:26:19,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 18:26:19,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 18:26:19,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 18:26:19,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 18:26:19,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 18:26:19,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 18:26:19,370 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 18:26:19,370 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 18:26:19,370 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 18:26:19,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 18:26:19,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 18:26:19,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 18:26:19,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 18:26:19,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 18:26:19,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 18:26:19,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 18:26:19,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 18:26:19,372 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 18:26:19,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 18:26:19,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 18:26:19,372 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 18:26:19,372 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 18:26:19,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 18:26:19,372 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 18:26:19,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 18:26:19,373 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 18:26:19,373 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY 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-01-10 18:26:19,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 18:26:19,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 18:26:19,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 18:26:19,515 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 18:26:19,515 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 18:26:19,516 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/bist_cell.cil.c [2022-01-10 18:26:19,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6210016/3b071ad11e3342779ae662595baa6c01/FLAGa68475c07 [2022-01-10 18:26:19,969 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 18:26:19,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c [2022-01-10 18:26:19,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6210016/3b071ad11e3342779ae662595baa6c01/FLAGa68475c07 [2022-01-10 18:26:20,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6210016/3b071ad11e3342779ae662595baa6c01 [2022-01-10 18:26:20,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 18:26:20,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 18:26:20,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 18:26:20,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 18:26:20,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 18:26:20,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:26:20" (1/1) ... [2022-01-10 18:26:20,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f018c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:20, skipping insertion in model container [2022-01-10 18:26:20,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:26:20" (1/1) ... [2022-01-10 18:26:20,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 18:26:20,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 18:26:20,478 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c[639,652] [2022-01-10 18:26:20,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 18:26:20,568 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 18:26:20,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c[639,652] [2022-01-10 18:26:20,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 18:26:20,618 INFO L208 MainTranslator]: Completed translation [2022-01-10 18:26:20,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:20 WrapperNode [2022-01-10 18:26:20,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 18:26:20,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 18:26:20,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 18:26:20,620 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 18:26:20,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:20" (1/1) ... [2022-01-10 18:26:20,637 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:20" (1/1) ... [2022-01-10 18:26:20,665 INFO L137 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 25, calls inlined = 31, statements flattened = 344 [2022-01-10 18:26:20,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 18:26:20,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 18:26:20,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 18:26:20,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 18:26:20,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:20" (1/1) ... [2022-01-10 18:26:20,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:20" (1/1) ... [2022-01-10 18:26:20,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:20" (1/1) ... [2022-01-10 18:26:20,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:20" (1/1) ... [2022-01-10 18:26:20,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:20" (1/1) ... [2022-01-10 18:26:20,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:20" (1/1) ... [2022-01-10 18:26:20,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:20" (1/1) ... [2022-01-10 18:26:20,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 18:26:20,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 18:26:20,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 18:26:20,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 18:26:20,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:20" (1/1) ... [2022-01-10 18:26:20,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 18:26:20,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 18:26:20,740 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-01-10 18:26:20,761 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-01-10 18:26:20,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 18:26:20,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 18:26:20,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 18:26:20,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 18:26:20,838 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 18:26:20,839 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 18:26:21,101 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 18:26:21,107 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 18:26:21,108 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 18:26:21,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:26:21 BoogieIcfgContainer [2022-01-10 18:26:21,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 18:26:21,110 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 18:26:21,110 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 18:26:21,111 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 18:26:21,113 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:26:21" (1/1) ... [2022-01-10 18:26:21,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 06:26:21 BasicIcfg [2022-01-10 18:26:21,218 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 18:26:21,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 18:26:21,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 18:26:21,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 18:26:21,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:26:20" (1/4) ... [2022-01-10 18:26:21,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471648b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:26:21, skipping insertion in model container [2022-01-10 18:26:21,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:20" (2/4) ... [2022-01-10 18:26:21,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471648b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:26:21, skipping insertion in model container [2022-01-10 18:26:21,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:26:21" (3/4) ... [2022-01-10 18:26:21,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471648b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:26:21, skipping insertion in model container [2022-01-10 18:26:21,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 06:26:21" (4/4) ... [2022-01-10 18:26:21,224 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.cTransformedIcfg [2022-01-10 18:26:21,228 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 18:26:21,228 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 18:26:21,262 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 18:26:21,268 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 18:26:21,268 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 18:26:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.596774193548387) internal successors, (198), 125 states have internal predecessors, (198), 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-01-10 18:26:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 18:26:21,286 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:21,286 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2022-01-10 18:26:21,287 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:21,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:21,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1988259245, now seen corresponding path program 1 times [2022-01-10 18:26:21,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:21,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851031885] [2022-01-10 18:26:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:21,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:21,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:21,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:21,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851031885] [2022-01-10 18:26:21,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851031885] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:21,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:21,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:21,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193100137] [2022-01-10 18:26:21,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:21,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:21,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:21,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:21,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:21,521 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.596774193548387) internal successors, (198), 125 states have internal predecessors, (198), 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 has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-01-10 18:26:21,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:21,578 INFO L93 Difference]: Finished difference Result 244 states and 386 transitions. [2022-01-10 18:26:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:21,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) Word has length 32 [2022-01-10 18:26:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:21,596 INFO L225 Difference]: With dead ends: 244 [2022-01-10 18:26:21,596 INFO L226 Difference]: Without dead ends: 121 [2022-01-10 18:26:21,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:21,602 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 5 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:21,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 369 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-10 18:26:21,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-01-10 18:26:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5583333333333333) internal successors, (187), 120 states have internal predecessors, (187), 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-01-10 18:26:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 187 transitions. [2022-01-10 18:26:21,646 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 187 transitions. Word has length 32 [2022-01-10 18:26:21,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:21,646 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 187 transitions. [2022-01-10 18:26:21,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-01-10 18:26:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 187 transitions. [2022-01-10 18:26:21,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 18:26:21,648 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:21,648 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:21,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 18:26:21,648 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:21,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:21,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1280030136, now seen corresponding path program 1 times [2022-01-10 18:26:21,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:21,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592488706] [2022-01-10 18:26:21,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:21,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:21,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:21,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592488706] [2022-01-10 18:26:21,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592488706] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:21,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:21,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:21,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41638183] [2022-01-10 18:26:21,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:21,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:21,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:21,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:21,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:21,739 INFO L87 Difference]: Start difference. First operand 121 states and 187 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-01-10 18:26:21,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:21,768 INFO L93 Difference]: Finished difference Result 231 states and 360 transitions. [2022-01-10 18:26:21,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:21,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) Word has length 73 [2022-01-10 18:26:21,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:21,773 INFO L225 Difference]: With dead ends: 231 [2022-01-10 18:26:21,773 INFO L226 Difference]: Without dead ends: 121 [2022-01-10 18:26:21,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:21,775 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 6 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:21,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 354 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:21,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-10 18:26:21,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-01-10 18:26:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.55) internal successors, (186), 120 states have internal predecessors, (186), 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-01-10 18:26:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 186 transitions. [2022-01-10 18:26:21,783 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 186 transitions. Word has length 73 [2022-01-10 18:26:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:21,784 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 186 transitions. [2022-01-10 18:26:21,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-01-10 18:26:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 186 transitions. [2022-01-10 18:26:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-10 18:26:21,786 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:21,786 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:21,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 18:26:21,786 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:21,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:21,796 INFO L85 PathProgramCache]: Analyzing trace with hash 938707956, now seen corresponding path program 1 times [2022-01-10 18:26:21,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:21,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928429242] [2022-01-10 18:26:21,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:21,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:21,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:21,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928429242] [2022-01-10 18:26:21,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928429242] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:21,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:21,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:21,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30616776] [2022-01-10 18:26:21,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:21,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:21,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:21,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:21,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:21,926 INFO L87 Difference]: Start difference. First operand 121 states and 186 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-01-10 18:26:21,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:21,952 INFO L93 Difference]: Finished difference Result 233 states and 361 transitions. [2022-01-10 18:26:21,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:21,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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) Word has length 76 [2022-01-10 18:26:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:21,959 INFO L225 Difference]: With dead ends: 233 [2022-01-10 18:26:21,959 INFO L226 Difference]: Without dead ends: 121 [2022-01-10 18:26:21,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:21,961 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 1 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:21,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 355 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:21,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-10 18:26:21,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-01-10 18:26:21,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5416666666666667) internal successors, (185), 120 states have internal predecessors, (185), 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-01-10 18:26:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 185 transitions. [2022-01-10 18:26:21,969 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 185 transitions. Word has length 76 [2022-01-10 18:26:21,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:21,970 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 185 transitions. [2022-01-10 18:26:21,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-01-10 18:26:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 185 transitions. [2022-01-10 18:26:21,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-10 18:26:21,972 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:21,972 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:21,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 18:26:21,972 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:21,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:21,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1685745771, now seen corresponding path program 1 times [2022-01-10 18:26:21,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:21,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498532812] [2022-01-10 18:26:21,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:21,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:22,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:22,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498532812] [2022-01-10 18:26:22,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498532812] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:22,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:22,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:22,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391785972] [2022-01-10 18:26:22,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:22,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:22,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:22,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:22,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:22,028 INFO L87 Difference]: Start difference. First operand 121 states and 185 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-01-10 18:26:22,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:22,041 INFO L93 Difference]: Finished difference Result 227 states and 352 transitions. [2022-01-10 18:26:22,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:22,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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) Word has length 76 [2022-01-10 18:26:22,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:22,043 INFO L225 Difference]: With dead ends: 227 [2022-01-10 18:26:22,043 INFO L226 Difference]: Without dead ends: 121 [2022-01-10 18:26:22,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:22,045 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 6 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:22,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 346 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-10 18:26:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-01-10 18:26:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5333333333333334) internal successors, (184), 120 states have internal predecessors, (184), 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-01-10 18:26:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2022-01-10 18:26:22,053 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 76 [2022-01-10 18:26:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:22,053 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2022-01-10 18:26:22,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-01-10 18:26:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2022-01-10 18:26:22,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-10 18:26:22,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:22,055 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:22,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 18:26:22,056 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash -663957676, now seen corresponding path program 1 times [2022-01-10 18:26:22,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:22,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795846874] [2022-01-10 18:26:22,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:22,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:22,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:22,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:22,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795846874] [2022-01-10 18:26:22,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795846874] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:22,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:22,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:22,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558828324] [2022-01-10 18:26:22,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:22,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:22,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:22,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:22,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:22,099 INFO L87 Difference]: Start difference. First operand 121 states and 184 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-01-10 18:26:22,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:22,109 INFO L93 Difference]: Finished difference Result 223 states and 345 transitions. [2022-01-10 18:26:22,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:22,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) Word has length 79 [2022-01-10 18:26:22,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:22,110 INFO L225 Difference]: With dead ends: 223 [2022-01-10 18:26:22,111 INFO L226 Difference]: Without dead ends: 121 [2022-01-10 18:26:22,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:22,112 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 7 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:22,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 339 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-10 18:26:22,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-01-10 18:26:22,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.525) internal successors, (183), 120 states have internal predecessors, (183), 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-01-10 18:26:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 183 transitions. [2022-01-10 18:26:22,118 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 183 transitions. Word has length 79 [2022-01-10 18:26:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:22,118 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 183 transitions. [2022-01-10 18:26:22,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-01-10 18:26:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 183 transitions. [2022-01-10 18:26:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-10 18:26:22,120 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:22,120 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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-01-10 18:26:22,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 18:26:22,120 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:22,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:22,120 INFO L85 PathProgramCache]: Analyzing trace with hash 864822698, now seen corresponding path program 1 times [2022-01-10 18:26:22,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:22,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556625528] [2022-01-10 18:26:22,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:22,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:22,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:22,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556625528] [2022-01-10 18:26:22,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556625528] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:22,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:22,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:22,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550683056] [2022-01-10 18:26:22,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:22,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:22,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:22,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:22,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:22,188 INFO L87 Difference]: Start difference. First operand 121 states and 183 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-01-10 18:26:22,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:22,200 INFO L93 Difference]: Finished difference Result 217 states and 335 transitions. [2022-01-10 18:26:22,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:22,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) Word has length 82 [2022-01-10 18:26:22,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:22,204 INFO L225 Difference]: With dead ends: 217 [2022-01-10 18:26:22,204 INFO L226 Difference]: Without dead ends: 121 [2022-01-10 18:26:22,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:22,206 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 161 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:22,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 181 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:22,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-10 18:26:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-01-10 18:26:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5166666666666666) internal successors, (182), 120 states have internal predecessors, (182), 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-01-10 18:26:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 182 transitions. [2022-01-10 18:26:22,212 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 182 transitions. Word has length 82 [2022-01-10 18:26:22,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:22,213 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 182 transitions. [2022-01-10 18:26:22,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-01-10 18:26:22,213 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 182 transitions. [2022-01-10 18:26:22,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-10 18:26:22,214 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:22,214 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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-01-10 18:26:22,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 18:26:22,214 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:22,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:22,215 INFO L85 PathProgramCache]: Analyzing trace with hash -301873621, now seen corresponding path program 1 times [2022-01-10 18:26:22,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:22,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754784004] [2022-01-10 18:26:22,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:22,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:22,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:22,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754784004] [2022-01-10 18:26:22,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754784004] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:22,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:22,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:22,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439919829] [2022-01-10 18:26:22,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:22,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:22,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:22,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:22,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:22,273 INFO L87 Difference]: Start difference. First operand 121 states and 182 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-01-10 18:26:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:22,314 INFO L93 Difference]: Finished difference Result 311 states and 479 transitions. [2022-01-10 18:26:22,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:22,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) Word has length 82 [2022-01-10 18:26:22,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:22,317 INFO L225 Difference]: With dead ends: 311 [2022-01-10 18:26:22,317 INFO L226 Difference]: Without dead ends: 221 [2022-01-10 18:26:22,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:22,324 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 149 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:22,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 329 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-01-10 18:26:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2022-01-10 18:26:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.5324074074074074) internal successors, (331), 216 states have internal predecessors, (331), 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-01-10 18:26:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 331 transitions. [2022-01-10 18:26:22,348 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 331 transitions. Word has length 82 [2022-01-10 18:26:22,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:22,348 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 331 transitions. [2022-01-10 18:26:22,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-01-10 18:26:22,348 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 331 transitions. [2022-01-10 18:26:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-10 18:26:22,350 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:22,351 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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-01-10 18:26:22,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 18:26:22,351 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:22,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:22,351 INFO L85 PathProgramCache]: Analyzing trace with hash 740672363, now seen corresponding path program 1 times [2022-01-10 18:26:22,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:22,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018210611] [2022-01-10 18:26:22,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:22,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:22,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:22,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:22,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018210611] [2022-01-10 18:26:22,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018210611] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:22,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:22,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:22,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420320648] [2022-01-10 18:26:22,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:22,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:22,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:22,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:22,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:22,384 INFO L87 Difference]: Start difference. First operand 217 states and 331 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-01-10 18:26:22,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:22,444 INFO L93 Difference]: Finished difference Result 613 states and 947 transitions. [2022-01-10 18:26:22,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:22,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) Word has length 82 [2022-01-10 18:26:22,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:22,446 INFO L225 Difference]: With dead ends: 613 [2022-01-10 18:26:22,446 INFO L226 Difference]: Without dead ends: 429 [2022-01-10 18:26:22,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:22,447 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 152 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:22,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 395 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-01-10 18:26:22,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 425. [2022-01-10 18:26:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.5117924528301887) internal successors, (641), 424 states have internal predecessors, (641), 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-01-10 18:26:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 641 transitions. [2022-01-10 18:26:22,474 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 641 transitions. Word has length 82 [2022-01-10 18:26:22,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:22,474 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 641 transitions. [2022-01-10 18:26:22,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-01-10 18:26:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 641 transitions. [2022-01-10 18:26:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-10 18:26:22,475 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:22,476 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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-01-10 18:26:22,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 18:26:22,476 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:22,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1710253386, now seen corresponding path program 1 times [2022-01-10 18:26:22,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:22,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906037951] [2022-01-10 18:26:22,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:22,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:22,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:22,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906037951] [2022-01-10 18:26:22,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906037951] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:22,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:22,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:22,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791615991] [2022-01-10 18:26:22,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:22,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:22,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:22,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:22,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:22,519 INFO L87 Difference]: Start difference. First operand 425 states and 641 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-01-10 18:26:22,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:22,549 INFO L93 Difference]: Finished difference Result 793 states and 1216 transitions. [2022-01-10 18:26:22,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:22,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) Word has length 82 [2022-01-10 18:26:22,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:22,551 INFO L225 Difference]: With dead ends: 793 [2022-01-10 18:26:22,551 INFO L226 Difference]: Without dead ends: 469 [2022-01-10 18:26:22,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:22,553 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 20 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:22,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 358 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:22,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-01-10 18:26:22,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2022-01-10 18:26:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.5021367521367521) internal successors, (703), 468 states have internal predecessors, (703), 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-01-10 18:26:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 703 transitions. [2022-01-10 18:26:22,566 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 703 transitions. Word has length 82 [2022-01-10 18:26:22,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:22,566 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 703 transitions. [2022-01-10 18:26:22,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-01-10 18:26:22,567 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 703 transitions. [2022-01-10 18:26:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-10 18:26:22,568 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:22,568 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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-01-10 18:26:22,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 18:26:22,568 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:22,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:22,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1215805366, now seen corresponding path program 1 times [2022-01-10 18:26:22,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:22,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400103286] [2022-01-10 18:26:22,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:22,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:22,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:22,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400103286] [2022-01-10 18:26:22,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400103286] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:22,607 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:22,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:22,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270132740] [2022-01-10 18:26:22,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:22,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:22,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:22,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:22,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:22,608 INFO L87 Difference]: Start difference. First operand 469 states and 703 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-01-10 18:26:22,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:22,642 INFO L93 Difference]: Finished difference Result 1105 states and 1681 transitions. [2022-01-10 18:26:22,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:22,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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) Word has length 83 [2022-01-10 18:26:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:22,646 INFO L225 Difference]: With dead ends: 1105 [2022-01-10 18:26:22,646 INFO L226 Difference]: Without dead ends: 795 [2022-01-10 18:26:22,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:22,648 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 106 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:22,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 347 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:22,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-01-10 18:26:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 791. [2022-01-10 18:26:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 1.5037974683544304) internal successors, (1188), 790 states have internal predecessors, (1188), 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-01-10 18:26:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1188 transitions. [2022-01-10 18:26:22,666 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1188 transitions. Word has length 83 [2022-01-10 18:26:22,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:22,667 INFO L470 AbstractCegarLoop]: Abstraction has 791 states and 1188 transitions. [2022-01-10 18:26:22,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-01-10 18:26:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1188 transitions. [2022-01-10 18:26:22,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-10 18:26:22,668 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:22,668 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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-01-10 18:26:22,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 18:26:22,669 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:22,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:22,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2109580907, now seen corresponding path program 1 times [2022-01-10 18:26:22,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:22,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902493985] [2022-01-10 18:26:22,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:22,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:22,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:22,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902493985] [2022-01-10 18:26:22,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902493985] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:22,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:22,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:22,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80874375] [2022-01-10 18:26:22,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:22,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:22,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:22,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:22,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:22,716 INFO L87 Difference]: Start difference. First operand 791 states and 1188 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-01-10 18:26:22,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:22,754 INFO L93 Difference]: Finished difference Result 1607 states and 2427 transitions. [2022-01-10 18:26:22,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:22,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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) Word has length 83 [2022-01-10 18:26:22,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:22,757 INFO L225 Difference]: With dead ends: 1607 [2022-01-10 18:26:22,757 INFO L226 Difference]: Without dead ends: 927 [2022-01-10 18:26:22,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:22,759 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 24 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:22,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 354 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:22,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2022-01-10 18:26:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 927. [2022-01-10 18:26:22,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 926 states have (on average 1.4838012958963283) internal successors, (1374), 926 states have internal predecessors, (1374), 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-01-10 18:26:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1374 transitions. [2022-01-10 18:26:22,788 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1374 transitions. Word has length 83 [2022-01-10 18:26:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:22,789 INFO L470 AbstractCegarLoop]: Abstraction has 927 states and 1374 transitions. [2022-01-10 18:26:22,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-01-10 18:26:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1374 transitions. [2022-01-10 18:26:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-10 18:26:22,791 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:22,791 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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-01-10 18:26:22,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 18:26:22,791 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:22,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1829231018, now seen corresponding path program 1 times [2022-01-10 18:26:22,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:22,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560248034] [2022-01-10 18:26:22,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:22,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:22,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:22,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560248034] [2022-01-10 18:26:22,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560248034] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:22,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:22,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:22,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708707953] [2022-01-10 18:26:22,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:22,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:22,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:22,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:22,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:22,841 INFO L87 Difference]: Start difference. First operand 927 states and 1374 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-01-10 18:26:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:22,869 INFO L93 Difference]: Finished difference Result 1415 states and 2087 transitions. [2022-01-10 18:26:22,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:22,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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) Word has length 83 [2022-01-10 18:26:22,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:22,872 INFO L225 Difference]: With dead ends: 1415 [2022-01-10 18:26:22,872 INFO L226 Difference]: Without dead ends: 599 [2022-01-10 18:26:22,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:22,873 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 31 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:22,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 333 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:22,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-01-10 18:26:22,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2022-01-10 18:26:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.4180602006688963) internal successors, (848), 598 states have internal predecessors, (848), 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-01-10 18:26:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 848 transitions. [2022-01-10 18:26:22,891 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 848 transitions. Word has length 83 [2022-01-10 18:26:22,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:22,891 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 848 transitions. [2022-01-10 18:26:22,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-01-10 18:26:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 848 transitions. [2022-01-10 18:26:22,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-10 18:26:22,893 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:22,893 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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-01-10 18:26:22,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 18:26:22,893 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:22,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:22,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2043514920, now seen corresponding path program 1 times [2022-01-10 18:26:22,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:22,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459518663] [2022-01-10 18:26:22,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:22,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:22,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:22,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459518663] [2022-01-10 18:26:22,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459518663] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:22,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:22,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:22,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629166345] [2022-01-10 18:26:22,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:22,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:22,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:22,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:22,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:22,925 INFO L87 Difference]: Start difference. First operand 599 states and 848 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-01-10 18:26:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:22,955 INFO L93 Difference]: Finished difference Result 939 states and 1329 transitions. [2022-01-10 18:26:22,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:22,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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) Word has length 83 [2022-01-10 18:26:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:22,957 INFO L225 Difference]: With dead ends: 939 [2022-01-10 18:26:22,957 INFO L226 Difference]: Without dead ends: 437 [2022-01-10 18:26:22,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:22,958 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 34 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:22,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 357 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-01-10 18:26:22,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2022-01-10 18:26:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.364678899082569) internal successors, (595), 436 states have internal predecessors, (595), 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-01-10 18:26:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 595 transitions. [2022-01-10 18:26:22,970 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 595 transitions. Word has length 83 [2022-01-10 18:26:22,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:22,971 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 595 transitions. [2022-01-10 18:26:22,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-01-10 18:26:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 595 transitions. [2022-01-10 18:26:22,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 18:26:22,972 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:22,972 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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-01-10 18:26:22,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 18:26:22,972 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:22,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:22,972 INFO L85 PathProgramCache]: Analyzing trace with hash -446645874, now seen corresponding path program 1 times [2022-01-10 18:26:22,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:22,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430359952] [2022-01-10 18:26:22,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:22,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:23,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:23,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430359952] [2022-01-10 18:26:23,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430359952] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:23,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:23,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:23,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41399684] [2022-01-10 18:26:23,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:23,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:23,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:23,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:23,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:23,015 INFO L87 Difference]: Start difference. First operand 437 states and 595 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-01-10 18:26:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:23,060 INFO L93 Difference]: Finished difference Result 1221 states and 1679 transitions. [2022-01-10 18:26:23,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:23,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) Word has length 84 [2022-01-10 18:26:23,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:23,063 INFO L225 Difference]: With dead ends: 1221 [2022-01-10 18:26:23,063 INFO L226 Difference]: Without dead ends: 853 [2022-01-10 18:26:23,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:23,063 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 146 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:23,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 366 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2022-01-10 18:26:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 849. [2022-01-10 18:26:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 848 states have (on average 1.3502358490566038) internal successors, (1145), 848 states have internal predecessors, (1145), 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-01-10 18:26:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1145 transitions. [2022-01-10 18:26:23,098 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1145 transitions. Word has length 84 [2022-01-10 18:26:23,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:23,099 INFO L470 AbstractCegarLoop]: Abstraction has 849 states and 1145 transitions. [2022-01-10 18:26:23,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-01-10 18:26:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1145 transitions. [2022-01-10 18:26:23,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 18:26:23,100 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:23,100 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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-01-10 18:26:23,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 18:26:23,100 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:23,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash 522935149, now seen corresponding path program 1 times [2022-01-10 18:26:23,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:23,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781989844] [2022-01-10 18:26:23,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:23,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:23,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:23,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781989844] [2022-01-10 18:26:23,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781989844] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:23,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:23,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:23,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183906789] [2022-01-10 18:26:23,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:23,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:23,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:23,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:23,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:23,129 INFO L87 Difference]: Start difference. First operand 849 states and 1145 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-01-10 18:26:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:23,162 INFO L93 Difference]: Finished difference Result 1617 states and 2201 transitions. [2022-01-10 18:26:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:23,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) Word has length 84 [2022-01-10 18:26:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:23,164 INFO L225 Difference]: With dead ends: 1617 [2022-01-10 18:26:23,164 INFO L226 Difference]: Without dead ends: 975 [2022-01-10 18:26:23,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:23,167 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 25 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:23,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 344 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2022-01-10 18:26:23,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2022-01-10 18:26:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 974 states have (on average 1.335728952772074) internal successors, (1301), 974 states have internal predecessors, (1301), 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-01-10 18:26:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1301 transitions. [2022-01-10 18:26:23,214 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1301 transitions. Word has length 84 [2022-01-10 18:26:23,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:23,214 INFO L470 AbstractCegarLoop]: Abstraction has 975 states and 1301 transitions. [2022-01-10 18:26:23,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-01-10 18:26:23,214 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1301 transitions. [2022-01-10 18:26:23,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 18:26:23,215 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:23,216 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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-01-10 18:26:23,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 18:26:23,216 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:23,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:23,216 INFO L85 PathProgramCache]: Analyzing trace with hash 803285038, now seen corresponding path program 1 times [2022-01-10 18:26:23,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:23,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349105044] [2022-01-10 18:26:23,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:23,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:23,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:23,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349105044] [2022-01-10 18:26:23,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349105044] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:23,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:23,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:23,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996737652] [2022-01-10 18:26:23,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:23,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:23,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:23,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:23,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:23,241 INFO L87 Difference]: Start difference. First operand 975 states and 1301 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-01-10 18:26:23,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:23,269 INFO L93 Difference]: Finished difference Result 1497 states and 2004 transitions. [2022-01-10 18:26:23,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:23,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) Word has length 84 [2022-01-10 18:26:23,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:23,271 INFO L225 Difference]: With dead ends: 1497 [2022-01-10 18:26:23,271 INFO L226 Difference]: Without dead ends: 723 [2022-01-10 18:26:23,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:23,274 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 26 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:23,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 351 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:23,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-01-10 18:26:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2022-01-10 18:26:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 722 states have (on average 1.2894736842105263) internal successors, (931), 722 states have internal predecessors, (931), 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-01-10 18:26:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 931 transitions. [2022-01-10 18:26:23,290 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 931 transitions. Word has length 84 [2022-01-10 18:26:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:23,290 INFO L470 AbstractCegarLoop]: Abstraction has 723 states and 931 transitions. [2022-01-10 18:26:23,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-01-10 18:26:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 931 transitions. [2022-01-10 18:26:23,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-10 18:26:23,292 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:23,292 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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-01-10 18:26:23,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 18:26:23,292 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:23,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:23,293 INFO L85 PathProgramCache]: Analyzing trace with hash -569421633, now seen corresponding path program 1 times [2022-01-10 18:26:23,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:23,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423852733] [2022-01-10 18:26:23,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:23,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:23,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:23,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423852733] [2022-01-10 18:26:23,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423852733] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:23,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:23,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:23,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875064170] [2022-01-10 18:26:23,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:23,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:23,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:23,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:23,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:23,332 INFO L87 Difference]: Start difference. First operand 723 states and 931 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-01-10 18:26:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:23,349 INFO L93 Difference]: Finished difference Result 1025 states and 1337 transitions. [2022-01-10 18:26:23,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:23,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) Word has length 85 [2022-01-10 18:26:23,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:23,350 INFO L225 Difference]: With dead ends: 1025 [2022-01-10 18:26:23,350 INFO L226 Difference]: Without dead ends: 509 [2022-01-10 18:26:23,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:23,352 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 117 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:23,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 169 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-01-10 18:26:23,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2022-01-10 18:26:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.2775590551181102) internal successors, (649), 508 states have internal predecessors, (649), 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-01-10 18:26:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 649 transitions. [2022-01-10 18:26:23,365 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 649 transitions. Word has length 85 [2022-01-10 18:26:23,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:23,365 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 649 transitions. [2022-01-10 18:26:23,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-01-10 18:26:23,365 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 649 transitions. [2022-01-10 18:26:23,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-10 18:26:23,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:23,366 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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-01-10 18:26:23,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 18:26:23,366 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:23,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:23,366 INFO L85 PathProgramCache]: Analyzing trace with hash 407352442, now seen corresponding path program 1 times [2022-01-10 18:26:23,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:23,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355444544] [2022-01-10 18:26:23,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:23,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:23,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:23,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:23,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355444544] [2022-01-10 18:26:23,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355444544] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:23,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:23,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:23,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682046583] [2022-01-10 18:26:23,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:23,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:23,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:23,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:23,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:23,393 INFO L87 Difference]: Start difference. First operand 509 states and 649 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-01-10 18:26:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:23,435 INFO L93 Difference]: Finished difference Result 1365 states and 1755 transitions. [2022-01-10 18:26:23,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:23,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) Word has length 85 [2022-01-10 18:26:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:23,438 INFO L225 Difference]: With dead ends: 1365 [2022-01-10 18:26:23,438 INFO L226 Difference]: Without dead ends: 981 [2022-01-10 18:26:23,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:23,439 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 138 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:23,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 334 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:23,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-01-10 18:26:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 977. [2022-01-10 18:26:23,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.2592213114754098) internal successors, (1229), 976 states have internal predecessors, (1229), 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-01-10 18:26:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1229 transitions. [2022-01-10 18:26:23,464 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1229 transitions. Word has length 85 [2022-01-10 18:26:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:23,464 INFO L470 AbstractCegarLoop]: Abstraction has 977 states and 1229 transitions. [2022-01-10 18:26:23,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-01-10 18:26:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1229 transitions. [2022-01-10 18:26:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-10 18:26:23,465 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:23,466 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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-01-10 18:26:23,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 18:26:23,466 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:23,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:23,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1286914365, now seen corresponding path program 1 times [2022-01-10 18:26:23,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:23,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899200222] [2022-01-10 18:26:23,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:23,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:23,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:23,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899200222] [2022-01-10 18:26:23,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899200222] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:23,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:23,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:23,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807785127] [2022-01-10 18:26:23,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:23,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:23,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:23,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:23,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:23,527 INFO L87 Difference]: Start difference. First operand 977 states and 1229 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-01-10 18:26:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:23,569 INFO L93 Difference]: Finished difference Result 1281 states and 1624 transitions. [2022-01-10 18:26:23,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:23,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) Word has length 85 [2022-01-10 18:26:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:23,573 INFO L225 Difference]: With dead ends: 1281 [2022-01-10 18:26:23,573 INFO L226 Difference]: Without dead ends: 1277 [2022-01-10 18:26:23,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:23,574 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 76 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:23,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 305 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:23,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2022-01-10 18:26:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1277. [2022-01-10 18:26:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1276 states have (on average 1.2688087774294672) internal successors, (1619), 1276 states have internal predecessors, (1619), 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-01-10 18:26:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1619 transitions. [2022-01-10 18:26:23,621 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1619 transitions. Word has length 85 [2022-01-10 18:26:23,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:23,621 INFO L470 AbstractCegarLoop]: Abstraction has 1277 states and 1619 transitions. [2022-01-10 18:26:23,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-01-10 18:26:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1619 transitions. [2022-01-10 18:26:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-10 18:26:23,623 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:23,623 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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, 1] [2022-01-10 18:26:23,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 18:26:23,623 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:23,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:23,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1761249962, now seen corresponding path program 1 times [2022-01-10 18:26:23,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:23,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664742883] [2022-01-10 18:26:23,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:23,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:23,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:23,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664742883] [2022-01-10 18:26:23,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664742883] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:23,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:23,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:23,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993704907] [2022-01-10 18:26:23,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:23,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:23,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:23,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:23,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:23,645 INFO L87 Difference]: Start difference. First operand 1277 states and 1619 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-01-10 18:26:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:23,700 INFO L93 Difference]: Finished difference Result 3133 states and 4030 transitions. [2022-01-10 18:26:23,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:23,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) Word has length 88 [2022-01-10 18:26:23,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:23,706 INFO L225 Difference]: With dead ends: 3133 [2022-01-10 18:26:23,706 INFO L226 Difference]: Without dead ends: 1917 [2022-01-10 18:26:23,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:23,708 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 135 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:23,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 261 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:23,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2022-01-10 18:26:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1847. [2022-01-10 18:26:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1846 states have (on average 1.2600216684723726) internal successors, (2326), 1846 states have internal predecessors, (2326), 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-01-10 18:26:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2326 transitions. [2022-01-10 18:26:23,765 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2326 transitions. Word has length 88 [2022-01-10 18:26:23,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:23,766 INFO L470 AbstractCegarLoop]: Abstraction has 1847 states and 2326 transitions. [2022-01-10 18:26:23,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-01-10 18:26:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2326 transitions. [2022-01-10 18:26:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 18:26:23,767 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:23,768 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:23,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 18:26:23,768 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:23,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:23,768 INFO L85 PathProgramCache]: Analyzing trace with hash 633799432, now seen corresponding path program 1 times [2022-01-10 18:26:23,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:23,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669919210] [2022-01-10 18:26:23,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:23,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:23,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:23,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669919210] [2022-01-10 18:26:23,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669919210] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:23,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:23,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:26:23,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591011782] [2022-01-10 18:26:23,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:23,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 18:26:23,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:23,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 18:26:23,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 18:26:23,816 INFO L87 Difference]: Start difference. First operand 1847 states and 2326 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-01-10 18:26:23,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:23,896 INFO L93 Difference]: Finished difference Result 3495 states and 4433 transitions. [2022-01-10 18:26:23,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 18:26:23,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) Word has length 103 [2022-01-10 18:26:23,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:23,901 INFO L225 Difference]: With dead ends: 3495 [2022-01-10 18:26:23,901 INFO L226 Difference]: Without dead ends: 1847 [2022-01-10 18:26:23,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:26:23,903 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 263 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:23,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 158 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:23,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2022-01-10 18:26:23,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2022-01-10 18:26:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1846 states have (on average 1.256771397616468) internal successors, (2320), 1846 states have internal predecessors, (2320), 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-01-10 18:26:23,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2320 transitions. [2022-01-10 18:26:23,960 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2320 transitions. Word has length 103 [2022-01-10 18:26:23,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:23,960 INFO L470 AbstractCegarLoop]: Abstraction has 1847 states and 2320 transitions. [2022-01-10 18:26:23,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-01-10 18:26:23,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2320 transitions. [2022-01-10 18:26:23,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 18:26:23,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:23,962 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:23,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 18:26:23,962 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:23,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:23,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1295290437, now seen corresponding path program 1 times [2022-01-10 18:26:23,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:23,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866743978] [2022-01-10 18:26:23,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:23,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:23,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:23,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866743978] [2022-01-10 18:26:23,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866743978] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:23,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:23,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:26:23,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343308845] [2022-01-10 18:26:23,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:23,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 18:26:23,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:23,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 18:26:23,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 18:26:23,993 INFO L87 Difference]: Start difference. First operand 1847 states and 2320 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-01-10 18:26:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:24,063 INFO L93 Difference]: Finished difference Result 3495 states and 4421 transitions. [2022-01-10 18:26:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 18:26:24,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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) Word has length 104 [2022-01-10 18:26:24,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:24,068 INFO L225 Difference]: With dead ends: 3495 [2022-01-10 18:26:24,068 INFO L226 Difference]: Without dead ends: 1847 [2022-01-10 18:26:24,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:26:24,070 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 248 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:24,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 164 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:24,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2022-01-10 18:26:24,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2022-01-10 18:26:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1846 states have (on average 1.2535211267605635) internal successors, (2314), 1846 states have internal predecessors, (2314), 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-01-10 18:26:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2314 transitions. [2022-01-10 18:26:24,149 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2314 transitions. Word has length 104 [2022-01-10 18:26:24,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:24,149 INFO L470 AbstractCegarLoop]: Abstraction has 1847 states and 2314 transitions. [2022-01-10 18:26:24,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-01-10 18:26:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2314 transitions. [2022-01-10 18:26:24,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 18:26:24,150 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:24,151 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:24,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 18:26:24,151 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:24,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:24,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2073081306, now seen corresponding path program 1 times [2022-01-10 18:26:24,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:24,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146641651] [2022-01-10 18:26:24,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:24,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:24,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:24,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146641651] [2022-01-10 18:26:24,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146641651] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:24,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:24,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:24,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267716153] [2022-01-10 18:26:24,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:24,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:24,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:24,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:24,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:24,175 INFO L87 Difference]: Start difference. First operand 1847 states and 2314 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-01-10 18:26:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:24,283 INFO L93 Difference]: Finished difference Result 5101 states and 6432 transitions. [2022-01-10 18:26:24,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:24,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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) Word has length 105 [2022-01-10 18:26:24,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:24,292 INFO L225 Difference]: With dead ends: 5101 [2022-01-10 18:26:24,293 INFO L226 Difference]: Without dead ends: 3453 [2022-01-10 18:26:24,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:24,295 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 93 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:24,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 387 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:24,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3453 states. [2022-01-10 18:26:24,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3453 to 1865. [2022-01-10 18:26:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1864 states have (on average 1.2510729613733906) internal successors, (2332), 1864 states have internal predecessors, (2332), 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-01-10 18:26:24,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2332 transitions. [2022-01-10 18:26:24,395 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2332 transitions. Word has length 105 [2022-01-10 18:26:24,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:24,395 INFO L470 AbstractCegarLoop]: Abstraction has 1865 states and 2332 transitions. [2022-01-10 18:26:24,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-01-10 18:26:24,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2332 transitions. [2022-01-10 18:26:24,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 18:26:24,397 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:24,397 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:24,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 18:26:24,397 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:24,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:24,398 INFO L85 PathProgramCache]: Analyzing trace with hash 602540666, now seen corresponding path program 1 times [2022-01-10 18:26:24,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:24,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900850132] [2022-01-10 18:26:24,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:24,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:24,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:24,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900850132] [2022-01-10 18:26:24,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900850132] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:24,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:24,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:26:24,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203945165] [2022-01-10 18:26:24,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:24,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 18:26:24,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:24,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 18:26:24,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 18:26:24,427 INFO L87 Difference]: Start difference. First operand 1865 states and 2332 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-01-10 18:26:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:24,507 INFO L93 Difference]: Finished difference Result 3507 states and 4397 transitions. [2022-01-10 18:26:24,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 18:26:24,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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) Word has length 106 [2022-01-10 18:26:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:24,512 INFO L225 Difference]: With dead ends: 3507 [2022-01-10 18:26:24,512 INFO L226 Difference]: Without dead ends: 1841 [2022-01-10 18:26:24,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:26:24,514 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 240 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:24,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 155 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:24,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2022-01-10 18:26:24,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1841. [2022-01-10 18:26:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.2380434782608696) internal successors, (2278), 1840 states have internal predecessors, (2278), 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-01-10 18:26:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2278 transitions. [2022-01-10 18:26:24,611 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2278 transitions. Word has length 106 [2022-01-10 18:26:24,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:24,611 INFO L470 AbstractCegarLoop]: Abstraction has 1841 states and 2278 transitions. [2022-01-10 18:26:24,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-01-10 18:26:24,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2278 transitions. [2022-01-10 18:26:24,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 18:26:24,613 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:24,613 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:24,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 18:26:24,613 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:24,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:24,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2052320802, now seen corresponding path program 1 times [2022-01-10 18:26:24,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:24,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021449468] [2022-01-10 18:26:24,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:24,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:24,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:24,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021449468] [2022-01-10 18:26:24,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021449468] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:24,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:24,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:24,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472572292] [2022-01-10 18:26:24,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:24,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:24,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:24,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:24,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:24,641 INFO L87 Difference]: Start difference. First operand 1841 states and 2278 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-01-10 18:26:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:24,780 INFO L93 Difference]: Finished difference Result 5113 states and 6378 transitions. [2022-01-10 18:26:24,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:24,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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) Word has length 107 [2022-01-10 18:26:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:24,789 INFO L225 Difference]: With dead ends: 5113 [2022-01-10 18:26:24,789 INFO L226 Difference]: Without dead ends: 3471 [2022-01-10 18:26:24,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:24,792 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 92 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:24,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 373 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:24,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3471 states. [2022-01-10 18:26:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3471 to 1865. [2022-01-10 18:26:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1864 states have (on average 1.2349785407725322) internal successors, (2302), 1864 states have internal predecessors, (2302), 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-01-10 18:26:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2302 transitions. [2022-01-10 18:26:24,877 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2302 transitions. Word has length 107 [2022-01-10 18:26:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:24,877 INFO L470 AbstractCegarLoop]: Abstraction has 1865 states and 2302 transitions. [2022-01-10 18:26:24,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-01-10 18:26:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2302 transitions. [2022-01-10 18:26:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 18:26:24,879 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:24,879 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:24,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 18:26:24,879 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:24,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:24,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1473476479, now seen corresponding path program 1 times [2022-01-10 18:26:24,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:24,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616359376] [2022-01-10 18:26:24,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:24,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:24,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:24,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616359376] [2022-01-10 18:26:24,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616359376] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:24,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:24,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:24,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39688437] [2022-01-10 18:26:24,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:24,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:24,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:24,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:24,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:24,921 INFO L87 Difference]: Start difference. First operand 1865 states and 2302 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-01-10 18:26:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:25,050 INFO L93 Difference]: Finished difference Result 5125 states and 6367 transitions. [2022-01-10 18:26:25,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:25,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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) Word has length 107 [2022-01-10 18:26:25,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:25,068 INFO L225 Difference]: With dead ends: 5125 [2022-01-10 18:26:25,068 INFO L226 Difference]: Without dead ends: 3459 [2022-01-10 18:26:25,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:25,071 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 104 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:25,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 357 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3459 states. [2022-01-10 18:26:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3459 to 3455. [2022-01-10 18:26:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3455 states, 3454 states have (on average 1.2290098436595251) internal successors, (4245), 3454 states have internal predecessors, (4245), 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-01-10 18:26:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3455 states to 3455 states and 4245 transitions. [2022-01-10 18:26:25,226 INFO L78 Accepts]: Start accepts. Automaton has 3455 states and 4245 transitions. Word has length 107 [2022-01-10 18:26:25,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:25,226 INFO L470 AbstractCegarLoop]: Abstraction has 3455 states and 4245 transitions. [2022-01-10 18:26:25,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-01-10 18:26:25,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3455 states and 4245 transitions. [2022-01-10 18:26:25,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 18:26:25,228 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:25,228 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:25,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 18:26:25,229 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:25,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:25,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1796796896, now seen corresponding path program 1 times [2022-01-10 18:26:25,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:25,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676760292] [2022-01-10 18:26:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:25,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:25,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:25,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:25,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676760292] [2022-01-10 18:26:25,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676760292] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 18:26:25,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42099571] [2022-01-10 18:26:25,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:25,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 18:26:25,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 18:26:25,295 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-01-10 18:26:25,351 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-01-10 18:26:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:25,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 18:26:25,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 18:26:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:25,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 18:26:25,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42099571] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:25,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 18:26:25,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-01-10 18:26:25,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115029958] [2022-01-10 18:26:25,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:25,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 18:26:25,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:25,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 18:26:25,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:26:25,652 INFO L87 Difference]: Start difference. First operand 3455 states and 4245 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-01-10 18:26:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:26,066 INFO L93 Difference]: Finished difference Result 10483 states and 13081 transitions. [2022-01-10 18:26:26,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 18:26:26,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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) Word has length 107 [2022-01-10 18:26:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:26,077 INFO L225 Difference]: With dead ends: 10483 [2022-01-10 18:26:26,078 INFO L226 Difference]: Without dead ends: 8327 [2022-01-10 18:26:26,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 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-01-10 18:26:26,081 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 392 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:26,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 449 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8327 states. [2022-01-10 18:26:26,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8327 to 6601. [2022-01-10 18:26:26,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6601 states, 6600 states have (on average 1.2443939393939394) internal successors, (8213), 6600 states have internal predecessors, (8213), 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-01-10 18:26:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 8213 transitions. [2022-01-10 18:26:26,490 INFO L78 Accepts]: Start accepts. Automaton has 6601 states and 8213 transitions. Word has length 107 [2022-01-10 18:26:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:26,490 INFO L470 AbstractCegarLoop]: Abstraction has 6601 states and 8213 transitions. [2022-01-10 18:26:26,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-01-10 18:26:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand 6601 states and 8213 transitions. [2022-01-10 18:26:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 18:26:26,493 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:26,493 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:26,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 18:26:26,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-10 18:26:26,710 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:26,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:26,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1789037537, now seen corresponding path program 1 times [2022-01-10 18:26:26,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:26,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841069268] [2022-01-10 18:26:26,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:26,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:26,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:26,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841069268] [2022-01-10 18:26:26,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841069268] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:26,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:26,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:26,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315516592] [2022-01-10 18:26:26,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:26,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:26,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:26,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:26,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:26,746 INFO L87 Difference]: Start difference. First operand 6601 states and 8213 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-01-10 18:26:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:27,083 INFO L93 Difference]: Finished difference Result 14061 states and 17491 transitions. [2022-01-10 18:26:27,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:27,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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) Word has length 107 [2022-01-10 18:26:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:27,094 INFO L225 Difference]: With dead ends: 14061 [2022-01-10 18:26:27,095 INFO L226 Difference]: Without dead ends: 7689 [2022-01-10 18:26:27,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 18:26:27,102 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 88 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:27,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 380 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7689 states. [2022-01-10 18:26:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7689 to 6625. [2022-01-10 18:26:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6625 states, 6624 states have (on average 1.2435084541062802) internal successors, (8237), 6624 states have internal predecessors, (8237), 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-01-10 18:26:27,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 8237 transitions. [2022-01-10 18:26:27,426 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 8237 transitions. Word has length 107 [2022-01-10 18:26:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:27,426 INFO L470 AbstractCegarLoop]: Abstraction has 6625 states and 8237 transitions. [2022-01-10 18:26:27,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-01-10 18:26:27,427 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 8237 transitions. [2022-01-10 18:26:27,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 18:26:27,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:27,430 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:27,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 18:26:27,430 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:27,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:27,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1040204897, now seen corresponding path program 1 times [2022-01-10 18:26:27,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:27,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682658321] [2022-01-10 18:26:27,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:27,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:27,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:27,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682658321] [2022-01-10 18:26:27,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682658321] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:27,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:27,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:26:27,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569678129] [2022-01-10 18:26:27,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:27,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 18:26:27,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:27,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 18:26:27,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 18:26:27,465 INFO L87 Difference]: Start difference. First operand 6625 states and 8237 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-01-10 18:26:27,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:27,606 INFO L93 Difference]: Finished difference Result 7691 states and 9521 transitions. [2022-01-10 18:26:27,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 18:26:27,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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) Word has length 107 [2022-01-10 18:26:27,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:27,607 INFO L225 Difference]: With dead ends: 7691 [2022-01-10 18:26:27,607 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 18:26:27,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:26:27,613 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 212 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:27,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 153 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:27,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 18:26:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 18:26:27,613 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-01-10 18:26:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 18:26:27,614 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2022-01-10 18:26:27,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:27,614 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 18:26:27,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-01-10 18:26:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 18:26:27,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 18:26:27,616 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 18:26:27,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 18:26:27,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 18:26:44,592 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 18:26:44,592 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 18:26:44,593 INFO L854 garLoopResultBuilder]: At program point L490(lines 461 492) the Hoare annotation is: (and (= ~d0_val_t~0Int 1) (= ~d1_val_t~0Int 1) (<= ~z_val_t~0Int 0) (= ~d1_req_up~0Int 1) (<= 2 ~d0_ev~0Int) (= ~d0_req_up~0Int 1) (<= 2 ~b0_ev~0Int) (<= ~z_req_up~0Int 0) (= 2 ~d1_ev~0Int) (<= (+ ~b1_val~0Int 1) ~b1_val_t~0Int) (<= 1 ~b0_val_t~0Int) (<= 2 ~b1_ev~0Int) (= ~b1_req_up~0Int 1) (= ~b0_req_up~0Int 1) (= ~z_val~0Int 0) (<= ~comp_m1_i~0Int 0) (<= 2 ~z_ev~0Int) (<= 1 ~b1_val_t~0Int)) [2022-01-10 18:26:44,593 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 218) no Hoare annotation was computed. [2022-01-10 18:26:44,593 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2022-01-10 18:26:44,593 INFO L858 garLoopResultBuilder]: For program point L212-2(lines 211 249) no Hoare annotation was computed. [2022-01-10 18:26:44,593 INFO L858 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2022-01-10 18:26:44,593 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2022-01-10 18:26:44,593 INFO L858 garLoopResultBuilder]: For program point L219-1(lines 211 249) no Hoare annotation was computed. [2022-01-10 18:26:44,593 INFO L854 garLoopResultBuilder]: At program point L145(lines 133 147) the Hoare annotation is: (let ((.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (= ~d1_req_up~0Int 1)) (.cse4 (<= 2 ~d0_ev~0Int)) (.cse5 (= ~d0_req_up~0Int 1)) (.cse6 (= ~b0_req_up~0Int 0)) (.cse7 (<= ~z_req_up~0Int 0)) (.cse8 (= 2 ~d1_ev~0Int)) (.cse9 (<= (+ ~b1_val~0Int 1) ~b1_val_t~0Int)) (.cse10 (<= 1 ~b0_val_t~0Int)) (.cse11 (<= 2 ~b1_ev~0Int)) (.cse12 (= ~b1_req_up~0Int 1)) (.cse13 (<= 1 ~b0_val~0Int)) (.cse14 (= ~z_val~0Int 0)) (.cse15 (<= ~comp_m1_i~0Int 0)) (.cse16 (<= 2 ~z_ev~0Int)) (.cse17 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~b0_ev~0Int 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~b0_ev~0Int) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2022-01-10 18:26:44,593 INFO L858 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2022-01-10 18:26:44,593 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2022-01-10 18:26:44,593 INFO L858 garLoopResultBuilder]: For program point L226-1(lines 211 249) no Hoare annotation was computed. [2022-01-10 18:26:44,593 INFO L854 garLoopResultBuilder]: At program point L160(lines 148 162) the Hoare annotation is: (let ((.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (= ~d1_req_up~0Int 1)) (.cse4 (<= 2 ~d0_ev~0Int)) (.cse5 (= ~d0_req_up~0Int 1)) (.cse6 (<= 1 ~b1_val~0Int)) (.cse7 (= ~b0_req_up~0Int 0)) (.cse8 (<= ~z_req_up~0Int 0)) (.cse9 (= 2 ~d1_ev~0Int)) (.cse10 (<= 1 ~b0_val_t~0Int)) (.cse11 (<= 1 ~b0_val~0Int)) (.cse12 (= ~b1_ev~0Int 0)) (.cse13 (= ~z_val~0Int 0)) (.cse14 (<= ~comp_m1_i~0Int 0)) (.cse15 (<= 2 ~z_ev~0Int)) (.cse16 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~b0_ev~0Int) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~b0_ev~0Int 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 18:26:44,593 INFO L858 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2022-01-10 18:26:44,593 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2022-01-10 18:26:44,593 INFO L858 garLoopResultBuilder]: For program point L233-1(lines 211 249) no Hoare annotation was computed. [2022-01-10 18:26:44,594 INFO L854 garLoopResultBuilder]: At program point L175(lines 163 177) the Hoare annotation is: (let ((.cse17 (= ~d0_ev~0Int 0)) (.cse4 (<= 2 ~b0_ev~0Int)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (= ~d1_req_up~0Int 1)) (.cse19 (<= 2 ~d0_ev~0Int)) (.cse5 (<= 1 ~b1_val~0Int)) (.cse6 (= ~b0_req_up~0Int 0)) (.cse7 (<= ~z_req_up~0Int 0)) (.cse8 (= 2 ~d1_ev~0Int)) (.cse18 (= ~b0_ev~0Int 0)) (.cse9 (<= 1 ~b0_val_t~0Int)) (.cse10 (<= 1 ~d0_val~0Int)) (.cse11 (<= 1 ~b0_val~0Int)) (.cse12 (= ~b1_ev~0Int 0)) (.cse13 (= ~z_val~0Int 0)) (.cse14 (<= ~comp_m1_i~0Int 0)) (.cse15 (<= 2 ~z_ev~0Int)) (.cse16 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 18:26:44,594 INFO L858 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2022-01-10 18:26:44,594 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2022-01-10 18:26:44,594 INFO L854 garLoopResultBuilder]: At program point L240-1(lines 208 250) the Hoare annotation is: (let ((.cse18 (= ~b0_ev~0Int 0)) (.cse16 (= ~d0_ev~0Int 0)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse17 (<= 2 ~d0_ev~0Int)) (.cse3 (= ~d1_val~0Int 1)) (.cse4 (<= 2 ~b0_ev~0Int)) (.cse5 (<= 1 ~b1_val~0Int)) (.cse6 (= ~b0_req_up~0Int 0)) (.cse7 (<= ~z_req_up~0Int 0)) (.cse8 (<= 1 ~b0_val_t~0Int)) (.cse9 (<= 1 ~d0_val~0Int)) (.cse10 (<= 1 ~b0_val~0Int)) (.cse11 (= ~b1_ev~0Int 0)) (.cse12 (= ~z_val~0Int 0)) (.cse13 (<= ~comp_m1_i~0Int 0)) (.cse14 (<= 2 ~z_ev~0Int)) (.cse15 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-01-10 18:26:44,594 INFO L854 garLoopResultBuilder]: At program point L190(lines 178 192) the Hoare annotation is: (let ((.cse18 (= ~b0_ev~0Int 0)) (.cse16 (= ~d0_ev~0Int 0)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse17 (<= 2 ~d0_ev~0Int)) (.cse3 (= ~d1_val~0Int 1)) (.cse4 (<= 2 ~b0_ev~0Int)) (.cse5 (<= 1 ~b1_val~0Int)) (.cse6 (= ~b0_req_up~0Int 0)) (.cse7 (<= ~z_req_up~0Int 0)) (.cse8 (<= 1 ~b0_val_t~0Int)) (.cse9 (<= 1 ~d0_val~0Int)) (.cse10 (<= 1 ~b0_val~0Int)) (.cse11 (= ~b1_ev~0Int 0)) (.cse12 (= ~z_val~0Int 0)) (.cse13 (<= ~comp_m1_i~0Int 0)) (.cse14 (<= 2 ~z_ev~0Int)) (.cse15 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-01-10 18:26:44,594 INFO L858 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2022-01-10 18:26:44,594 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2022-01-10 18:26:44,594 INFO L854 garLoopResultBuilder]: At program point L205(lines 193 207) the Hoare annotation is: false [2022-01-10 18:26:44,594 INFO L854 garLoopResultBuilder]: At program point L255-2(lines 251 263) the Hoare annotation is: (let ((.cse6 (<= 2 ~b0_ev~0Int)) (.cse19 (= ~d0_ev~0Int 0)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (<= 2 ~comp_m1_st~0Int)) (.cse2 (= ~d1_val_t~0Int 1)) (.cse3 (<= ~z_val_t~0Int 0)) (.cse4 (<= 2 ~d0_ev~0Int)) (.cse5 (= ~d1_val~0Int 1)) (.cse7 (<= 1 ~b1_val~0Int)) (.cse8 (= ~b0_req_up~0Int 0)) (.cse9 (<= ~z_req_up~0Int 0)) (.cse18 (= ~b0_ev~0Int 0)) (.cse10 (<= 1 ~b0_val_t~0Int)) (.cse11 (<= 1 ~d0_val~0Int)) (.cse12 (<= 1 ~b0_val~0Int)) (.cse13 (= ~b1_ev~0Int 0)) (.cse14 (= ~z_val~0Int 0)) (.cse15 (<= ~comp_m1_i~0Int 0)) (.cse16 (<= 2 ~z_ev~0Int)) (.cse17 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2022-01-10 18:26:44,594 INFO L858 garLoopResultBuilder]: For program point L321(lines 321 325) no Hoare annotation was computed. [2022-01-10 18:26:44,594 INFO L858 garLoopResultBuilder]: For program point L321-2(lines 320 348) no Hoare annotation was computed. [2022-01-10 18:26:44,594 INFO L858 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2022-01-10 18:26:44,594 INFO L858 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2022-01-10 18:26:44,595 INFO L858 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2022-01-10 18:26:44,595 INFO L854 garLoopResultBuilder]: At program point L341-1(lines 317 349) the Hoare annotation is: (let ((.cse6 (<= 2 ~b0_ev~0Int)) (.cse1 (= ~d0_ev~0Int 1)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse2 (<= 2 ~comp_m1_st~0Int)) (.cse3 (= ~d1_val_t~0Int 1)) (.cse4 (<= ~z_val_t~0Int 0)) (.cse18 (<= 2 ~d0_ev~0Int)) (.cse5 (= ~d1_val~0Int 1)) (.cse7 (<= 1 ~b1_val~0Int)) (.cse8 (= ~b0_req_up~0Int 0)) (.cse9 (<= ~z_req_up~0Int 0)) (.cse10 (<= 1 ~b0_val_t~0Int)) (.cse11 (= ~b1_ev~0Int 1)) (.cse12 (<= 1 ~d0_val~0Int)) (.cse13 (<= 1 ~b0_val~0Int)) (.cse19 (= ~b0_ev~0Int 1)) (.cse14 (= ~z_val~0Int 0)) (.cse15 (<= ~comp_m1_i~0Int 0)) (.cse16 (<= 2 ~z_ev~0Int)) (.cse17 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14 .cse15 .cse16 .cse17))) [2022-01-10 18:26:44,595 INFO L858 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2022-01-10 18:26:44,595 INFO L854 garLoopResultBuilder]: At program point L129(lines 106 131) the Hoare annotation is: (let ((.cse6 (<= 2 ~b0_ev~0Int)) (.cse1 (= ~d0_ev~0Int 1)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse2 (<= 2 ~comp_m1_st~0Int)) (.cse3 (= ~d1_val_t~0Int 1)) (.cse4 (<= ~z_val_t~0Int 0)) (.cse18 (<= 2 ~d0_ev~0Int)) (.cse5 (= ~d1_val~0Int 1)) (.cse7 (<= 1 ~b1_val~0Int)) (.cse8 (= ~b0_req_up~0Int 0)) (.cse9 (<= ~z_req_up~0Int 0)) (.cse10 (<= 1 ~b0_val_t~0Int)) (.cse11 (= ~b1_ev~0Int 1)) (.cse12 (<= 1 ~d0_val~0Int)) (.cse13 (<= 1 ~b0_val~0Int)) (.cse19 (= ~b0_ev~0Int 1)) (.cse14 (= ~z_val~0Int 0)) (.cse15 (<= ~comp_m1_i~0Int 0)) (.cse16 (<= 2 ~z_ev~0Int)) (.cse17 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14 .cse15 .cse16 .cse17))) [2022-01-10 18:26:44,595 INFO L858 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2022-01-10 18:26:44,595 INFO L854 garLoopResultBuilder]: At program point L130(lines 103 132) the Hoare annotation is: (let ((.cse6 (<= 2 ~b0_ev~0Int)) (.cse1 (= ~d0_ev~0Int 1)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse2 (<= 2 ~comp_m1_st~0Int)) (.cse3 (= ~d1_val_t~0Int 1)) (.cse4 (<= ~z_val_t~0Int 0)) (.cse18 (<= 2 ~d0_ev~0Int)) (.cse5 (= ~d1_val~0Int 1)) (.cse7 (<= 1 ~b1_val~0Int)) (.cse8 (= ~b0_req_up~0Int 0)) (.cse9 (<= ~z_req_up~0Int 0)) (.cse10 (<= 1 ~b0_val_t~0Int)) (.cse11 (= ~b1_ev~0Int 1)) (.cse12 (<= 1 ~d0_val~0Int)) (.cse13 (<= 1 ~b0_val~0Int)) (.cse19 (= ~b0_ev~0Int 1)) (.cse14 (= ~z_val~0Int 0)) (.cse15 (<= ~comp_m1_i~0Int 0)) (.cse16 (<= 2 ~z_ev~0Int)) (.cse17 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14 .cse15 .cse16 .cse17))) [2022-01-10 18:26:44,595 INFO L858 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2022-01-10 18:26:44,595 INFO L858 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2022-01-10 18:26:44,595 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2022-01-10 18:26:44,595 INFO L854 garLoopResultBuilder]: At program point L390-2(lines 383 398) the Hoare annotation is: (let ((.cse3 (<= 2 ~d0_ev~0Int)) (.cse17 (<= 2 ~b0_ev~0Int)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse18 (= ~d0_ev~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse4 (= ~d1_val~0Int 1)) (.cse5 (<= 1 ~b1_val~0Int)) (.cse6 (= ~b0_req_up~0Int 0)) (.cse7 (<= ~z_req_up~0Int 0)) (.cse8 (<= 1 ~b0_val_t~0Int)) (.cse9 (= ~b1_ev~0Int 1)) (.cse10 (<= 1 ~d0_val~0Int)) (.cse11 (<= 1 ~b0_val~0Int)) (.cse12 (= ~b0_ev~0Int 1)) (.cse13 (= ~z_val~0Int 0)) (.cse14 (<= ~comp_m1_i~0Int 0)) (.cse15 (<= 2 ~z_ev~0Int)) (.cse16 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 18:26:44,595 INFO L858 garLoopResultBuilder]: For program point L354(lines 354 358) no Hoare annotation was computed. [2022-01-10 18:26:44,595 INFO L858 garLoopResultBuilder]: For program point L354-2(lines 353 381) no Hoare annotation was computed. [2022-01-10 18:26:44,596 INFO L858 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2022-01-10 18:26:44,596 INFO L858 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2022-01-10 18:26:44,596 INFO L858 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2022-01-10 18:26:44,596 INFO L854 garLoopResultBuilder]: At program point L374-1(lines 350 382) the Hoare annotation is: (and (= ~d0_val_t~0Int 1) (= ~d1_val_t~0Int 1) (<= ~z_val_t~0Int 0) (<= 2 ~d0_ev~0Int) (= ~d1_val~0Int 1) (<= 2 ~b0_ev~0Int) (<= 1 ~b1_val~0Int) (= ~b0_req_up~0Int 0) (<= ~z_req_up~0Int 0) (<= 1 ~b0_val_t~0Int) (<= 2 ~b1_ev~0Int) (<= 1 ~d0_val~0Int) (<= 1 ~b0_val~0Int) (= ~z_val~0Int 0) (<= ~comp_m1_i~0Int 0) (<= 2 ~z_ev~0Int) (<= 1 ~b1_val_t~0Int)) [2022-01-10 18:26:44,596 INFO L854 garLoopResultBuilder]: At program point L432-2(lines 432 454) the Hoare annotation is: (let ((.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (<= 2 ~d0_ev~0Int)) (.cse4 (= ~d1_val~0Int 1)) (.cse5 (<= 2 ~b0_ev~0Int)) (.cse6 (<= 1 ~b1_val~0Int)) (.cse7 (= ~b0_req_up~0Int 0)) (.cse8 (<= 1 ~b0_val_t~0Int)) (.cse9 (<= 2 ~b1_ev~0Int)) (.cse10 (<= 1 ~d0_val~0Int)) (.cse11 (<= 1 ~b0_val~0Int)) (.cse12 (<= ~comp_m1_i~0Int 0)) (.cse13 (<= 2 ~z_ev~0Int)) (.cse14 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 ~z_val~0Int) .cse8 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|) .cse9 (<= ~z_val~0Int 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~z_req_up~0Int 0) .cse8 .cse9 .cse10 .cse11 (= ~z_val~0Int 0) .cse12 .cse13 .cse14))) [2022-01-10 18:26:44,596 INFO L854 garLoopResultBuilder]: At program point L455(lines 418 460) the Hoare annotation is: (and (= ~b0_req_up~0Int 0) (= ~z_val~0Int 0) (<= ~comp_m1_i~0Int 0)) [2022-01-10 18:26:44,596 INFO L858 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2022-01-10 18:26:44,596 INFO L858 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2022-01-10 18:26:44,597 INFO L854 garLoopResultBuilder]: At program point L295(lines 285 310) the Hoare annotation is: (let ((.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (<= 2 ~d0_ev~0Int)) (.cse4 (= ~d1_val~0Int 1)) (.cse5 (<= 2 ~b0_ev~0Int)) (.cse6 (<= 1 ~b1_val~0Int)) (.cse7 (= ~b0_req_up~0Int 0)) (.cse8 (<= 1 ~b0_val_t~0Int)) (.cse9 (<= 2 ~b1_ev~0Int)) (.cse10 (<= 1 ~d0_val~0Int)) (.cse11 (<= 1 ~b0_val~0Int)) (.cse12 (<= ~comp_m1_i~0Int 0)) (.cse13 (<= 2 ~z_ev~0Int)) (.cse14 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 ~z_val~0Int) .cse8 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|) .cse9 (<= ~z_val~0Int 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~z_req_up~0Int 0) .cse8 .cse9 .cse10 .cse11 (= ~z_val~0Int 0) .cse12 .cse13 .cse14))) [2022-01-10 18:26:44,597 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-01-10 18:26:44,597 INFO L858 garLoopResultBuilder]: For program point L501-2(lines 501 507) no Hoare annotation was computed. [2022-01-10 18:26:44,597 INFO L854 garLoopResultBuilder]: At program point L311(lines 279 316) the Hoare annotation is: (let ((.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (<= 2 ~d0_ev~0Int)) (.cse4 (= ~d1_val~0Int 1)) (.cse5 (<= 2 ~b0_ev~0Int)) (.cse6 (<= 1 ~b1_val~0Int)) (.cse7 (= ~b0_req_up~0Int 0)) (.cse8 (<= 1 ~b0_val_t~0Int)) (.cse9 (<= 2 ~b1_ev~0Int)) (.cse10 (<= 1 ~d0_val~0Int)) (.cse11 (<= 1 ~b0_val~0Int)) (.cse12 (<= ~comp_m1_i~0Int 0)) (.cse13 (<= 2 ~z_ev~0Int)) (.cse14 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 ~z_val~0Int) .cse8 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|) .cse9 (<= ~z_val~0Int 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~z_req_up~0Int 0) .cse8 .cse9 .cse10 .cse11 (= ~z_val~0Int 0) .cse12 .cse13 .cse14))) [2022-01-10 18:26:44,597 INFO L858 garLoopResultBuilder]: For program point L286(line 286) no Hoare annotation was computed. [2022-01-10 18:26:44,598 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-10 18:26:44,598 INFO L854 garLoopResultBuilder]: At program point L20(lines 15 22) the Hoare annotation is: false [2022-01-10 18:26:44,598 INFO L861 garLoopResultBuilder]: At program point L509(lines 493 511) the Hoare annotation is: true [2022-01-10 18:26:44,598 INFO L858 garLoopResultBuilder]: For program point L212-3(lines 212 218) no Hoare annotation was computed. [2022-01-10 18:26:44,598 INFO L858 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2022-01-10 18:26:44,598 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 18:26:44,598 INFO L858 garLoopResultBuilder]: For program point L137-3(lines 137 142) no Hoare annotation was computed. [2022-01-10 18:26:44,598 INFO L858 garLoopResultBuilder]: For program point L212-5(lines 211 249) no Hoare annotation was computed. [2022-01-10 18:26:44,598 INFO L854 garLoopResultBuilder]: At program point L275(lines 267 277) the Hoare annotation is: (let ((.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (<= 2 ~d0_ev~0Int)) (.cse4 (= ~d1_val~0Int 1)) (.cse5 (<= 2 ~b0_ev~0Int)) (.cse6 (<= 1 ~b1_val~0Int)) (.cse7 (= ~b0_req_up~0Int 0)) (.cse8 (<= 1 ~b0_val_t~0Int)) (.cse9 (<= 2 ~b1_ev~0Int)) (.cse10 (<= 1 ~d0_val~0Int)) (.cse11 (<= 1 ~b0_val~0Int)) (.cse12 (<= ~comp_m1_i~0Int 0)) (.cse13 (<= 2 ~z_ev~0Int)) (.cse14 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 ~z_val~0Int) .cse8 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|) .cse9 (<= ~z_val~0Int 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~z_req_up~0Int 0) .cse8 .cse9 .cse10 .cse11 (= ~z_val~0Int 0) .cse12 .cse13 .cse14))) [2022-01-10 18:26:44,598 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 18:26:44,598 INFO L858 garLoopResultBuilder]: For program point L137-5(lines 137 142) no Hoare annotation was computed. [2022-01-10 18:26:44,598 INFO L858 garLoopResultBuilder]: For program point L152-3(lines 152 157) no Hoare annotation was computed. [2022-01-10 18:26:44,599 INFO L858 garLoopResultBuilder]: For program point L219-3(lines 211 249) no Hoare annotation was computed. [2022-01-10 18:26:44,599 INFO L854 garLoopResultBuilder]: At program point L276(lines 264 278) the Hoare annotation is: (let ((.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (<= 2 ~d0_ev~0Int)) (.cse4 (= ~d1_val~0Int 1)) (.cse5 (<= 2 ~b0_ev~0Int)) (.cse6 (<= 1 ~b1_val~0Int)) (.cse7 (= ~b0_req_up~0Int 0)) (.cse8 (<= 1 ~b0_val_t~0Int)) (.cse9 (<= 2 ~b1_ev~0Int)) (.cse10 (<= 1 ~d0_val~0Int)) (.cse11 (<= 1 ~b0_val~0Int)) (.cse12 (<= ~comp_m1_i~0Int 0)) (.cse13 (<= 2 ~z_ev~0Int)) (.cse14 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 ~z_val~0Int) .cse8 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|) .cse9 (<= ~z_val~0Int 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~z_req_up~0Int 0) .cse8 .cse9 .cse10 .cse11 (= ~z_val~0Int 0) .cse12 .cse13 .cse14))) [2022-01-10 18:26:44,599 INFO L854 garLoopResultBuilder]: At program point L145-1(lines 133 147) the Hoare annotation is: false [2022-01-10 18:26:44,599 INFO L858 garLoopResultBuilder]: For program point L152-5(lines 152 157) no Hoare annotation was computed. [2022-01-10 18:26:44,599 INFO L858 garLoopResultBuilder]: For program point L167-3(lines 167 172) no Hoare annotation was computed. [2022-01-10 18:26:44,599 INFO L858 garLoopResultBuilder]: For program point L226-3(lines 211 249) no Hoare annotation was computed. [2022-01-10 18:26:44,599 INFO L858 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2022-01-10 18:26:44,599 INFO L854 garLoopResultBuilder]: At program point L160-1(lines 148 162) the Hoare annotation is: (let ((.cse9 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|)) (.cse18 (<= 2 ~b1_ev~0Int)) (.cse13 (= ~z_val~0Int 0)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (<= 2 ~d0_ev~0Int)) (.cse4 (= ~d1_val~0Int 1)) (.cse5 (<= 2 ~b0_ev~0Int)) (.cse6 (<= 1 ~b1_val~0Int)) (.cse7 (= ~b0_req_up~0Int 0)) (.cse20 (<= ~z_req_up~0Int 0)) (.cse17 (<= 0 ~z_val~0Int)) (.cse8 (<= 1 ~b0_val_t~0Int)) (.cse19 (<= ~z_val~0Int 0)) (.cse10 (<= 1 ~d0_val~0Int)) (.cse11 (<= 1 ~b0_val~0Int)) (.cse12 (= ~b1_ev~0Int 0)) (.cse14 (<= ~comp_m1_i~0Int 0)) (.cse15 (<= 2 ~z_ev~0Int)) (.cse16 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse18 .cse19 .cse10 .cse11 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse18 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse17 .cse8 .cse19 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16))) [2022-01-10 18:26:44,599 INFO L858 garLoopResultBuilder]: For program point L167-5(lines 167 172) no Hoare annotation was computed. [2022-01-10 18:26:44,599 INFO L858 garLoopResultBuilder]: For program point L182-3(lines 182 187) no Hoare annotation was computed. [2022-01-10 18:26:44,599 INFO L858 garLoopResultBuilder]: For program point L233-3(lines 211 249) no Hoare annotation was computed. [2022-01-10 18:26:44,599 INFO L858 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2022-01-10 18:26:44,599 INFO L854 garLoopResultBuilder]: At program point L175-1(lines 163 177) the Hoare annotation is: (let ((.cse8 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|)) (.cse18 (<= 2 ~b1_ev~0Int)) (.cse12 (= ~z_val~0Int 0)) (.cse16 (= ~d0_ev~0Int 0)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse19 (<= 2 ~d0_ev~0Int)) (.cse3 (= ~d1_val~0Int 1)) (.cse4 (<= 2 ~b0_ev~0Int)) (.cse5 (<= 1 ~b1_val~0Int)) (.cse6 (= ~b0_req_up~0Int 0)) (.cse17 (<= ~z_req_up~0Int 0)) (.cse20 (<= 0 ~z_val~0Int)) (.cse7 (<= 1 ~b0_val_t~0Int)) (.cse21 (<= ~z_val~0Int 0)) (.cse9 (<= 1 ~d0_val~0Int)) (.cse10 (<= 1 ~b0_val~0Int)) (.cse11 (= ~b1_ev~0Int 0)) (.cse13 (<= ~comp_m1_i~0Int 0)) (.cse14 (<= 2 ~z_ev~0Int)) (.cse15 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse18 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse18 .cse21 .cse9 .cse10 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse18 .cse21 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse18 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse20 .cse7 .cse21 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse17 .cse20 .cse7 .cse21 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15))) [2022-01-10 18:26:44,599 INFO L858 garLoopResultBuilder]: For program point L182-5(lines 182 187) no Hoare annotation was computed. [2022-01-10 18:26:44,599 INFO L858 garLoopResultBuilder]: For program point L197-3(lines 197 202) no Hoare annotation was computed. [2022-01-10 18:26:44,599 INFO L854 garLoopResultBuilder]: At program point L240-3(lines 208 250) the Hoare annotation is: (let ((.cse8 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|)) (.cse18 (<= 2 ~b1_ev~0Int)) (.cse12 (= ~z_val~0Int 0)) (.cse16 (= ~d0_ev~0Int 0)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse19 (<= 2 ~d0_ev~0Int)) (.cse3 (= ~d1_val~0Int 1)) (.cse4 (<= 2 ~b0_ev~0Int)) (.cse5 (<= 1 ~b1_val~0Int)) (.cse6 (= ~b0_req_up~0Int 0)) (.cse17 (<= ~z_req_up~0Int 0)) (.cse20 (<= 0 ~z_val~0Int)) (.cse7 (<= 1 ~b0_val_t~0Int)) (.cse21 (<= ~z_val~0Int 0)) (.cse9 (<= 1 ~d0_val~0Int)) (.cse10 (<= 1 ~b0_val~0Int)) (.cse11 (= ~b1_ev~0Int 0)) (.cse13 (<= ~comp_m1_i~0Int 0)) (.cse14 (<= 2 ~z_ev~0Int)) (.cse15 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse18 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse18 .cse21 .cse9 .cse10 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse18 .cse21 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse18 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse20 .cse7 .cse21 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse17 .cse20 .cse7 .cse21 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15))) [2022-01-10 18:26:44,600 INFO L858 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2022-01-10 18:26:44,600 INFO L854 garLoopResultBuilder]: At program point L190-1(lines 178 192) the Hoare annotation is: (let ((.cse8 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|)) (.cse18 (<= 2 ~b1_ev~0Int)) (.cse12 (= ~z_val~0Int 0)) (.cse16 (= ~d0_ev~0Int 0)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse19 (<= 2 ~d0_ev~0Int)) (.cse3 (= ~d1_val~0Int 1)) (.cse4 (<= 2 ~b0_ev~0Int)) (.cse5 (<= 1 ~b1_val~0Int)) (.cse6 (= ~b0_req_up~0Int 0)) (.cse17 (<= ~z_req_up~0Int 0)) (.cse20 (<= 0 ~z_val~0Int)) (.cse7 (<= 1 ~b0_val_t~0Int)) (.cse21 (<= ~z_val~0Int 0)) (.cse9 (<= 1 ~d0_val~0Int)) (.cse10 (<= 1 ~b0_val~0Int)) (.cse11 (= ~b1_ev~0Int 0)) (.cse13 (<= ~comp_m1_i~0Int 0)) (.cse14 (<= 2 ~z_ev~0Int)) (.cse15 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse18 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse18 .cse21 .cse9 .cse10 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse18 .cse21 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse18 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse20 .cse7 .cse21 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse17 .cse20 .cse7 .cse21 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15))) [2022-01-10 18:26:44,600 INFO L858 garLoopResultBuilder]: For program point L197-5(lines 197 202) no Hoare annotation was computed. [2022-01-10 18:26:44,600 INFO L858 garLoopResultBuilder]: For program point L321-3(lines 321 325) no Hoare annotation was computed. [2022-01-10 18:26:44,600 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2022-01-10 18:26:44,600 INFO L854 garLoopResultBuilder]: At program point L205-1(lines 193 207) the Hoare annotation is: (let ((.cse9 (<= 2 ~b1_ev~0Int)) (.cse12 (= ~z_val~0Int 0)) (.cse16 (= ~d0_ev~0Int 0)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse17 (<= 2 ~d0_ev~0Int)) (.cse3 (= ~d1_val~0Int 1)) (.cse4 (<= 2 ~b0_ev~0Int)) (.cse5 (<= 1 ~b1_val~0Int)) (.cse6 (= ~b0_req_up~0Int 0)) (.cse7 (<= ~z_req_up~0Int 0)) (.cse18 (<= 0 ~z_val~0Int)) (.cse8 (<= 1 ~b0_val_t~0Int)) (.cse19 (<= ~z_val~0Int 0)) (.cse10 (<= 1 ~d0_val~0Int)) (.cse11 (<= 1 ~b0_val~0Int)) (.cse20 (= ~b1_ev~0Int 0)) (.cse13 (<= ~comp_m1_i~0Int 0)) (.cse14 (<= 2 ~z_ev~0Int)) (.cse15 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse19 .cse10 .cse11 .cse20 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse19 .cse10 .cse11 .cse20 .cse13 .cse14 .cse15))) [2022-01-10 18:26:44,600 INFO L858 garLoopResultBuilder]: For program point L321-5(lines 320 348) no Hoare annotation was computed. [2022-01-10 18:26:44,600 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2022-01-10 18:26:44,600 INFO L858 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2022-01-10 18:26:44,600 INFO L858 garLoopResultBuilder]: For program point L326-3(lines 320 348) no Hoare annotation was computed. [2022-01-10 18:26:44,600 INFO L858 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2022-01-10 18:26:44,600 INFO L858 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2022-01-10 18:26:44,600 INFO L858 garLoopResultBuilder]: For program point L331-3(lines 320 348) no Hoare annotation was computed. [2022-01-10 18:26:44,600 INFO L858 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2022-01-10 18:26:44,600 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2022-01-10 18:26:44,600 INFO L858 garLoopResultBuilder]: For program point L336-3(lines 320 348) no Hoare annotation was computed. [2022-01-10 18:26:44,600 INFO L858 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2022-01-10 18:26:44,601 INFO L858 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2022-01-10 18:26:44,601 INFO L854 garLoopResultBuilder]: At program point L341-3(lines 317 349) the Hoare annotation is: (let ((.cse18 (= ~d0_ev~0Int 1)) (.cse8 (<= ~z_req_up~0Int 0)) (.cse20 (<= 2 ~b1_ev~0Int)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (<= 2 ~d0_ev~0Int)) (.cse4 (= ~d1_val~0Int 1)) (.cse5 (<= 2 ~b0_ev~0Int)) (.cse6 (<= 1 ~b1_val~0Int)) (.cse7 (= ~b0_req_up~0Int 0)) (.cse9 (<= 0 ~z_val~0Int)) (.cse10 (<= 1 ~b0_val_t~0Int)) (.cse11 (= ~b1_ev~0Int 1)) (.cse19 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|)) (.cse12 (<= ~z_val~0Int 0)) (.cse13 (<= 1 ~d0_val~0Int)) (.cse14 (<= 1 ~b0_val~0Int)) (.cse15 (<= ~comp_m1_i~0Int 0)) (.cse16 (<= 2 ~z_ev~0Int)) (.cse17 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse19 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse19 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse20 .cse13 .cse14 (= ~z_val~0Int 0) .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2022-01-10 18:26:44,601 INFO L858 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2022-01-10 18:26:44,601 INFO L858 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-01-10 18:26:44,601 INFO L858 garLoopResultBuilder]: For program point L107-1(lines 107 127) no Hoare annotation was computed. [2022-01-10 18:26:44,601 INFO L854 garLoopResultBuilder]: At program point L100(lines 46 102) the Hoare annotation is: (and (= ~d0_val_t~0Int 1) (<= 2 ~comp_m1_st~0Int) (= ~d1_val_t~0Int 1) (<= ~z_val_t~0Int 0) (<= 2 ~d0_ev~0Int) (= ~d1_val~0Int 1) (<= 2 ~b0_ev~0Int) (<= 1 ~b1_val~0Int) (= ~b0_req_up~0Int 0) (<= 0 ~z_val~0Int) (<= 1 ~b0_val_t~0Int) (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|) (<= 2 ~b1_ev~0Int) (<= ~z_val~0Int 0) (<= 1 ~d0_val~0Int) (<= 1 ~b0_val~0Int) (<= ~comp_m1_i~0Int 0) (<= 2 ~z_ev~0Int) (<= 1 ~b1_val_t~0Int)) [2022-01-10 18:26:44,601 INFO L854 garLoopResultBuilder]: At program point L129-1(lines 106 131) the Hoare annotation is: (let ((.cse18 (= ~d0_ev~0Int 1)) (.cse8 (<= ~z_req_up~0Int 0)) (.cse20 (<= 2 ~b1_ev~0Int)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (<= 2 ~d0_ev~0Int)) (.cse4 (= ~d1_val~0Int 1)) (.cse5 (<= 2 ~b0_ev~0Int)) (.cse6 (<= 1 ~b1_val~0Int)) (.cse7 (= ~b0_req_up~0Int 0)) (.cse9 (<= 0 ~z_val~0Int)) (.cse10 (<= 1 ~b0_val_t~0Int)) (.cse11 (= ~b1_ev~0Int 1)) (.cse19 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|)) (.cse12 (<= ~z_val~0Int 0)) (.cse13 (<= 1 ~d0_val~0Int)) (.cse14 (<= 1 ~b0_val~0Int)) (.cse15 (<= ~comp_m1_i~0Int 0)) (.cse16 (<= 2 ~z_ev~0Int)) (.cse17 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse19 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse19 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse20 .cse13 .cse14 (= ~z_val~0Int 0) .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2022-01-10 18:26:44,601 INFO L858 garLoopResultBuilder]: For program point L111-1(lines 111 126) no Hoare annotation was computed. [2022-01-10 18:26:44,602 INFO L854 garLoopResultBuilder]: At program point L130-1(lines 103 132) the Hoare annotation is: (let ((.cse18 (= ~d0_ev~0Int 1)) (.cse8 (<= ~z_req_up~0Int 0)) (.cse20 (<= 2 ~b1_ev~0Int)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (<= 2 ~d0_ev~0Int)) (.cse4 (= ~d1_val~0Int 1)) (.cse5 (<= 2 ~b0_ev~0Int)) (.cse6 (<= 1 ~b1_val~0Int)) (.cse7 (= ~b0_req_up~0Int 0)) (.cse9 (<= 0 ~z_val~0Int)) (.cse10 (<= 1 ~b0_val_t~0Int)) (.cse11 (= ~b1_ev~0Int 1)) (.cse19 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|)) (.cse12 (<= ~z_val~0Int 0)) (.cse13 (<= 1 ~d0_val~0Int)) (.cse14 (<= 1 ~b0_val~0Int)) (.cse15 (<= ~comp_m1_i~0Int 0)) (.cse16 (<= 2 ~z_ev~0Int)) (.cse17 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse19 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse19 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse20 .cse13 .cse14 (= ~z_val~0Int 0) .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2022-01-10 18:26:44,602 INFO L858 garLoopResultBuilder]: For program point L115-1(lines 115 125) no Hoare annotation was computed. [2022-01-10 18:26:44,602 INFO L858 garLoopResultBuilder]: For program point L390-3(lines 390 394) no Hoare annotation was computed. [2022-01-10 18:26:44,602 INFO L858 garLoopResultBuilder]: For program point L119-1(lines 119 124) no Hoare annotation was computed. [2022-01-10 18:26:44,602 INFO L854 garLoopResultBuilder]: At program point L390-5(lines 383 398) the Hoare annotation is: (let ((.cse18 (= ~d0_ev~0Int 1)) (.cse8 (<= ~z_req_up~0Int 0)) (.cse20 (<= 2 ~b1_ev~0Int)) (.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (<= 2 ~d0_ev~0Int)) (.cse4 (= ~d1_val~0Int 1)) (.cse5 (<= 2 ~b0_ev~0Int)) (.cse6 (<= 1 ~b1_val~0Int)) (.cse7 (= ~b0_req_up~0Int 0)) (.cse9 (<= 0 ~z_val~0Int)) (.cse10 (<= 1 ~b0_val_t~0Int)) (.cse11 (= ~b1_ev~0Int 1)) (.cse19 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|)) (.cse12 (<= ~z_val~0Int 0)) (.cse13 (<= 1 ~d0_val~0Int)) (.cse14 (<= 1 ~b0_val~0Int)) (.cse15 (<= ~comp_m1_i~0Int 0)) (.cse16 (<= 2 ~z_ev~0Int)) (.cse17 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse19 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse19 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse20 .cse13 .cse14 (= ~z_val~0Int 0) .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2022-01-10 18:26:44,602 INFO L858 garLoopResultBuilder]: For program point L354-3(lines 354 358) no Hoare annotation was computed. [2022-01-10 18:26:44,602 INFO L858 garLoopResultBuilder]: For program point L354-5(lines 353 381) no Hoare annotation was computed. [2022-01-10 18:26:44,602 INFO L858 garLoopResultBuilder]: For program point L359-3(lines 353 381) no Hoare annotation was computed. [2022-01-10 18:26:44,602 INFO L858 garLoopResultBuilder]: For program point L364-3(lines 353 381) no Hoare annotation was computed. [2022-01-10 18:26:44,602 INFO L858 garLoopResultBuilder]: For program point L369-3(lines 353 381) no Hoare annotation was computed. [2022-01-10 18:26:44,602 INFO L854 garLoopResultBuilder]: At program point L374-3(lines 350 382) the Hoare annotation is: (let ((.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (<= 2 ~d0_ev~0Int)) (.cse4 (= ~d1_val~0Int 1)) (.cse5 (<= 2 ~b0_ev~0Int)) (.cse6 (<= 1 ~b1_val~0Int)) (.cse7 (= ~b0_req_up~0Int 0)) (.cse8 (<= 1 ~b0_val_t~0Int)) (.cse9 (<= 2 ~b1_ev~0Int)) (.cse10 (<= 1 ~d0_val~0Int)) (.cse11 (<= 1 ~b0_val~0Int)) (.cse12 (<= ~comp_m1_i~0Int 0)) (.cse13 (<= 2 ~z_ev~0Int)) (.cse14 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 ~z_val~0Int) .cse8 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|) .cse9 (<= ~z_val~0Int 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~z_req_up~0Int 0) .cse8 .cse9 .cse10 .cse11 (= ~z_val~0Int 0) .cse12 .cse13 .cse14))) [2022-01-10 18:26:44,602 INFO L858 garLoopResultBuilder]: For program point L268-1(lines 268 273) no Hoare annotation was computed. [2022-01-10 18:26:44,602 INFO L854 garLoopResultBuilder]: At program point L275-1(lines 267 277) the Hoare annotation is: (let ((.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (<= 2 ~d0_ev~0Int)) (.cse4 (= ~d1_val~0Int 1)) (.cse5 (<= 2 ~b0_ev~0Int)) (.cse6 (<= 1 ~b1_val~0Int)) (.cse7 (= ~b0_req_up~0Int 0)) (.cse8 (<= 1 ~b0_val_t~0Int)) (.cse9 (<= 2 ~b1_ev~0Int)) (.cse10 (<= 1 ~d0_val~0Int)) (.cse11 (<= 1 ~b0_val~0Int)) (.cse12 (<= ~comp_m1_i~0Int 0)) (.cse13 (<= 2 ~z_ev~0Int)) (.cse14 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 ~z_val~0Int) .cse8 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|) .cse9 (<= ~z_val~0Int 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~z_req_up~0Int 0) .cse8 .cse9 .cse10 .cse11 (= ~z_val~0Int 0) .cse12 .cse13 .cse14))) [2022-01-10 18:26:44,602 INFO L854 garLoopResultBuilder]: At program point L276-1(lines 264 278) the Hoare annotation is: (let ((.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (<= 2 ~d0_ev~0Int)) (.cse4 (= ~d1_val~0Int 1)) (.cse5 (<= 2 ~b0_ev~0Int)) (.cse6 (<= 1 ~b1_val~0Int)) (.cse7 (= ~b0_req_up~0Int 0)) (.cse8 (<= 1 ~b0_val_t~0Int)) (.cse9 (<= 2 ~b1_ev~0Int)) (.cse10 (<= 1 ~d0_val~0Int)) (.cse11 (<= 1 ~b0_val~0Int)) (.cse12 (<= ~comp_m1_i~0Int 0)) (.cse13 (<= 2 ~z_ev~0Int)) (.cse14 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 ~z_val~0Int) .cse8 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|) .cse9 (<= ~z_val~0Int 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~z_req_up~0Int 0) .cse8 .cse9 .cse10 .cse11 (= ~z_val~0Int 0) .cse12 .cse13 .cse14))) [2022-01-10 18:26:44,603 INFO L858 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2022-01-10 18:26:44,603 INFO L854 garLoopResultBuilder]: At program point L414(lines 403 416) the Hoare annotation is: (let ((.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (<= 2 ~d0_ev~0Int)) (.cse4 (= ~d1_val~0Int 1)) (.cse5 (<= 2 ~b0_ev~0Int)) (.cse6 (<= 1 ~b1_val~0Int)) (.cse7 (= ~b0_req_up~0Int 0)) (.cse8 (<= 1 ~b0_val_t~0Int)) (.cse9 (<= 2 ~b1_ev~0Int)) (.cse10 (<= 1 ~d0_val~0Int)) (.cse11 (<= 1 ~b0_val~0Int)) (.cse12 (<= ~comp_m1_i~0Int 0)) (.cse13 (<= 2 ~z_ev~0Int)) (.cse14 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 ~z_val~0Int) .cse8 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|) .cse9 (<= ~z_val~0Int 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~z_req_up~0Int 0) .cse8 .cse9 .cse10 .cse11 (= ~z_val~0Int 0) .cse12 .cse13 .cse14))) [2022-01-10 18:26:44,603 INFO L854 garLoopResultBuilder]: At program point L415(lines 399 417) the Hoare annotation is: (let ((.cse0 (= ~d0_val_t~0Int 1)) (.cse1 (= ~d1_val_t~0Int 1)) (.cse2 (<= ~z_val_t~0Int 0)) (.cse3 (<= 2 ~d0_ev~0Int)) (.cse4 (= ~d1_val~0Int 1)) (.cse5 (<= 2 ~b0_ev~0Int)) (.cse6 (<= 1 ~b1_val~0Int)) (.cse7 (= ~b0_req_up~0Int 0)) (.cse8 (<= 1 ~b0_val_t~0Int)) (.cse9 (<= 2 ~b1_ev~0Int)) (.cse10 (<= 1 ~d0_val~0Int)) (.cse11 (<= 1 ~b0_val~0Int)) (.cse12 (<= ~comp_m1_i~0Int 0)) (.cse13 (<= 2 ~z_ev~0Int)) (.cse14 (<= 1 ~b1_val_t~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 ~z_val~0Int) .cse8 (<= 1 |ULTIMATE.start_ULTIMATE.start_method1_~s3~0#1Int|) .cse9 (<= ~z_val~0Int 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~z_req_up~0Int 0) .cse8 .cse9 .cse10 .cse11 (= ~z_val~0Int 0) .cse12 .cse13 .cse14))) [2022-01-10 18:26:44,603 INFO L858 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2022-01-10 18:26:44,605 INFO L732 BasicCegarLoop]: Path program histogram: [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-01-10 18:26:44,606 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 18:26:44,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:26:44 BasicIcfg [2022-01-10 18:26:44,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 18:26:44,705 INFO L158 Benchmark]: Toolchain (without parser) took 24378.07ms. Allocated memory was 176.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 119.6MB in the beginning and 535.5MB in the end (delta: -415.9MB). Peak memory consumption was 705.9MB. Max. memory is 8.0GB. [2022-01-10 18:26:44,705 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 176.2MB. Free memory is still 135.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 18:26:44,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.33ms. Allocated memory was 176.2MB in the beginning and 244.3MB in the end (delta: 68.2MB). Free memory was 119.4MB in the beginning and 214.2MB in the end (delta: -94.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-10 18:26:44,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.33ms. Allocated memory is still 244.3MB. Free memory was 214.2MB in the beginning and 211.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 18:26:44,705 INFO L158 Benchmark]: Boogie Preprocessor took 32.67ms. Allocated memory is still 244.3MB. Free memory was 211.6MB in the beginning and 210.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 18:26:44,705 INFO L158 Benchmark]: RCFGBuilder took 409.85ms. Allocated memory is still 244.3MB. Free memory was 210.0MB in the beginning and 190.6MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-01-10 18:26:44,705 INFO L158 Benchmark]: IcfgTransformer took 108.06ms. Allocated memory is still 244.3MB. Free memory was 190.6MB in the beginning and 182.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-01-10 18:26:44,705 INFO L158 Benchmark]: TraceAbstraction took 23485.22ms. Allocated memory was 244.3MB in the beginning and 1.2GB in the end (delta: 953.2MB). Free memory was 181.7MB in the beginning and 535.5MB in the end (delta: -353.8MB). Peak memory consumption was 699.0MB. Max. memory is 8.0GB. [2022-01-10 18:26:44,706 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 176.2MB. Free memory is still 135.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 290.33ms. Allocated memory was 176.2MB in the beginning and 244.3MB in the end (delta: 68.2MB). Free memory was 119.4MB in the beginning and 214.2MB in the end (delta: -94.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.33ms. Allocated memory is still 244.3MB. Free memory was 214.2MB in the beginning and 211.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.67ms. Allocated memory is still 244.3MB. Free memory was 211.6MB in the beginning and 210.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 409.85ms. Allocated memory is still 244.3MB. Free memory was 210.0MB in the beginning and 190.6MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * IcfgTransformer took 108.06ms. Allocated memory is still 244.3MB. Free memory was 190.6MB in the beginning and 182.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 23485.22ms. Allocated memory was 244.3MB in the beginning and 1.2GB in the end (delta: 953.2MB). Free memory was 181.7MB in the beginning and 535.5MB in the end (delta: -353.8MB). Peak memory consumption was 699.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 29, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3097 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3097 mSDsluCounter, 9123 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3674 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 282 IncrementalHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 5449 mSDtfsCounter, 282 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6625occurred in iteration=28, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 29 MinimizatonAttempts, 6078 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 37 PreInvPairs, 454 NumberOfFragments, 6694 HoareAnnotationTreeSize, 37 FomulaSimplifications, 8540 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 37 FomulaSimplificationsInter, 204042 FormulaSimplificationTreeSizeReductionInter, 15.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2651 NumberOfCodeBlocks, 2651 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2621 ConstructedInterpolants, 0 QuantifiedInterpolants, 4757 SizeOfPredicates, 2 NumberOfNonLiveVariables, 708 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 30 InterpolantComputations, 29 PerfectInterpolantSequences, 54/60 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: 148]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_req_up == 1bv32) && ~bvule32(2bv32, b0_ev)) && d1_ev == 2bv32) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && b0_ev == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_req_up == 1bv32) && d1_ev == 2bv32) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && ~bvule32(2bv32, d0_ev)) && d1_req_up == 1bv32) && ~bvule32(2bv32, b0_ev)) && d1_ev == 2bv32) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && b0_ev == 0bv32) && ~bvule32(z_val_t, 0bv32)) && ~bvule32(2bv32, d0_ev)) && d1_req_up == 1bv32) && d1_ev == 2bv32) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (z_val == 0bv32 && ~bvule32(comp_m1_i, 0bv32)) && b0_req_up == 0bv32 - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((b0_ev == 1bv32 && ~bvule32(1bv32, b1_val_t)) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((b0_ev == 1bv32 && ~bvule32(1bv32, b1_val_t)) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && b0_ev == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && b0_ev == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && b1_req_up == 1bv32) && ~bvule32(2bv32, d0_ev)) && d1_req_up == 1bv32) && b0_req_up == 1bv32) && ~bvule32(2bv32, b0_ev)) && d1_ev == 2bv32) && ~bvule32(1bv32, b0_val_t)) && d0_req_up == 1bv32) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule33(~bvadd32(~zero_extendFrom32To33(b1_val), 1bv33), ~zero_extendFrom32To33(b1_val_t)) - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: ((((((((((((((((((b0_ev == 1bv32 && ~bvule32(1bv32, b1_val_t)) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || ((((((((((((((((b0_ev == 1bv32 && ~bvule32(1bv32, b1_val_t)) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && ~bvule32(2bv32, d0_ev)) && d1_req_up == 1bv32) && ~bvule32(2bv32, b0_ev)) && d1_ev == 2bv32) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && d0_req_up == 1bv32) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && b0_ev == 0bv32) && ~bvule32(z_val_t, 0bv32)) && ~bvule32(2bv32, d0_ev)) && d1_req_up == 1bv32) && d1_ev == 2bv32) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && d0_req_up == 1bv32) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32 - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && b0_ev == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && b0_ev == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((b0_ev == 1bv32 && ~bvule32(1bv32, b1_val_t)) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((b0_ev == 1bv32 && ~bvule32(1bv32, b1_val_t)) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && b1_req_up == 1bv32) && ~bvule32(2bv32, d0_ev)) && d1_req_up == 1bv32) && ~bvule32(2bv32, b0_ev)) && d1_ev == 2bv32) && ~bvule32(1bv32, b0_val_t)) && d0_req_up == 1bv32) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule33(~bvadd32(~zero_extendFrom32To33(b1_val), 1bv33), ~zero_extendFrom32To33(b1_val_t))) && b0_req_up == 0bv32) || ((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && b0_ev == 0bv32) && ~bvule32(z_val_t, 0bv32)) && b1_req_up == 1bv32) && ~bvule32(2bv32, d0_ev)) && d1_req_up == 1bv32) && d1_ev == 2bv32) && ~bvule32(1bv32, b0_val_t)) && d0_req_up == 1bv32) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule33(~bvadd32(~zero_extendFrom32To33(b1_val), 1bv33), ~zero_extendFrom32To33(b1_val_t))) && b0_req_up == 0bv32) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && b0_ev == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && b0_ev == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((b0_ev == 1bv32 && ~bvule32(1bv32, b1_val_t)) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((b0_ev == 1bv32 && ~bvule32(1bv32, b1_val_t)) && d1_val_t == 1bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && b1_ev == 1bv32) && d0_ev == 1bv32) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(2bv32, comp_m1_st)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32)) || ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32)) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && b1_ev == 0bv32) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && d0_ev == 0bv32) && b0_req_up == 0bv32) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(z_req_up, 0bv32)) && ~bvule32(2bv32, z_ev)) && z_val == 0bv32) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) || (((((((((((((((((~bvule32(1bv32, b1_val_t) && d1_val_t == 1bv32) && ~bvule32(2bv32, b1_ev)) && ~bvule32(2bv32, z_ev)) && ~bvule32(z_val_t, 0bv32)) && d1_val == 1bv32) && ~bvule32(2bv32, d0_ev)) && ~bvule32(1bv32, s3)) && ~bvule32(2bv32, b0_ev)) && ~bvule32(1bv32, b1_val)) && ~bvule32(1bv32, b0_val_t)) && ~bvule32(z_val, 0bv32)) && ~bvule32(comp_m1_i, 0bv32)) && d0_val_t == 1bv32) && ~bvule32(0bv32, z_val)) && ~bvule32(1bv32, b0_val)) && ~bvule32(1bv32, d0_val)) && b0_req_up == 0bv32) RESULT: Ultimate proved your program to be correct! [2022-01-10 18:26:44,778 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...