/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_NONE.epf -i ../../../trunk/examples/svcomp/systemc/bist_cell.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:15:57,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:15:57,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:15:57,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:15:57,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:15:57,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:15:57,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:15:57,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:15:57,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:15:57,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:15:57,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:15:57,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:15:57,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:15:57,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:15:57,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:15:57,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:15:57,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:15:57,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:15:57,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:15:57,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:15:58,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:15:58,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:15:58,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:15:58,004 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:15:58,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:15:58,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:15:58,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:15:58,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:15:58,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:15:58,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:15:58,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:15:58,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:15:58,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:15:58,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:15:58,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:15:58,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:15:58,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:15:58,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:15:58,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:15:58,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:15:58,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:15:58,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 00:15:58,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:15:58,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:15:58,063 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:15:58,063 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:15:58,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:15:58,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:15:58,067 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:15:58,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:15:58,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:15:58,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:15:58,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:15:58,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:15:58,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:15:58,068 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:15:58,068 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:15:58,068 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:15:58,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:15:58,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:15:58,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:15:58,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:15:58,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:15:58,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:15:58,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:15:58,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:15:58,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:15:58,070 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:15:58,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:15:58,070 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:15:58,071 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:15:58,071 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:15:58,071 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:15:58,071 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:15:58,072 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:15:58,072 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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-11 00:15:58,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:15:58,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:15:58,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:15:58,236 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:15:58,237 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:15:58,238 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-11 00:15:58,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d51fd84e/8da6dfa52f52427696f95b99c5f578b0/FLAG39aae9a50 [2022-01-11 00:15:58,645 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:15:58,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c [2022-01-11 00:15:58,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d51fd84e/8da6dfa52f52427696f95b99c5f578b0/FLAG39aae9a50 [2022-01-11 00:15:58,658 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d51fd84e/8da6dfa52f52427696f95b99c5f578b0 [2022-01-11 00:15:58,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:15:58,660 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:15:58,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:15:58,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:15:58,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:15:58,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:15:58" (1/1) ... [2022-01-11 00:15:58,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625b2190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:58, skipping insertion in model container [2022-01-11 00:15:58,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:15:58" (1/1) ... [2022-01-11 00:15:58,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:15:58,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:15:58,766 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-11 00:15:58,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:15:58,848 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:15:58,855 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-11 00:15:58,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:15:58,880 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:15:58,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:58 WrapperNode [2022-01-11 00:15:58,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:15:58,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:15:58,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:15:58,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:15:58,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:58" (1/1) ... [2022-01-11 00:15:58,898 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:58" (1/1) ... [2022-01-11 00:15:58,914 INFO L137 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 25, calls inlined = 31, statements flattened = 344 [2022-01-11 00:15:58,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:15:58,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:15:58,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:15:58,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:15:58,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:58" (1/1) ... [2022-01-11 00:15:58,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:58" (1/1) ... [2022-01-11 00:15:58,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:58" (1/1) ... [2022-01-11 00:15:58,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:58" (1/1) ... [2022-01-11 00:15:58,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:58" (1/1) ... [2022-01-11 00:15:58,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:58" (1/1) ... [2022-01-11 00:15:58,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:58" (1/1) ... [2022-01-11 00:15:58,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:15:58,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:15:58,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:15:58,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:15:58,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:58" (1/1) ... [2022-01-11 00:15:58,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:15:58,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:15:58,968 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-11 00:15:58,980 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-11 00:15:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:15:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:15:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:15:58,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:15:59,041 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:15:59,042 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:15:59,303 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:15:59,309 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:15:59,310 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-11 00:15:59,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:15:59 BoogieIcfgContainer [2022-01-11 00:15:59,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:15:59,312 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:15:59,312 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:15:59,312 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:15:59,314 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:15:59" (1/1) ... [2022-01-11 00:15:59,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:15:59 BasicIcfg [2022-01-11 00:15:59,416 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:15:59,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:15:59,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:15:59,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:15:59,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:15:58" (1/4) ... [2022-01-11 00:15:59,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12bceaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:15:59, skipping insertion in model container [2022-01-11 00:15:59,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:58" (2/4) ... [2022-01-11 00:15:59,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12bceaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:15:59, skipping insertion in model container [2022-01-11 00:15:59,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:15:59" (3/4) ... [2022-01-11 00:15:59,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12bceaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:15:59, skipping insertion in model container [2022-01-11 00:15:59,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:15:59" (4/4) ... [2022-01-11 00:15:59,422 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.cTransformedIcfg [2022-01-11 00:15:59,425 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:15:59,425 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 00:15:59,458 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:15:59,468 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-11 00:15:59,469 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 00:15:59,481 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-11 00:15:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-11 00:15:59,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:15:59,485 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-11 00:15:59,486 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:15:59,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:15:59,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1988259245, now seen corresponding path program 1 times [2022-01-11 00:15:59,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:15:59,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403382325] [2022-01-11 00:15:59,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:15:59,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:15:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:59,688 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-11 00:15:59,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:15:59,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403382325] [2022-01-11 00:15:59,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403382325] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:15:59,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:15:59,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:15:59,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246635458] [2022-01-11 00:15:59,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:15:59,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:15:59,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:15:59,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:15:59,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:15:59,720 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-11 00:15:59,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:15:59,780 INFO L93 Difference]: Finished difference Result 244 states and 386 transitions. [2022-01-11 00:15:59,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:15:59,782 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-11 00:15:59,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:15:59,791 INFO L225 Difference]: With dead ends: 244 [2022-01-11 00:15:59,791 INFO L226 Difference]: Without dead ends: 121 [2022-01-11 00:15:59,794 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-11 00:15:59,799 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-11 00:15:59,799 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-11 00:15:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-11 00:15:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-01-11 00:15:59,831 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-11 00:15:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 187 transitions. [2022-01-11 00:15:59,834 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 187 transitions. Word has length 32 [2022-01-11 00:15:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:15:59,835 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 187 transitions. [2022-01-11 00:15:59,835 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-11 00:15:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 187 transitions. [2022-01-11 00:15:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-11 00:15:59,839 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:15:59,840 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-11 00:15:59,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:15:59,840 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:15:59,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:15:59,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1280030136, now seen corresponding path program 1 times [2022-01-11 00:15:59,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:15:59,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46737679] [2022-01-11 00:15:59,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:15:59,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:15:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:59,931 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-11 00:15:59,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:15:59,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46737679] [2022-01-11 00:15:59,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46737679] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:15:59,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:15:59,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:15:59,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367699906] [2022-01-11 00:15:59,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:15:59,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:15:59,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:15:59,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:15:59,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:15:59,933 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-11 00:15:59,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:15:59,954 INFO L93 Difference]: Finished difference Result 231 states and 360 transitions. [2022-01-11 00:15:59,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:15:59,955 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-11 00:15:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:15:59,956 INFO L225 Difference]: With dead ends: 231 [2022-01-11 00:15:59,956 INFO L226 Difference]: Without dead ends: 121 [2022-01-11 00:15:59,956 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-11 00:15:59,957 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-11 00:15:59,958 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-11 00:15:59,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-11 00:15:59,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-01-11 00:15:59,963 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-11 00:15:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 186 transitions. [2022-01-11 00:15:59,964 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 186 transitions. Word has length 73 [2022-01-11 00:15:59,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:15:59,964 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 186 transitions. [2022-01-11 00:15:59,964 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-11 00:15:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 186 transitions. [2022-01-11 00:15:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-11 00:15:59,965 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:15:59,965 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-11 00:15:59,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:15:59,966 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:15:59,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:15:59,966 INFO L85 PathProgramCache]: Analyzing trace with hash 938707956, now seen corresponding path program 1 times [2022-01-11 00:15:59,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:15:59,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666325202] [2022-01-11 00:15:59,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:15:59,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:15:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:00,014 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-11 00:16:00,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:00,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666325202] [2022-01-11 00:16:00,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666325202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:00,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:00,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:00,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289374431] [2022-01-11 00:16:00,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:00,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:00,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:00,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:00,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:00,016 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-11 00:16:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:00,032 INFO L93 Difference]: Finished difference Result 233 states and 361 transitions. [2022-01-11 00:16:00,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:00,032 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-11 00:16:00,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:00,033 INFO L225 Difference]: With dead ends: 233 [2022-01-11 00:16:00,033 INFO L226 Difference]: Without dead ends: 121 [2022-01-11 00:16:00,034 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-11 00:16:00,034 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-11 00:16:00,035 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-11 00:16:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-11 00:16:00,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-01-11 00:16:00,040 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-11 00:16:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 185 transitions. [2022-01-11 00:16:00,040 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 185 transitions. Word has length 76 [2022-01-11 00:16:00,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:00,041 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 185 transitions. [2022-01-11 00:16:00,041 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-11 00:16:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 185 transitions. [2022-01-11 00:16:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-11 00:16:00,042 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:00,042 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-11 00:16:00,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 00:16:00,042 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:00,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:00,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1685745771, now seen corresponding path program 1 times [2022-01-11 00:16:00,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:00,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018966837] [2022-01-11 00:16:00,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:00,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:00,086 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-11 00:16:00,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:00,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018966837] [2022-01-11 00:16:00,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018966837] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:00,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:00,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:00,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728737259] [2022-01-11 00:16:00,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:00,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:00,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:00,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:00,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:00,088 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-11 00:16:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:00,118 INFO L93 Difference]: Finished difference Result 227 states and 352 transitions. [2022-01-11 00:16:00,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:00,120 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-11 00:16:00,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:00,120 INFO L225 Difference]: With dead ends: 227 [2022-01-11 00:16:00,121 INFO L226 Difference]: Without dead ends: 121 [2022-01-11 00:16:00,123 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-11 00:16:00,123 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-11 00:16:00,124 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-11 00:16:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-11 00:16:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-01-11 00:16:00,128 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-11 00:16:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2022-01-11 00:16:00,129 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 76 [2022-01-11 00:16:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:00,129 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2022-01-11 00:16:00,129 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-11 00:16:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2022-01-11 00:16:00,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-11 00:16:00,130 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:00,130 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-11 00:16:00,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:16:00,131 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:00,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:00,131 INFO L85 PathProgramCache]: Analyzing trace with hash -663957676, now seen corresponding path program 1 times [2022-01-11 00:16:00,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:00,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822582595] [2022-01-11 00:16:00,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:00,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:00,177 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-11 00:16:00,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:00,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822582595] [2022-01-11 00:16:00,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822582595] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:00,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:00,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:00,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126468604] [2022-01-11 00:16:00,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:00,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:00,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:00,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:00,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:00,180 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-11 00:16:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:00,194 INFO L93 Difference]: Finished difference Result 223 states and 345 transitions. [2022-01-11 00:16:00,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:00,194 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-11 00:16:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:00,195 INFO L225 Difference]: With dead ends: 223 [2022-01-11 00:16:00,195 INFO L226 Difference]: Without dead ends: 121 [2022-01-11 00:16:00,197 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-11 00:16:00,201 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-11 00:16:00,201 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-11 00:16:00,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-11 00:16:00,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-01-11 00:16:00,208 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-11 00:16:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 183 transitions. [2022-01-11 00:16:00,208 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 183 transitions. Word has length 79 [2022-01-11 00:16:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:00,208 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 183 transitions. [2022-01-11 00:16:00,209 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-11 00:16:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 183 transitions. [2022-01-11 00:16:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-11 00:16:00,210 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:00,210 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-11 00:16:00,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 00:16:00,210 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:00,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:00,210 INFO L85 PathProgramCache]: Analyzing trace with hash 864822698, now seen corresponding path program 1 times [2022-01-11 00:16:00,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:00,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161879220] [2022-01-11 00:16:00,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:00,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:00,291 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-11 00:16:00,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:00,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161879220] [2022-01-11 00:16:00,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161879220] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:00,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:00,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:00,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481334410] [2022-01-11 00:16:00,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:00,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:00,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:00,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:00,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:00,293 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-11 00:16:00,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:00,305 INFO L93 Difference]: Finished difference Result 217 states and 335 transitions. [2022-01-11 00:16:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:00,306 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-11 00:16:00,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:00,307 INFO L225 Difference]: With dead ends: 217 [2022-01-11 00:16:00,307 INFO L226 Difference]: Without dead ends: 121 [2022-01-11 00:16:00,308 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-11 00:16:00,313 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-11 00:16:00,315 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-11 00:16:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-11 00:16:00,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-01-11 00:16:00,320 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-11 00:16:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 182 transitions. [2022-01-11 00:16:00,321 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 182 transitions. Word has length 82 [2022-01-11 00:16:00,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:00,321 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 182 transitions. [2022-01-11 00:16:00,321 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-11 00:16:00,321 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 182 transitions. [2022-01-11 00:16:00,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-11 00:16:00,322 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:00,322 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-11 00:16:00,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 00:16:00,322 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:00,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:00,323 INFO L85 PathProgramCache]: Analyzing trace with hash -301873621, now seen corresponding path program 1 times [2022-01-11 00:16:00,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:00,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324157389] [2022-01-11 00:16:00,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:00,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:00,376 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-11 00:16:00,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:00,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324157389] [2022-01-11 00:16:00,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324157389] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:00,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:00,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:00,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650808267] [2022-01-11 00:16:00,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:00,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:00,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:00,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:00,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:00,378 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-11 00:16:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:00,404 INFO L93 Difference]: Finished difference Result 311 states and 479 transitions. [2022-01-11 00:16:00,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:00,405 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-11 00:16:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:00,407 INFO L225 Difference]: With dead ends: 311 [2022-01-11 00:16:00,407 INFO L226 Difference]: Without dead ends: 221 [2022-01-11 00:16:00,407 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-11 00:16:00,408 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-11 00:16:00,408 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-11 00:16:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-01-11 00:16:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2022-01-11 00:16:00,429 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-11 00:16:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 331 transitions. [2022-01-11 00:16:00,429 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 331 transitions. Word has length 82 [2022-01-11 00:16:00,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:00,429 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 331 transitions. [2022-01-11 00:16:00,430 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-11 00:16:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 331 transitions. [2022-01-11 00:16:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-11 00:16:00,433 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:00,434 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-11 00:16:00,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 00:16:00,434 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:00,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:00,435 INFO L85 PathProgramCache]: Analyzing trace with hash 740672363, now seen corresponding path program 1 times [2022-01-11 00:16:00,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:00,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012236913] [2022-01-11 00:16:00,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:00,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:00,483 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-11 00:16:00,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:00,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012236913] [2022-01-11 00:16:00,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012236913] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:00,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:00,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:00,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825684065] [2022-01-11 00:16:00,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:00,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:00,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:00,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:00,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:00,485 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-11 00:16:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:00,516 INFO L93 Difference]: Finished difference Result 613 states and 947 transitions. [2022-01-11 00:16:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:00,517 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-11 00:16:00,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:00,518 INFO L225 Difference]: With dead ends: 613 [2022-01-11 00:16:00,518 INFO L226 Difference]: Without dead ends: 429 [2022-01-11 00:16:00,519 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-11 00:16:00,519 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-11 00:16:00,519 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-11 00:16:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-01-11 00:16:00,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 425. [2022-01-11 00:16:00,532 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-11 00:16:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 641 transitions. [2022-01-11 00:16:00,535 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 641 transitions. Word has length 82 [2022-01-11 00:16:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:00,541 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 641 transitions. [2022-01-11 00:16:00,541 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-11 00:16:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 641 transitions. [2022-01-11 00:16:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-11 00:16:00,543 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:00,543 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-11 00:16:00,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 00:16:00,543 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:00,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:00,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1710253386, now seen corresponding path program 1 times [2022-01-11 00:16:00,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:00,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692258558] [2022-01-11 00:16:00,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:00,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:00,582 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-11 00:16:00,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:00,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692258558] [2022-01-11 00:16:00,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692258558] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:00,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:00,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:00,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093825248] [2022-01-11 00:16:00,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:00,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:00,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:00,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:00,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:00,584 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-11 00:16:00,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:00,611 INFO L93 Difference]: Finished difference Result 793 states and 1216 transitions. [2022-01-11 00:16:00,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:00,612 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-11 00:16:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:00,614 INFO L225 Difference]: With dead ends: 793 [2022-01-11 00:16:00,615 INFO L226 Difference]: Without dead ends: 469 [2022-01-11 00:16:00,615 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-11 00:16:00,617 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-11 00:16:00,617 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-11 00:16:00,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-01-11 00:16:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2022-01-11 00:16:00,627 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-11 00:16:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 703 transitions. [2022-01-11 00:16:00,628 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 703 transitions. Word has length 82 [2022-01-11 00:16:00,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:00,628 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 703 transitions. [2022-01-11 00:16:00,628 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-11 00:16:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 703 transitions. [2022-01-11 00:16:00,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-11 00:16:00,629 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:00,629 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-11 00:16:00,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 00:16:00,629 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:00,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:00,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1215805366, now seen corresponding path program 1 times [2022-01-11 00:16:00,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:00,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665245704] [2022-01-11 00:16:00,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:00,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:00,668 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-11 00:16:00,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:00,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665245704] [2022-01-11 00:16:00,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665245704] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:00,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:00,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:00,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380036719] [2022-01-11 00:16:00,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:00,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:00,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:00,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:00,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:00,670 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-11 00:16:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:00,711 INFO L93 Difference]: Finished difference Result 1105 states and 1681 transitions. [2022-01-11 00:16:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:00,711 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-11 00:16:00,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:00,714 INFO L225 Difference]: With dead ends: 1105 [2022-01-11 00:16:00,714 INFO L226 Difference]: Without dead ends: 795 [2022-01-11 00:16:00,715 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-11 00:16:00,715 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-11 00:16:00,716 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-11 00:16:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-01-11 00:16:00,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 791. [2022-01-11 00:16:00,732 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-11 00:16:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1188 transitions. [2022-01-11 00:16:00,734 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1188 transitions. Word has length 83 [2022-01-11 00:16:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:00,734 INFO L470 AbstractCegarLoop]: Abstraction has 791 states and 1188 transitions. [2022-01-11 00:16:00,734 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-11 00:16:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1188 transitions. [2022-01-11 00:16:00,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-11 00:16:00,736 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:00,736 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-11 00:16:00,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 00:16:00,737 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:00,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:00,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2109580907, now seen corresponding path program 1 times [2022-01-11 00:16:00,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:00,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234079734] [2022-01-11 00:16:00,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:00,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:00,773 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-11 00:16:00,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:00,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234079734] [2022-01-11 00:16:00,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234079734] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:00,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:00,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:00,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616646017] [2022-01-11 00:16:00,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:00,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:00,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:00,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:00,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:00,775 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-11 00:16:00,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:00,807 INFO L93 Difference]: Finished difference Result 1607 states and 2427 transitions. [2022-01-11 00:16:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:00,807 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-11 00:16:00,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:00,810 INFO L225 Difference]: With dead ends: 1607 [2022-01-11 00:16:00,810 INFO L226 Difference]: Without dead ends: 927 [2022-01-11 00:16:00,811 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-11 00:16:00,812 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-11 00:16:00,814 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-11 00:16:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2022-01-11 00:16:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 927. [2022-01-11 00:16:00,834 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-11 00:16:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1374 transitions. [2022-01-11 00:16:00,835 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1374 transitions. Word has length 83 [2022-01-11 00:16:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:00,836 INFO L470 AbstractCegarLoop]: Abstraction has 927 states and 1374 transitions. [2022-01-11 00:16:00,836 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-11 00:16:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1374 transitions. [2022-01-11 00:16:00,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-11 00:16:00,839 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:00,839 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-11 00:16:00,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 00:16:00,839 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:00,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1829231018, now seen corresponding path program 1 times [2022-01-11 00:16:00,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:00,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036278099] [2022-01-11 00:16:00,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:00,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:00,861 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-11 00:16:00,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:00,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036278099] [2022-01-11 00:16:00,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036278099] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:00,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:00,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:00,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948127731] [2022-01-11 00:16:00,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:00,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:00,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:00,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:00,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:00,863 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-11 00:16:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:00,887 INFO L93 Difference]: Finished difference Result 1415 states and 2087 transitions. [2022-01-11 00:16:00,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:00,887 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-11 00:16:00,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:00,889 INFO L225 Difference]: With dead ends: 1415 [2022-01-11 00:16:00,889 INFO L226 Difference]: Without dead ends: 599 [2022-01-11 00:16:00,890 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-11 00:16:00,891 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-11 00:16:00,891 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-11 00:16:00,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-01-11 00:16:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2022-01-11 00:16:00,903 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-11 00:16:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 848 transitions. [2022-01-11 00:16:00,904 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 848 transitions. Word has length 83 [2022-01-11 00:16:00,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:00,904 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 848 transitions. [2022-01-11 00:16:00,905 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-11 00:16:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 848 transitions. [2022-01-11 00:16:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-11 00:16:00,906 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:00,906 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-11 00:16:00,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 00:16:00,906 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:00,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:00,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2043514920, now seen corresponding path program 1 times [2022-01-11 00:16:00,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:00,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324189036] [2022-01-11 00:16:00,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:00,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:00,932 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-11 00:16:00,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:00,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324189036] [2022-01-11 00:16:00,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324189036] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:00,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:00,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:00,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939709728] [2022-01-11 00:16:00,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:00,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:00,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:00,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:00,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:00,933 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-11 00:16:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:00,960 INFO L93 Difference]: Finished difference Result 939 states and 1329 transitions. [2022-01-11 00:16:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:00,960 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-11 00:16:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:00,961 INFO L225 Difference]: With dead ends: 939 [2022-01-11 00:16:00,961 INFO L226 Difference]: Without dead ends: 437 [2022-01-11 00:16:00,962 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-11 00:16:00,962 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-11 00:16:00,963 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-11 00:16:00,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-01-11 00:16:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2022-01-11 00:16:00,973 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-11 00:16:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 595 transitions. [2022-01-11 00:16:00,974 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 595 transitions. Word has length 83 [2022-01-11 00:16:00,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:00,974 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 595 transitions. [2022-01-11 00:16:00,974 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-11 00:16:00,974 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 595 transitions. [2022-01-11 00:16:00,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-11 00:16:00,975 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:00,975 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-11 00:16:00,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 00:16:00,975 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:00,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:00,975 INFO L85 PathProgramCache]: Analyzing trace with hash -446645874, now seen corresponding path program 1 times [2022-01-11 00:16:00,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:00,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019491721] [2022-01-11 00:16:00,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:00,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:01,008 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-11 00:16:01,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:01,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019491721] [2022-01-11 00:16:01,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019491721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:01,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:01,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:01,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151667759] [2022-01-11 00:16:01,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:01,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:01,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:01,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:01,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:01,010 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-11 00:16:01,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:01,045 INFO L93 Difference]: Finished difference Result 1221 states and 1679 transitions. [2022-01-11 00:16:01,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:01,045 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-11 00:16:01,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:01,047 INFO L225 Difference]: With dead ends: 1221 [2022-01-11 00:16:01,047 INFO L226 Difference]: Without dead ends: 853 [2022-01-11 00:16:01,048 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-11 00:16:01,048 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-11 00:16:01,048 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-11 00:16:01,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2022-01-11 00:16:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 849. [2022-01-11 00:16:01,072 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-11 00:16:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1145 transitions. [2022-01-11 00:16:01,073 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1145 transitions. Word has length 84 [2022-01-11 00:16:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:01,074 INFO L470 AbstractCegarLoop]: Abstraction has 849 states and 1145 transitions. [2022-01-11 00:16:01,074 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-11 00:16:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1145 transitions. [2022-01-11 00:16:01,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-11 00:16:01,075 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:01,075 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-11 00:16:01,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 00:16:01,075 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:01,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:01,076 INFO L85 PathProgramCache]: Analyzing trace with hash 522935149, now seen corresponding path program 1 times [2022-01-11 00:16:01,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:01,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960080361] [2022-01-11 00:16:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:01,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:01,100 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-11 00:16:01,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:01,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960080361] [2022-01-11 00:16:01,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960080361] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:01,100 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:01,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:01,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721672376] [2022-01-11 00:16:01,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:01,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:01,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:01,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:01,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:01,101 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-11 00:16:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:01,136 INFO L93 Difference]: Finished difference Result 1617 states and 2201 transitions. [2022-01-11 00:16:01,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:01,136 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-11 00:16:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:01,138 INFO L225 Difference]: With dead ends: 1617 [2022-01-11 00:16:01,138 INFO L226 Difference]: Without dead ends: 975 [2022-01-11 00:16:01,141 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-11 00:16:01,142 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-11 00:16:01,142 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-11 00:16:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2022-01-11 00:16:01,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2022-01-11 00:16:01,163 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-11 00:16:01,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1301 transitions. [2022-01-11 00:16:01,165 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1301 transitions. Word has length 84 [2022-01-11 00:16:01,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:01,165 INFO L470 AbstractCegarLoop]: Abstraction has 975 states and 1301 transitions. [2022-01-11 00:16:01,165 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-11 00:16:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1301 transitions. [2022-01-11 00:16:01,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-11 00:16:01,166 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:01,167 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-11 00:16:01,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 00:16:01,167 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:01,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:01,167 INFO L85 PathProgramCache]: Analyzing trace with hash 803285038, now seen corresponding path program 1 times [2022-01-11 00:16:01,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:01,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943910105] [2022-01-11 00:16:01,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:01,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:01,189 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-11 00:16:01,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:01,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943910105] [2022-01-11 00:16:01,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943910105] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:01,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:01,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:01,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537566973] [2022-01-11 00:16:01,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:01,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:01,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:01,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:01,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:01,192 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-11 00:16:01,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:01,222 INFO L93 Difference]: Finished difference Result 1497 states and 2004 transitions. [2022-01-11 00:16:01,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:01,222 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-11 00:16:01,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:01,224 INFO L225 Difference]: With dead ends: 1497 [2022-01-11 00:16:01,224 INFO L226 Difference]: Without dead ends: 723 [2022-01-11 00:16:01,226 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-11 00:16:01,227 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-11 00:16:01,227 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-11 00:16:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-01-11 00:16:01,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2022-01-11 00:16:01,265 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-11 00:16:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 931 transitions. [2022-01-11 00:16:01,267 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 931 transitions. Word has length 84 [2022-01-11 00:16:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:01,267 INFO L470 AbstractCegarLoop]: Abstraction has 723 states and 931 transitions. [2022-01-11 00:16:01,267 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-11 00:16:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 931 transitions. [2022-01-11 00:16:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-11 00:16:01,268 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:01,268 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-11 00:16:01,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 00:16:01,269 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:01,269 INFO L85 PathProgramCache]: Analyzing trace with hash -569421633, now seen corresponding path program 1 times [2022-01-11 00:16:01,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:01,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783171662] [2022-01-11 00:16:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:01,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:01,307 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-11 00:16:01,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:01,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783171662] [2022-01-11 00:16:01,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783171662] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:01,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:01,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:01,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157007182] [2022-01-11 00:16:01,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:01,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:01,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:01,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:01,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:01,308 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-11 00:16:01,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:01,327 INFO L93 Difference]: Finished difference Result 1025 states and 1337 transitions. [2022-01-11 00:16:01,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:01,328 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-11 00:16:01,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:01,329 INFO L225 Difference]: With dead ends: 1025 [2022-01-11 00:16:01,329 INFO L226 Difference]: Without dead ends: 509 [2022-01-11 00:16:01,330 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-11 00:16:01,330 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-11 00:16:01,331 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-11 00:16:01,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-01-11 00:16:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2022-01-11 00:16:01,344 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-11 00:16:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 649 transitions. [2022-01-11 00:16:01,345 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 649 transitions. Word has length 85 [2022-01-11 00:16:01,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:01,345 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 649 transitions. [2022-01-11 00:16:01,345 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-11 00:16:01,345 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 649 transitions. [2022-01-11 00:16:01,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-11 00:16:01,346 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:01,346 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-11 00:16:01,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 00:16:01,346 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:01,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:01,346 INFO L85 PathProgramCache]: Analyzing trace with hash 407352442, now seen corresponding path program 1 times [2022-01-11 00:16:01,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:01,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013489880] [2022-01-11 00:16:01,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:01,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:01,373 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-11 00:16:01,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:01,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013489880] [2022-01-11 00:16:01,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013489880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:01,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:01,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:01,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073910506] [2022-01-11 00:16:01,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:01,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:01,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:01,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:01,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:01,374 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-11 00:16:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:01,419 INFO L93 Difference]: Finished difference Result 1365 states and 1755 transitions. [2022-01-11 00:16:01,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:01,419 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-11 00:16:01,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:01,422 INFO L225 Difference]: With dead ends: 1365 [2022-01-11 00:16:01,422 INFO L226 Difference]: Without dead ends: 981 [2022-01-11 00:16:01,422 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-11 00:16:01,422 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-11 00:16:01,423 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-11 00:16:01,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-01-11 00:16:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 977. [2022-01-11 00:16:01,456 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-11 00:16:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1229 transitions. [2022-01-11 00:16:01,457 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1229 transitions. Word has length 85 [2022-01-11 00:16:01,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:01,458 INFO L470 AbstractCegarLoop]: Abstraction has 977 states and 1229 transitions. [2022-01-11 00:16:01,458 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-11 00:16:01,458 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1229 transitions. [2022-01-11 00:16:01,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-11 00:16:01,459 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:01,459 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-11 00:16:01,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 00:16:01,459 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:01,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1286914365, now seen corresponding path program 1 times [2022-01-11 00:16:01,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:01,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128220296] [2022-01-11 00:16:01,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:01,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:01,499 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-11 00:16:01,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:01,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128220296] [2022-01-11 00:16:01,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128220296] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:01,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:01,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:01,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878938603] [2022-01-11 00:16:01,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:01,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:01,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:01,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:01,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:01,501 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-11 00:16:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:01,553 INFO L93 Difference]: Finished difference Result 1281 states and 1624 transitions. [2022-01-11 00:16:01,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:01,553 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-11 00:16:01,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:01,556 INFO L225 Difference]: With dead ends: 1281 [2022-01-11 00:16:01,556 INFO L226 Difference]: Without dead ends: 1277 [2022-01-11 00:16:01,557 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-11 00:16:01,557 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-11 00:16:01,557 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-11 00:16:01,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2022-01-11 00:16:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1277. [2022-01-11 00:16:01,605 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-11 00:16:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1619 transitions. [2022-01-11 00:16:01,608 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1619 transitions. Word has length 85 [2022-01-11 00:16:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:01,609 INFO L470 AbstractCegarLoop]: Abstraction has 1277 states and 1619 transitions. [2022-01-11 00:16:01,609 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-11 00:16:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1619 transitions. [2022-01-11 00:16:01,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-11 00:16:01,611 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:01,611 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-11 00:16:01,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 00:16:01,611 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:01,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:01,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1761249962, now seen corresponding path program 1 times [2022-01-11 00:16:01,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:01,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668499802] [2022-01-11 00:16:01,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:01,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:01,638 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-11 00:16:01,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:01,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668499802] [2022-01-11 00:16:01,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668499802] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:01,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:01,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:01,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497437524] [2022-01-11 00:16:01,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:01,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:01,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:01,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:01,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:01,640 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-11 00:16:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:01,704 INFO L93 Difference]: Finished difference Result 3133 states and 4030 transitions. [2022-01-11 00:16:01,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:01,704 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-11 00:16:01,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:01,710 INFO L225 Difference]: With dead ends: 3133 [2022-01-11 00:16:01,710 INFO L226 Difference]: Without dead ends: 1917 [2022-01-11 00:16:01,712 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-11 00:16:01,712 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-11 00:16:01,713 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-11 00:16:01,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2022-01-11 00:16:01,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1847. [2022-01-11 00:16:01,772 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-11 00:16:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2326 transitions. [2022-01-11 00:16:01,775 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2326 transitions. Word has length 88 [2022-01-11 00:16:01,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:01,775 INFO L470 AbstractCegarLoop]: Abstraction has 1847 states and 2326 transitions. [2022-01-11 00:16:01,775 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-11 00:16:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2326 transitions. [2022-01-11 00:16:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-11 00:16:01,776 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:01,776 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-11 00:16:01,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 00:16:01,777 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:01,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:01,777 INFO L85 PathProgramCache]: Analyzing trace with hash 633799432, now seen corresponding path program 1 times [2022-01-11 00:16:01,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:01,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279330357] [2022-01-11 00:16:01,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:01,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:01,824 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-11 00:16:01,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:01,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279330357] [2022-01-11 00:16:01,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279330357] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:01,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:01,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:16:01,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099952844] [2022-01-11 00:16:01,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:01,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:16:01,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:01,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:16:01,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:16:01,825 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-11 00:16:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:01,916 INFO L93 Difference]: Finished difference Result 3495 states and 4433 transitions. [2022-01-11 00:16:01,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:16:01,917 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-11 00:16:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:01,921 INFO L225 Difference]: With dead ends: 3495 [2022-01-11 00:16:01,921 INFO L226 Difference]: Without dead ends: 1847 [2022-01-11 00:16:01,922 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-11 00:16:01,922 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-11 00:16:01,923 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-11 00:16:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2022-01-11 00:16:01,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2022-01-11 00:16:01,976 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-11 00:16:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2320 transitions. [2022-01-11 00:16:01,979 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2320 transitions. Word has length 103 [2022-01-11 00:16:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:01,979 INFO L470 AbstractCegarLoop]: Abstraction has 1847 states and 2320 transitions. [2022-01-11 00:16:01,979 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-11 00:16:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2320 transitions. [2022-01-11 00:16:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-11 00:16:01,981 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:01,981 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-11 00:16:01,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 00:16:01,981 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:01,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:01,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1295290437, now seen corresponding path program 1 times [2022-01-11 00:16:01,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:01,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487848163] [2022-01-11 00:16:01,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:01,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:02,008 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-11 00:16:02,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:02,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487848163] [2022-01-11 00:16:02,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487848163] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:02,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:02,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:16:02,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951956933] [2022-01-11 00:16:02,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:02,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:16:02,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:02,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:16:02,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:16:02,010 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-11 00:16:02,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:02,075 INFO L93 Difference]: Finished difference Result 3495 states and 4421 transitions. [2022-01-11 00:16:02,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:16:02,075 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-11 00:16:02,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:02,079 INFO L225 Difference]: With dead ends: 3495 [2022-01-11 00:16:02,080 INFO L226 Difference]: Without dead ends: 1847 [2022-01-11 00:16:02,081 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-11 00:16:02,081 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-11 00:16:02,081 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-11 00:16:02,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2022-01-11 00:16:02,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2022-01-11 00:16:02,157 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-11 00:16:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2314 transitions. [2022-01-11 00:16:02,160 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2314 transitions. Word has length 104 [2022-01-11 00:16:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:02,160 INFO L470 AbstractCegarLoop]: Abstraction has 1847 states and 2314 transitions. [2022-01-11 00:16:02,160 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-11 00:16:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2314 transitions. [2022-01-11 00:16:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-11 00:16:02,162 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:02,162 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-11 00:16:02,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 00:16:02,162 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:02,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:02,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2073081306, now seen corresponding path program 1 times [2022-01-11 00:16:02,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:02,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050165550] [2022-01-11 00:16:02,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:02,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:02,183 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-11 00:16:02,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:02,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050165550] [2022-01-11 00:16:02,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050165550] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:02,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:02,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:02,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29229975] [2022-01-11 00:16:02,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:02,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:02,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:02,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:02,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:02,185 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-11 00:16:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:02,308 INFO L93 Difference]: Finished difference Result 5101 states and 6432 transitions. [2022-01-11 00:16:02,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:02,308 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-11 00:16:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:02,316 INFO L225 Difference]: With dead ends: 5101 [2022-01-11 00:16:02,316 INFO L226 Difference]: Without dead ends: 3453 [2022-01-11 00:16:02,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-11 00:16:02,317 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-11 00:16:02,317 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-11 00:16:02,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3453 states. [2022-01-11 00:16:02,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3453 to 1865. [2022-01-11 00:16:02,383 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-11 00:16:02,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2332 transitions. [2022-01-11 00:16:02,386 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2332 transitions. Word has length 105 [2022-01-11 00:16:02,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:02,386 INFO L470 AbstractCegarLoop]: Abstraction has 1865 states and 2332 transitions. [2022-01-11 00:16:02,386 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-11 00:16:02,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2332 transitions. [2022-01-11 00:16:02,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-11 00:16:02,387 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:02,387 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-11 00:16:02,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 00:16:02,388 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:02,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash 602540666, now seen corresponding path program 1 times [2022-01-11 00:16:02,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:02,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970245198] [2022-01-11 00:16:02,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:02,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:02,415 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-11 00:16:02,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:02,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970245198] [2022-01-11 00:16:02,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970245198] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:02,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:02,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:16:02,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512124150] [2022-01-11 00:16:02,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:02,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:16:02,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:02,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:16:02,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:16:02,417 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-11 00:16:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:02,517 INFO L93 Difference]: Finished difference Result 3507 states and 4397 transitions. [2022-01-11 00:16:02,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:16:02,518 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-11 00:16:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:02,522 INFO L225 Difference]: With dead ends: 3507 [2022-01-11 00:16:02,522 INFO L226 Difference]: Without dead ends: 1841 [2022-01-11 00:16:02,524 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-11 00:16:02,524 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-11 00:16:02,524 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-11 00:16:02,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2022-01-11 00:16:02,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1841. [2022-01-11 00:16:02,615 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-11 00:16:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2278 transitions. [2022-01-11 00:16:02,618 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2278 transitions. Word has length 106 [2022-01-11 00:16:02,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:02,618 INFO L470 AbstractCegarLoop]: Abstraction has 1841 states and 2278 transitions. [2022-01-11 00:16:02,618 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-11 00:16:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2278 transitions. [2022-01-11 00:16:02,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 00:16:02,620 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:02,620 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-11 00:16:02,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 00:16:02,620 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:02,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:02,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2052320802, now seen corresponding path program 1 times [2022-01-11 00:16:02,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:02,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538804416] [2022-01-11 00:16:02,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:02,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:02,646 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-11 00:16:02,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:02,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538804416] [2022-01-11 00:16:02,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538804416] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:02,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:02,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:02,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198466634] [2022-01-11 00:16:02,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:02,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:02,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:02,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:02,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:02,648 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-11 00:16:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:02,772 INFO L93 Difference]: Finished difference Result 5113 states and 6378 transitions. [2022-01-11 00:16:02,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:02,773 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-11 00:16:02,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:02,780 INFO L225 Difference]: With dead ends: 5113 [2022-01-11 00:16:02,780 INFO L226 Difference]: Without dead ends: 3471 [2022-01-11 00:16:02,781 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-11 00:16:02,782 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-11 00:16:02,782 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-11 00:16:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3471 states. [2022-01-11 00:16:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3471 to 1865. [2022-01-11 00:16:02,860 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-11 00:16:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2302 transitions. [2022-01-11 00:16:02,862 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2302 transitions. Word has length 107 [2022-01-11 00:16:02,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:02,863 INFO L470 AbstractCegarLoop]: Abstraction has 1865 states and 2302 transitions. [2022-01-11 00:16:02,863 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-11 00:16:02,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2302 transitions. [2022-01-11 00:16:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 00:16:02,864 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:02,864 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-11 00:16:02,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 00:16:02,865 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:02,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:02,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1473476479, now seen corresponding path program 1 times [2022-01-11 00:16:02,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:02,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626587094] [2022-01-11 00:16:02,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:02,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:02,887 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-11 00:16:02,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:02,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626587094] [2022-01-11 00:16:02,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626587094] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:02,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:02,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:02,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852687336] [2022-01-11 00:16:02,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:02,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:02,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:02,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:02,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:02,889 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-11 00:16:03,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:03,023 INFO L93 Difference]: Finished difference Result 5125 states and 6367 transitions. [2022-01-11 00:16:03,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:03,023 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-11 00:16:03,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:03,031 INFO L225 Difference]: With dead ends: 5125 [2022-01-11 00:16:03,031 INFO L226 Difference]: Without dead ends: 3459 [2022-01-11 00:16:03,033 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-11 00:16:03,033 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-11 00:16:03,033 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-11 00:16:03,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3459 states. [2022-01-11 00:16:03,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3459 to 3455. [2022-01-11 00:16:03,165 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-11 00:16:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3455 states to 3455 states and 4245 transitions. [2022-01-11 00:16:03,169 INFO L78 Accepts]: Start accepts. Automaton has 3455 states and 4245 transitions. Word has length 107 [2022-01-11 00:16:03,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:03,169 INFO L470 AbstractCegarLoop]: Abstraction has 3455 states and 4245 transitions. [2022-01-11 00:16:03,169 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-11 00:16:03,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3455 states and 4245 transitions. [2022-01-11 00:16:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 00:16:03,171 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:03,171 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-11 00:16:03,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 00:16:03,171 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:03,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:03,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1796796896, now seen corresponding path program 1 times [2022-01-11 00:16:03,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:03,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482943471] [2022-01-11 00:16:03,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:03,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:03,215 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-11 00:16:03,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:03,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482943471] [2022-01-11 00:16:03,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482943471] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:16:03,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314512813] [2022-01-11 00:16:03,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:03,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:16:03,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:16:03,217 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-11 00:16:03,225 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-11 00:16:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:03,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-11 00:16:03,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:16:03,641 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-11 00:16:03,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 00:16:03,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314512813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:03,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 00:16:03,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-01-11 00:16:03,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020497593] [2022-01-11 00:16:03,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:03,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:16:03,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:03,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:16:03,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:16:03,643 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-11 00:16:04,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:04,034 INFO L93 Difference]: Finished difference Result 10483 states and 13081 transitions. [2022-01-11 00:16:04,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:16:04,034 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-11 00:16:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:04,057 INFO L225 Difference]: With dead ends: 10483 [2022-01-11 00:16:04,057 INFO L226 Difference]: Without dead ends: 8327 [2022-01-11 00:16:04,061 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-11 00:16:04,061 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-11 00:16:04,061 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-11 00:16:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8327 states. [2022-01-11 00:16:04,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8327 to 6601. [2022-01-11 00:16:04,366 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-11 00:16:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 8213 transitions. [2022-01-11 00:16:04,374 INFO L78 Accepts]: Start accepts. Automaton has 6601 states and 8213 transitions. Word has length 107 [2022-01-11 00:16:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:04,375 INFO L470 AbstractCegarLoop]: Abstraction has 6601 states and 8213 transitions. [2022-01-11 00:16:04,375 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-11 00:16:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 6601 states and 8213 transitions. [2022-01-11 00:16:04,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 00:16:04,377 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:04,378 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-11 00:16:04,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 00:16:04,591 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-11 00:16:04,591 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:04,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:04,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1789037537, now seen corresponding path program 1 times [2022-01-11 00:16:04,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:04,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872780377] [2022-01-11 00:16:04,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:04,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:04,619 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-11 00:16:04,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:04,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872780377] [2022-01-11 00:16:04,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872780377] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:04,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:04,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:04,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168383331] [2022-01-11 00:16:04,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:04,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:04,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:04,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:04,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:04,620 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-11 00:16:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:04,958 INFO L93 Difference]: Finished difference Result 14061 states and 17491 transitions. [2022-01-11 00:16:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:04,958 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-11 00:16:04,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:04,969 INFO L225 Difference]: With dead ends: 14061 [2022-01-11 00:16:04,969 INFO L226 Difference]: Without dead ends: 7689 [2022-01-11 00:16:04,975 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-11 00:16:04,975 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-11 00:16:04,975 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-11 00:16:04,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7689 states. [2022-01-11 00:16:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7689 to 6625. [2022-01-11 00:16:05,311 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-11 00:16:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 8237 transitions. [2022-01-11 00:16:05,325 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 8237 transitions. Word has length 107 [2022-01-11 00:16:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:05,325 INFO L470 AbstractCegarLoop]: Abstraction has 6625 states and 8237 transitions. [2022-01-11 00:16:05,326 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-11 00:16:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 8237 transitions. [2022-01-11 00:16:05,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 00:16:05,329 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:05,329 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-11 00:16:05,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 00:16:05,329 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:05,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:05,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1040204897, now seen corresponding path program 1 times [2022-01-11 00:16:05,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:05,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614444746] [2022-01-11 00:16:05,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:05,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:05,363 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-11 00:16:05,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:05,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614444746] [2022-01-11 00:16:05,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614444746] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:05,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:05,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:16:05,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899837123] [2022-01-11 00:16:05,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:05,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:16:05,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:05,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:16:05,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:16:05,364 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-11 00:16:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:05,455 INFO L93 Difference]: Finished difference Result 7691 states and 9521 transitions. [2022-01-11 00:16:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:16:05,456 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-11 00:16:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:05,456 INFO L225 Difference]: With dead ends: 7691 [2022-01-11 00:16:05,456 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 00:16:05,462 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-11 00:16:05,462 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-11 00:16:05,462 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-11 00:16:05,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 00:16:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 00:16:05,463 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-11 00:16:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 00:16:05,463 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2022-01-11 00:16:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:05,463 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 00:16:05,463 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-11 00:16:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 00:16:05,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 00:16:05,465 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 00:16:05,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 00:16:05,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 00:16:23,286 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 00:16:23,286 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 00:16:23,286 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-11 00:16:23,286 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 218) no Hoare annotation was computed. [2022-01-11 00:16:23,286 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2022-01-11 00:16:23,286 INFO L858 garLoopResultBuilder]: For program point L212-2(lines 211 249) no Hoare annotation was computed. [2022-01-11 00:16:23,286 INFO L858 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2022-01-11 00:16:23,286 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2022-01-11 00:16:23,286 INFO L858 garLoopResultBuilder]: For program point L219-1(lines 211 249) no Hoare annotation was computed. [2022-01-11 00:16:23,287 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-11 00:16:23,287 INFO L858 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2022-01-11 00:16:23,287 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2022-01-11 00:16:23,287 INFO L858 garLoopResultBuilder]: For program point L226-1(lines 211 249) no Hoare annotation was computed. [2022-01-11 00:16:23,287 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-11 00:16:23,287 INFO L858 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2022-01-11 00:16:23,287 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2022-01-11 00:16:23,287 INFO L858 garLoopResultBuilder]: For program point L233-1(lines 211 249) no Hoare annotation was computed. [2022-01-11 00:16:23,287 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-11 00:16:23,287 INFO L858 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2022-01-11 00:16:23,287 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2022-01-11 00:16:23,287 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-11 00:16:23,287 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-11 00:16:23,288 INFO L858 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2022-01-11 00:16:23,288 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2022-01-11 00:16:23,288 INFO L854 garLoopResultBuilder]: At program point L205(lines 193 207) the Hoare annotation is: false [2022-01-11 00:16:23,288 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-11 00:16:23,288 INFO L858 garLoopResultBuilder]: For program point L321(lines 321 325) no Hoare annotation was computed. [2022-01-11 00:16:23,288 INFO L858 garLoopResultBuilder]: For program point L321-2(lines 320 348) no Hoare annotation was computed. [2022-01-11 00:16:23,288 INFO L858 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2022-01-11 00:16:23,288 INFO L858 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2022-01-11 00:16:23,288 INFO L858 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2022-01-11 00:16:23,288 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-11 00:16:23,288 INFO L858 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2022-01-11 00:16:23,288 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-11 00:16:23,288 INFO L858 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2022-01-11 00:16:23,289 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-11 00:16:23,289 INFO L858 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2022-01-11 00:16:23,289 INFO L858 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2022-01-11 00:16:23,289 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2022-01-11 00:16:23,289 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-11 00:16:23,289 INFO L858 garLoopResultBuilder]: For program point L354(lines 354 358) no Hoare annotation was computed. [2022-01-11 00:16:23,289 INFO L858 garLoopResultBuilder]: For program point L354-2(lines 353 381) no Hoare annotation was computed. [2022-01-11 00:16:23,289 INFO L858 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2022-01-11 00:16:23,289 INFO L858 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2022-01-11 00:16:23,289 INFO L858 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2022-01-11 00:16:23,289 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-11 00:16:23,289 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-11 00:16:23,289 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-11 00:16:23,289 INFO L858 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2022-01-11 00:16:23,290 INFO L858 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2022-01-11 00:16:23,290 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-11 00:16:23,290 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-01-11 00:16:23,290 INFO L858 garLoopResultBuilder]: For program point L501-2(lines 501 507) no Hoare annotation was computed. [2022-01-11 00:16:23,290 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-11 00:16:23,290 INFO L858 garLoopResultBuilder]: For program point L286(line 286) no Hoare annotation was computed. [2022-01-11 00:16:23,290 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-11 00:16:23,290 INFO L854 garLoopResultBuilder]: At program point L20(lines 15 22) the Hoare annotation is: false [2022-01-11 00:16:23,290 INFO L861 garLoopResultBuilder]: At program point L509(lines 493 511) the Hoare annotation is: true [2022-01-11 00:16:23,290 INFO L858 garLoopResultBuilder]: For program point L212-3(lines 212 218) no Hoare annotation was computed. [2022-01-11 00:16:23,290 INFO L858 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2022-01-11 00:16:23,290 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 00:16:23,290 INFO L858 garLoopResultBuilder]: For program point L137-3(lines 137 142) no Hoare annotation was computed. [2022-01-11 00:16:23,290 INFO L858 garLoopResultBuilder]: For program point L212-5(lines 211 249) no Hoare annotation was computed. [2022-01-11 00:16:23,290 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-11 00:16:23,291 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 00:16:23,291 INFO L858 garLoopResultBuilder]: For program point L137-5(lines 137 142) no Hoare annotation was computed. [2022-01-11 00:16:23,291 INFO L858 garLoopResultBuilder]: For program point L152-3(lines 152 157) no Hoare annotation was computed. [2022-01-11 00:16:23,291 INFO L858 garLoopResultBuilder]: For program point L219-3(lines 211 249) no Hoare annotation was computed. [2022-01-11 00:16:23,291 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-11 00:16:23,291 INFO L854 garLoopResultBuilder]: At program point L145-1(lines 133 147) the Hoare annotation is: false [2022-01-11 00:16:23,291 INFO L858 garLoopResultBuilder]: For program point L152-5(lines 152 157) no Hoare annotation was computed. [2022-01-11 00:16:23,293 INFO L858 garLoopResultBuilder]: For program point L167-3(lines 167 172) no Hoare annotation was computed. [2022-01-11 00:16:23,293 INFO L858 garLoopResultBuilder]: For program point L226-3(lines 211 249) no Hoare annotation was computed. [2022-01-11 00:16:23,293 INFO L858 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2022-01-11 00:16:23,294 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-11 00:16:23,294 INFO L858 garLoopResultBuilder]: For program point L167-5(lines 167 172) no Hoare annotation was computed. [2022-01-11 00:16:23,294 INFO L858 garLoopResultBuilder]: For program point L182-3(lines 182 187) no Hoare annotation was computed. [2022-01-11 00:16:23,294 INFO L858 garLoopResultBuilder]: For program point L233-3(lines 211 249) no Hoare annotation was computed. [2022-01-11 00:16:23,294 INFO L858 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2022-01-11 00:16:23,294 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-11 00:16:23,294 INFO L858 garLoopResultBuilder]: For program point L182-5(lines 182 187) no Hoare annotation was computed. [2022-01-11 00:16:23,294 INFO L858 garLoopResultBuilder]: For program point L197-3(lines 197 202) no Hoare annotation was computed. [2022-01-11 00:16:23,294 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-11 00:16:23,294 INFO L858 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2022-01-11 00:16:23,294 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-11 00:16:23,294 INFO L858 garLoopResultBuilder]: For program point L197-5(lines 197 202) no Hoare annotation was computed. [2022-01-11 00:16:23,294 INFO L858 garLoopResultBuilder]: For program point L321-3(lines 321 325) no Hoare annotation was computed. [2022-01-11 00:16:23,295 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2022-01-11 00:16:23,295 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-11 00:16:23,299 INFO L858 garLoopResultBuilder]: For program point L321-5(lines 320 348) no Hoare annotation was computed. [2022-01-11 00:16:23,299 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2022-01-11 00:16:23,299 INFO L858 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2022-01-11 00:16:23,299 INFO L858 garLoopResultBuilder]: For program point L326-3(lines 320 348) no Hoare annotation was computed. [2022-01-11 00:16:23,299 INFO L858 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2022-01-11 00:16:23,299 INFO L858 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2022-01-11 00:16:23,299 INFO L858 garLoopResultBuilder]: For program point L331-3(lines 320 348) no Hoare annotation was computed. [2022-01-11 00:16:23,299 INFO L858 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2022-01-11 00:16:23,299 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2022-01-11 00:16:23,299 INFO L858 garLoopResultBuilder]: For program point L336-3(lines 320 348) no Hoare annotation was computed. [2022-01-11 00:16:23,299 INFO L858 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2022-01-11 00:16:23,300 INFO L858 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2022-01-11 00:16:23,300 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-11 00:16:23,300 INFO L858 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2022-01-11 00:16:23,300 INFO L858 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-01-11 00:16:23,300 INFO L858 garLoopResultBuilder]: For program point L107-1(lines 107 127) no Hoare annotation was computed. [2022-01-11 00:16:23,300 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-11 00:16:23,300 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-11 00:16:23,300 INFO L858 garLoopResultBuilder]: For program point L111-1(lines 111 126) no Hoare annotation was computed. [2022-01-11 00:16:23,300 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-11 00:16:23,300 INFO L858 garLoopResultBuilder]: For program point L115-1(lines 115 125) no Hoare annotation was computed. [2022-01-11 00:16:23,300 INFO L858 garLoopResultBuilder]: For program point L390-3(lines 390 394) no Hoare annotation was computed. [2022-01-11 00:16:23,300 INFO L858 garLoopResultBuilder]: For program point L119-1(lines 119 124) no Hoare annotation was computed. [2022-01-11 00:16:23,300 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-11 00:16:23,300 INFO L858 garLoopResultBuilder]: For program point L354-3(lines 354 358) no Hoare annotation was computed. [2022-01-11 00:16:23,301 INFO L858 garLoopResultBuilder]: For program point L354-5(lines 353 381) no Hoare annotation was computed. [2022-01-11 00:16:23,301 INFO L858 garLoopResultBuilder]: For program point L359-3(lines 353 381) no Hoare annotation was computed. [2022-01-11 00:16:23,301 INFO L858 garLoopResultBuilder]: For program point L364-3(lines 353 381) no Hoare annotation was computed. [2022-01-11 00:16:23,301 INFO L858 garLoopResultBuilder]: For program point L369-3(lines 353 381) no Hoare annotation was computed. [2022-01-11 00:16:23,301 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-11 00:16:23,301 INFO L858 garLoopResultBuilder]: For program point L268-1(lines 268 273) no Hoare annotation was computed. [2022-01-11 00:16:23,301 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-11 00:16:23,301 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-11 00:16:23,301 INFO L858 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2022-01-11 00:16:23,301 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-11 00:16:23,301 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-11 00:16:23,301 INFO L858 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2022-01-11 00:16:23,303 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-11 00:16:23,304 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 00:16:23,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:16:23 BasicIcfg [2022-01-11 00:16:23,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 00:16:23,393 INFO L158 Benchmark]: Toolchain (without parser) took 24732.28ms. Allocated memory was 179.3MB in the beginning and 648.0MB in the end (delta: 468.7MB). Free memory was 133.4MB in the beginning and 607.2MB in the end (delta: -473.8MB). Peak memory consumption was 404.3MB. Max. memory is 8.0GB. [2022-01-11 00:16:23,393 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory was 149.7MB in the beginning and 149.6MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 00:16:23,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.13ms. Allocated memory is still 179.3MB. Free memory was 133.2MB in the beginning and 153.6MB in the end (delta: -20.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-11 00:16:23,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.59ms. Allocated memory is still 179.3MB. Free memory was 153.6MB in the beginning and 150.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-11 00:16:23,393 INFO L158 Benchmark]: Boogie Preprocessor took 18.41ms. Allocated memory is still 179.3MB. Free memory was 150.9MB in the beginning and 149.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-11 00:16:23,393 INFO L158 Benchmark]: RCFGBuilder took 377.42ms. Allocated memory is still 179.3MB. Free memory was 149.4MB in the beginning and 129.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-01-11 00:16:23,393 INFO L158 Benchmark]: IcfgTransformer took 104.38ms. Allocated memory is still 179.3MB. Free memory was 129.9MB in the beginning and 121.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-01-11 00:16:23,394 INFO L158 Benchmark]: TraceAbstraction took 23975.44ms. Allocated memory was 179.3MB in the beginning and 648.0MB in the end (delta: 468.7MB). Free memory was 121.6MB in the beginning and 607.2MB in the end (delta: -485.6MB). Peak memory consumption was 392.0MB. Max. memory is 8.0GB. [2022-01-11 00:16:23,394 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.11ms. Allocated memory is still 179.3MB. Free memory was 149.7MB in the beginning and 149.6MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.13ms. Allocated memory is still 179.3MB. Free memory was 133.2MB in the beginning and 153.6MB in the end (delta: -20.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.59ms. Allocated memory is still 179.3MB. Free memory was 153.6MB in the beginning and 150.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.41ms. Allocated memory is still 179.3MB. Free memory was 150.9MB in the beginning and 149.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 377.42ms. Allocated memory is still 179.3MB. Free memory was 149.4MB in the beginning and 129.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * IcfgTransformer took 104.38ms. Allocated memory is still 179.3MB. Free memory was 129.9MB in the beginning and 121.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 23975.44ms. Allocated memory was 179.3MB in the beginning and 648.0MB in the end (delta: 468.7MB). Free memory was 121.6MB in the beginning and 607.2MB in the end (delta: -485.6MB). Peak memory consumption was 392.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.8s, OverallIterations: 29, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3097 SdHoareTripleChecker+Valid, 0.3s 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.6s AutomataMinimizationTime, 29 MinimizatonAttempts, 6078 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 37 PreInvPairs, 454 NumberOfFragments, 6694 HoareAnnotationTreeSize, 37 FomulaSimplifications, 8540 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 37 FomulaSimplificationsInter, 204042 FormulaSimplificationTreeSizeReductionInter, 16.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s 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-11 00:16:23,474 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...