./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/toy.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 18:16:19,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:16:19,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:16:19,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:16:19,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:16:19,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:16:19,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:16:19,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:16:19,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:16:19,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:16:19,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:16:19,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:16:19,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:16:19,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:16:19,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:16:19,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:16:19,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:16:19,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:16:19,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:16:19,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:16:19,126 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:16:19,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:16:19,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:16:19,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:16:19,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:16:19,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:16:19,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:16:19,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:16:19,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:16:19,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:16:19,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:16:19,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:16:19,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:16:19,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:16:19,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:16:19,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:16:19,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:16:19,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:16:19,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:16:19,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:16:19,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:16:19,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:16:19,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 18:16:19,170 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:16:19,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:16:19,170 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:16:19,171 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:16:19,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:16:19,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:16:19,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:16:19,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:16:19,172 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:16:19,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:16:19,173 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:16:19,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:16:19,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:16:19,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:16:19,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:16:19,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:16:19,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:16:19,174 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:16:19,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:16:19,175 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:16:19,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:16:19,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:16:19,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:16:19,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:16:19,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:16:19,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:16:19,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:16:19,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:16:19,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:16:19,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:16:19,177 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:16:19,177 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:16:19,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:16:19,178 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2022-07-13 18:16:19,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:16:19,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:16:19,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:16:19,366 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:16:19,367 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:16:19,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy.cil.c [2022-07-13 18:16:19,427 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9a94a96/3655102249324349b6201c7c714191c6/FLAGb77cace05 [2022-07-13 18:16:19,855 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:16:19,867 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2022-07-13 18:16:19,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9a94a96/3655102249324349b6201c7c714191c6/FLAGb77cace05 [2022-07-13 18:16:19,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9a94a96/3655102249324349b6201c7c714191c6 [2022-07-13 18:16:19,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:16:19,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:16:19,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:16:19,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:16:19,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:16:19,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:16:19" (1/1) ... [2022-07-13 18:16:19,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@255ae929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:19, skipping insertion in model container [2022-07-13 18:16:19,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:16:19" (1/1) ... [2022-07-13 18:16:19,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:16:19,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:16:20,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2022-07-13 18:16:20,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:16:20,285 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:16:20,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2022-07-13 18:16:20,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:16:20,403 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:16:20,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:20 WrapperNode [2022-07-13 18:16:20,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:16:20,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:16:20,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:16:20,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:16:20,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:20" (1/1) ... [2022-07-13 18:16:20,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:20" (1/1) ... [2022-07-13 18:16:20,462 INFO L137 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 362 [2022-07-13 18:16:20,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:16:20,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:16:20,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:16:20,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:16:20,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:20" (1/1) ... [2022-07-13 18:16:20,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:20" (1/1) ... [2022-07-13 18:16:20,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:20" (1/1) ... [2022-07-13 18:16:20,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:20" (1/1) ... [2022-07-13 18:16:20,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:20" (1/1) ... [2022-07-13 18:16:20,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:20" (1/1) ... [2022-07-13 18:16:20,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:20" (1/1) ... [2022-07-13 18:16:20,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:16:20,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:16:20,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:16:20,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:16:20,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:20" (1/1) ... [2022-07-13 18:16:20,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:16:20,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:16:20,541 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-07-13 18:16:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:16:20,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:16:20,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:16:20,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:16:20,562 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-07-13 18:16:20,639 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:16:20,641 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:16:20,927 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:16:20,944 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:16:20,944 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-13 18:16:20,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:16:20 BoogieIcfgContainer [2022-07-13 18:16:20,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:16:20,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:16:20,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:16:20,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:16:20,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:16:19" (1/3) ... [2022-07-13 18:16:20,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75560f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:16:20, skipping insertion in model container [2022-07-13 18:16:20,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:20" (2/3) ... [2022-07-13 18:16:20,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75560f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:16:20, skipping insertion in model container [2022-07-13 18:16:20,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:16:20" (3/3) ... [2022-07-13 18:16:20,954 INFO L111 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2022-07-13 18:16:20,964 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:16:20,964 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:16:20,996 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:16:21,003 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@19cdf172, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1ed65dc1 [2022-07-13 18:16:21,003 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:16:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 130 states have (on average 1.8384615384615384) internal successors, (239), 131 states have internal predecessors, (239), 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-07-13 18:16:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 18:16:21,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:21,020 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:21,020 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:21,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:21,028 INFO L85 PathProgramCache]: Analyzing trace with hash -895776564, now seen corresponding path program 1 times [2022-07-13 18:16:21,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:21,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052552699] [2022-07-13 18:16:21,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:21,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:21,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:21,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052552699] [2022-07-13 18:16:21,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052552699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:21,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:21,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:21,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786523847] [2022-07-13 18:16:21,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:21,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:21,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:21,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:21,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:21,203 INFO L87 Difference]: Start difference. First operand has 132 states, 130 states have (on average 1.8384615384615384) internal successors, (239), 131 states have internal predecessors, (239), 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 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-07-13 18:16:21,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:21,245 INFO L93 Difference]: Finished difference Result 255 states and 464 transitions. [2022-07-13 18:16:21,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:21,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2022-07-13 18:16:21,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:21,254 INFO L225 Difference]: With dead ends: 255 [2022-07-13 18:16:21,254 INFO L226 Difference]: Without dead ends: 127 [2022-07-13 18:16:21,256 INFO L412 NwaCegarLoop]: 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-07-13 18:16:21,259 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:21,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 223 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:21,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-13 18:16:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-07-13 18:16:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 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-07-13 18:16:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 220 transitions. [2022-07-13 18:16:21,288 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 220 transitions. Word has length 36 [2022-07-13 18:16:21,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:21,288 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 220 transitions. [2022-07-13 18:16:21,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-07-13 18:16:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2022-07-13 18:16:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 18:16:21,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:21,290 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:21,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:16:21,291 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:21,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:21,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1597376438, now seen corresponding path program 1 times [2022-07-13 18:16:21,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:21,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249915386] [2022-07-13 18:16:21,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:21,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:21,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:21,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249915386] [2022-07-13 18:16:21,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249915386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:21,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:21,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:16:21,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465211319] [2022-07-13 18:16:21,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:21,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:16:21,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:21,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:16:21,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:16:21,338 INFO L87 Difference]: Start difference. First operand 127 states and 220 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-07-13 18:16:21,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:21,378 INFO L93 Difference]: Finished difference Result 343 states and 592 transitions. [2022-07-13 18:16:21,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:16:21,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-07-13 18:16:21,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:21,380 INFO L225 Difference]: With dead ends: 343 [2022-07-13 18:16:21,381 INFO L226 Difference]: Without dead ends: 219 [2022-07-13 18:16:21,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-07-13 18:16:21,382 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 574 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:21,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 370 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:21,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-13 18:16:21,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2022-07-13 18:16:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.7255813953488373) internal successors, (371), 215 states have internal predecessors, (371), 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-07-13 18:16:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 371 transitions. [2022-07-13 18:16:21,397 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 371 transitions. Word has length 36 [2022-07-13 18:16:21,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:21,397 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 371 transitions. [2022-07-13 18:16:21,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-07-13 18:16:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 371 transitions. [2022-07-13 18:16:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 18:16:21,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:21,399 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:21,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 18:16:21,399 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash -211173044, now seen corresponding path program 1 times [2022-07-13 18:16:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:21,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018793202] [2022-07-13 18:16:21,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:21,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:21,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:21,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018793202] [2022-07-13 18:16:21,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018793202] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:21,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:21,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:21,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661323157] [2022-07-13 18:16:21,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:21,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:21,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:21,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:21,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:21,436 INFO L87 Difference]: Start difference. First operand 216 states and 371 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-07-13 18:16:21,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:21,464 INFO L93 Difference]: Finished difference Result 423 states and 729 transitions. [2022-07-13 18:16:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:21,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2022-07-13 18:16:21,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:21,466 INFO L225 Difference]: With dead ends: 423 [2022-07-13 18:16:21,466 INFO L226 Difference]: Without dead ends: 216 [2022-07-13 18:16:21,466 INFO L412 NwaCegarLoop]: 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-07-13 18:16:21,467 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 189 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:21,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 203 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:21,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-13 18:16:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-07-13 18:16:21,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.669767441860465) internal successors, (359), 215 states have internal predecessors, (359), 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-07-13 18:16:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 359 transitions. [2022-07-13 18:16:21,482 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 359 transitions. Word has length 36 [2022-07-13 18:16:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:21,483 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 359 transitions. [2022-07-13 18:16:21,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-07-13 18:16:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 359 transitions. [2022-07-13 18:16:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 18:16:21,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:21,484 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:21,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 18:16:21,484 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:21,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:21,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1741714488, now seen corresponding path program 1 times [2022-07-13 18:16:21,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:21,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519520266] [2022-07-13 18:16:21,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:21,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:21,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:21,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519520266] [2022-07-13 18:16:21,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519520266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:21,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:21,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:16:21,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726621031] [2022-07-13 18:16:21,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:21,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:16:21,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:21,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:16:21,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:16:21,550 INFO L87 Difference]: Start difference. First operand 216 states and 359 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-07-13 18:16:21,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:21,636 INFO L93 Difference]: Finished difference Result 589 states and 980 transitions. [2022-07-13 18:16:21,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:16:21,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-07-13 18:16:21,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:21,639 INFO L225 Difference]: With dead ends: 589 [2022-07-13 18:16:21,641 INFO L226 Difference]: Without dead ends: 383 [2022-07-13 18:16:21,643 INFO L412 NwaCegarLoop]: 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-07-13 18:16:21,646 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 369 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:21,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 458 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:16:21,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-07-13 18:16:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 216. [2022-07-13 18:16:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.655813953488372) internal successors, (356), 215 states have internal predecessors, (356), 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-07-13 18:16:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 356 transitions. [2022-07-13 18:16:21,673 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 356 transitions. Word has length 36 [2022-07-13 18:16:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:21,674 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 356 transitions. [2022-07-13 18:16:21,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-07-13 18:16:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 356 transitions. [2022-07-13 18:16:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 18:16:21,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:21,676 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:21,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 18:16:21,676 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:21,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash 181513546, now seen corresponding path program 1 times [2022-07-13 18:16:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:21,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148116288] [2022-07-13 18:16:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:21,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:21,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148116288] [2022-07-13 18:16:21,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148116288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:21,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:21,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:16:21,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845398185] [2022-07-13 18:16:21,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:21,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:16:21,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:21,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:16:21,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:16:21,742 INFO L87 Difference]: Start difference. First operand 216 states and 356 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-07-13 18:16:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:21,802 INFO L93 Difference]: Finished difference Result 590 states and 974 transitions. [2022-07-13 18:16:21,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:16:21,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-07-13 18:16:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:21,804 INFO L225 Difference]: With dead ends: 590 [2022-07-13 18:16:21,804 INFO L226 Difference]: Without dead ends: 385 [2022-07-13 18:16:21,805 INFO L412 NwaCegarLoop]: 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-07-13 18:16:21,809 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 367 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:21,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 465 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-07-13 18:16:21,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 216. [2022-07-13 18:16:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.6418604651162791) internal successors, (353), 215 states have internal predecessors, (353), 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-07-13 18:16:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 353 transitions. [2022-07-13 18:16:21,831 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 353 transitions. Word has length 36 [2022-07-13 18:16:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:21,832 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 353 transitions. [2022-07-13 18:16:21,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-07-13 18:16:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 353 transitions. [2022-07-13 18:16:21,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 18:16:21,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:21,838 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:21,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 18:16:21,838 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:21,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:21,839 INFO L85 PathProgramCache]: Analyzing trace with hash 243553160, now seen corresponding path program 1 times [2022-07-13 18:16:21,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:21,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734650067] [2022-07-13 18:16:21,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:21,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:21,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:21,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734650067] [2022-07-13 18:16:21,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734650067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:21,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:21,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:16:21,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046163508] [2022-07-13 18:16:21,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:21,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:16:21,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:21,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:16:21,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:16:21,885 INFO L87 Difference]: Start difference. First operand 216 states and 353 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-07-13 18:16:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:21,934 INFO L93 Difference]: Finished difference Result 604 states and 987 transitions. [2022-07-13 18:16:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:16:21,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-07-13 18:16:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:21,936 INFO L225 Difference]: With dead ends: 604 [2022-07-13 18:16:21,936 INFO L226 Difference]: Without dead ends: 400 [2022-07-13 18:16:21,937 INFO L412 NwaCegarLoop]: 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-07-13 18:16:21,938 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 373 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:21,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 473 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-07-13 18:16:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 222. [2022-07-13 18:16:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.6153846153846154) internal successors, (357), 221 states have internal predecessors, (357), 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-07-13 18:16:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 357 transitions. [2022-07-13 18:16:21,947 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 357 transitions. Word has length 36 [2022-07-13 18:16:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:21,947 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 357 transitions. [2022-07-13 18:16:21,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-07-13 18:16:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 357 transitions. [2022-07-13 18:16:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 18:16:21,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:21,949 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:21,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 18:16:21,949 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:21,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:21,949 INFO L85 PathProgramCache]: Analyzing trace with hash 384101770, now seen corresponding path program 1 times [2022-07-13 18:16:21,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:21,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691470611] [2022-07-13 18:16:21,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:21,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:21,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:21,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691470611] [2022-07-13 18:16:21,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691470611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:21,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:21,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:16:21,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232665031] [2022-07-13 18:16:21,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:21,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:16:21,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:21,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:16:21,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:16:21,985 INFO L87 Difference]: Start difference. First operand 222 states and 357 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-07-13 18:16:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:22,059 INFO L93 Difference]: Finished difference Result 759 states and 1219 transitions. [2022-07-13 18:16:22,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:16:22,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-07-13 18:16:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:22,062 INFO L225 Difference]: With dead ends: 759 [2022-07-13 18:16:22,062 INFO L226 Difference]: Without dead ends: 550 [2022-07-13 18:16:22,062 INFO L412 NwaCegarLoop]: 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-07-13 18:16:22,063 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 369 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:22,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 569 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:22,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-07-13 18:16:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 365. [2022-07-13 18:16:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.598901098901099) internal successors, (582), 364 states have internal predecessors, (582), 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-07-13 18:16:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 582 transitions. [2022-07-13 18:16:22,081 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 582 transitions. Word has length 36 [2022-07-13 18:16:22,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:22,081 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 582 transitions. [2022-07-13 18:16:22,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-07-13 18:16:22,081 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 582 transitions. [2022-07-13 18:16:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 18:16:22,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:22,083 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:22,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 18:16:22,083 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:22,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:22,084 INFO L85 PathProgramCache]: Analyzing trace with hash 250088264, now seen corresponding path program 1 times [2022-07-13 18:16:22,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:22,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338718127] [2022-07-13 18:16:22,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:22,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:22,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:22,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338718127] [2022-07-13 18:16:22,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338718127] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:22,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:22,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:22,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001770340] [2022-07-13 18:16:22,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:22,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:22,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:22,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:22,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:22,148 INFO L87 Difference]: Start difference. First operand 365 states and 582 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-07-13 18:16:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:22,186 INFO L93 Difference]: Finished difference Result 872 states and 1395 transitions. [2022-07-13 18:16:22,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:22,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2022-07-13 18:16:22,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:22,188 INFO L225 Difference]: With dead ends: 872 [2022-07-13 18:16:22,189 INFO L226 Difference]: Without dead ends: 531 [2022-07-13 18:16:22,189 INFO L412 NwaCegarLoop]: 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-07-13 18:16:22,191 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 177 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:22,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 342 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-07-13 18:16:22,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 529. [2022-07-13 18:16:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.5946969696969697) internal successors, (842), 528 states have internal predecessors, (842), 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-07-13 18:16:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 842 transitions. [2022-07-13 18:16:22,224 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 842 transitions. Word has length 36 [2022-07-13 18:16:22,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:22,225 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 842 transitions. [2022-07-13 18:16:22,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-07-13 18:16:22,225 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 842 transitions. [2022-07-13 18:16:22,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 18:16:22,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:22,226 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:22,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 18:16:22,227 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:22,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:22,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1539793604, now seen corresponding path program 1 times [2022-07-13 18:16:22,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:22,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528009099] [2022-07-13 18:16:22,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:22,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:22,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:22,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528009099] [2022-07-13 18:16:22,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528009099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:22,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:22,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:16:22,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144957703] [2022-07-13 18:16:22,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:22,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:16:22,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:22,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:16:22,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:16:22,265 INFO L87 Difference]: Start difference. First operand 529 states and 842 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-07-13 18:16:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:22,330 INFO L93 Difference]: Finished difference Result 1347 states and 2145 transitions. [2022-07-13 18:16:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:16:22,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-07-13 18:16:22,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:22,333 INFO L225 Difference]: With dead ends: 1347 [2022-07-13 18:16:22,334 INFO L226 Difference]: Without dead ends: 835 [2022-07-13 18:16:22,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-07-13 18:16:22,336 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 484 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:22,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 330 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:22,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-07-13 18:16:22,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 529. [2022-07-13 18:16:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.5795454545454546) internal successors, (834), 528 states have internal predecessors, (834), 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-07-13 18:16:22,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 834 transitions. [2022-07-13 18:16:22,361 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 834 transitions. Word has length 36 [2022-07-13 18:16:22,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:22,363 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 834 transitions. [2022-07-13 18:16:22,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-07-13 18:16:22,363 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 834 transitions. [2022-07-13 18:16:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 18:16:22,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:22,364 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:22,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 18:16:22,364 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:22,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:22,365 INFO L85 PathProgramCache]: Analyzing trace with hash -48554298, now seen corresponding path program 1 times [2022-07-13 18:16:22,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:22,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027856983] [2022-07-13 18:16:22,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:22,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:22,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027856983] [2022-07-13 18:16:22,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027856983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:22,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:22,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:16:22,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710486167] [2022-07-13 18:16:22,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:22,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:16:22,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:22,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:16:22,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:16:22,401 INFO L87 Difference]: Start difference. First operand 529 states and 834 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-07-13 18:16:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:22,499 INFO L93 Difference]: Finished difference Result 1347 states and 2122 transitions. [2022-07-13 18:16:22,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:16:22,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-07-13 18:16:22,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:22,502 INFO L225 Difference]: With dead ends: 1347 [2022-07-13 18:16:22,502 INFO L226 Difference]: Without dead ends: 841 [2022-07-13 18:16:22,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-07-13 18:16:22,503 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 468 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:22,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 319 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:22,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-07-13 18:16:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 529. [2022-07-13 18:16:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.5643939393939394) internal successors, (826), 528 states have internal predecessors, (826), 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-07-13 18:16:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 826 transitions. [2022-07-13 18:16:22,524 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 826 transitions. Word has length 36 [2022-07-13 18:16:22,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:22,524 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 826 transitions. [2022-07-13 18:16:22,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-07-13 18:16:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 826 transitions. [2022-07-13 18:16:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 18:16:22,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:22,525 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:22,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 18:16:22,526 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:22,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1328417976, now seen corresponding path program 1 times [2022-07-13 18:16:22,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:22,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838915527] [2022-07-13 18:16:22,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:22,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:22,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:22,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838915527] [2022-07-13 18:16:22,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838915527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:22,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:22,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:16:22,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125829551] [2022-07-13 18:16:22,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:22,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:16:22,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:22,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:16:22,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:16:22,546 INFO L87 Difference]: Start difference. First operand 529 states and 826 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-07-13 18:16:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:22,606 INFO L93 Difference]: Finished difference Result 1276 states and 1990 transitions. [2022-07-13 18:16:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:16:22,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-07-13 18:16:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:22,609 INFO L225 Difference]: With dead ends: 1276 [2022-07-13 18:16:22,609 INFO L226 Difference]: Without dead ends: 764 [2022-07-13 18:16:22,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-07-13 18:16:22,610 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 480 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:22,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 349 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-07-13 18:16:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 577. [2022-07-13 18:16:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.5329861111111112) internal successors, (883), 576 states have internal predecessors, (883), 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-07-13 18:16:22,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 883 transitions. [2022-07-13 18:16:22,632 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 883 transitions. Word has length 36 [2022-07-13 18:16:22,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:22,633 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 883 transitions. [2022-07-13 18:16:22,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-07-13 18:16:22,633 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 883 transitions. [2022-07-13 18:16:22,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 18:16:22,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:22,634 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:22,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 18:16:22,634 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:22,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:22,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1915223990, now seen corresponding path program 1 times [2022-07-13 18:16:22,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:22,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316837598] [2022-07-13 18:16:22,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:22,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:22,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:22,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316837598] [2022-07-13 18:16:22,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316837598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:22,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:22,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:22,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808379170] [2022-07-13 18:16:22,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:22,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:22,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:22,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:22,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:22,654 INFO L87 Difference]: Start difference. First operand 577 states and 883 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-07-13 18:16:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:22,698 INFO L93 Difference]: Finished difference Result 1372 states and 2104 transitions. [2022-07-13 18:16:22,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:22,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2022-07-13 18:16:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:22,701 INFO L225 Difference]: With dead ends: 1372 [2022-07-13 18:16:22,701 INFO L226 Difference]: Without dead ends: 809 [2022-07-13 18:16:22,702 INFO L412 NwaCegarLoop]: 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-07-13 18:16:22,702 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 118 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:22,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 312 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-13 18:16:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 806. [2022-07-13 18:16:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 1.5142857142857142) internal successors, (1219), 805 states have internal predecessors, (1219), 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-07-13 18:16:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1219 transitions. [2022-07-13 18:16:22,731 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1219 transitions. Word has length 36 [2022-07-13 18:16:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:22,731 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 1219 transitions. [2022-07-13 18:16:22,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-07-13 18:16:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1219 transitions. [2022-07-13 18:16:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 18:16:22,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:22,732 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:22,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 18:16:22,733 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:22,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:22,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1539863823, now seen corresponding path program 1 times [2022-07-13 18:16:22,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:22,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451046642] [2022-07-13 18:16:22,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:22,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:22,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:22,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451046642] [2022-07-13 18:16:22,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451046642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:22,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:22,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:22,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540720834] [2022-07-13 18:16:22,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:22,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:22,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:22,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:22,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:22,765 INFO L87 Difference]: Start difference. First operand 806 states and 1219 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-07-13 18:16:22,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:22,813 INFO L93 Difference]: Finished difference Result 1999 states and 3056 transitions. [2022-07-13 18:16:22,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:22,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2022-07-13 18:16:22,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:22,817 INFO L225 Difference]: With dead ends: 1999 [2022-07-13 18:16:22,817 INFO L226 Difference]: Without dead ends: 1220 [2022-07-13 18:16:22,818 INFO L412 NwaCegarLoop]: 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-07-13 18:16:22,818 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 81 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:22,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 414 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2022-07-13 18:16:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1218. [2022-07-13 18:16:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1217 states have (on average 1.5209531635168447) internal successors, (1851), 1217 states have internal predecessors, (1851), 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-07-13 18:16:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1851 transitions. [2022-07-13 18:16:22,861 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1851 transitions. Word has length 47 [2022-07-13 18:16:22,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:22,862 INFO L495 AbstractCegarLoop]: Abstraction has 1218 states and 1851 transitions. [2022-07-13 18:16:22,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-07-13 18:16:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1851 transitions. [2022-07-13 18:16:22,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 18:16:22,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:22,863 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:22,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 18:16:22,863 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:22,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:22,864 INFO L85 PathProgramCache]: Analyzing trace with hash 642470545, now seen corresponding path program 1 times [2022-07-13 18:16:22,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:22,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241155406] [2022-07-13 18:16:22,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:22,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 18:16:22,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:22,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241155406] [2022-07-13 18:16:22,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241155406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:22,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:22,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:22,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997634000] [2022-07-13 18:16:22,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:22,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:22,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:22,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:22,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:22,878 INFO L87 Difference]: Start difference. First operand 1218 states and 1851 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-07-13 18:16:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:22,925 INFO L93 Difference]: Finished difference Result 2387 states and 3643 transitions. [2022-07-13 18:16:22,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:22,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 47 [2022-07-13 18:16:22,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:22,929 INFO L225 Difference]: With dead ends: 2387 [2022-07-13 18:16:22,929 INFO L226 Difference]: Without dead ends: 1196 [2022-07-13 18:16:22,931 INFO L412 NwaCegarLoop]: 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-07-13 18:16:22,932 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:22,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 182 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:22,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2022-07-13 18:16:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1196. [2022-07-13 18:16:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1195 states have (on average 1.5263598326359833) internal successors, (1824), 1195 states have internal predecessors, (1824), 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-07-13 18:16:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1824 transitions. [2022-07-13 18:16:23,008 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1824 transitions. Word has length 47 [2022-07-13 18:16:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:23,008 INFO L495 AbstractCegarLoop]: Abstraction has 1196 states and 1824 transitions. [2022-07-13 18:16:23,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-07-13 18:16:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1824 transitions. [2022-07-13 18:16:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 18:16:23,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:23,009 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:23,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 18:16:23,010 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:23,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:23,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1991530956, now seen corresponding path program 1 times [2022-07-13 18:16:23,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:23,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884374602] [2022-07-13 18:16:23,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:23,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:23,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:23,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884374602] [2022-07-13 18:16:23,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884374602] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:23,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:23,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:23,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706663089] [2022-07-13 18:16:23,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:23,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:23,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:23,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:23,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:23,030 INFO L87 Difference]: Start difference. First operand 1196 states and 1824 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-07-13 18:16:23,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:23,104 INFO L93 Difference]: Finished difference Result 3056 states and 4711 transitions. [2022-07-13 18:16:23,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:23,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2022-07-13 18:16:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:23,111 INFO L225 Difference]: With dead ends: 3056 [2022-07-13 18:16:23,111 INFO L226 Difference]: Without dead ends: 1887 [2022-07-13 18:16:23,113 INFO L412 NwaCegarLoop]: 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-07-13 18:16:23,113 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 82 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:23,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 322 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2022-07-13 18:16:23,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1885. [2022-07-13 18:16:23,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1884 states have (on average 1.5345010615711252) internal successors, (2891), 1884 states have internal predecessors, (2891), 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-07-13 18:16:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2891 transitions. [2022-07-13 18:16:23,178 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2891 transitions. Word has length 48 [2022-07-13 18:16:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:23,179 INFO L495 AbstractCegarLoop]: Abstraction has 1885 states and 2891 transitions. [2022-07-13 18:16:23,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-07-13 18:16:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2891 transitions. [2022-07-13 18:16:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 18:16:23,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:23,180 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:23,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 18:16:23,180 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:23,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:23,181 INFO L85 PathProgramCache]: Analyzing trace with hash 253027899, now seen corresponding path program 1 times [2022-07-13 18:16:23,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:23,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187776527] [2022-07-13 18:16:23,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:23,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:23,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:23,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187776527] [2022-07-13 18:16:23,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187776527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:23,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:23,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:23,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115757729] [2022-07-13 18:16:23,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:23,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:23,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:23,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:23,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:23,199 INFO L87 Difference]: Start difference. First operand 1885 states and 2891 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-07-13 18:16:23,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:23,314 INFO L93 Difference]: Finished difference Result 5076 states and 7877 transitions. [2022-07-13 18:16:23,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:23,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 49 [2022-07-13 18:16:23,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:23,324 INFO L225 Difference]: With dead ends: 5076 [2022-07-13 18:16:23,325 INFO L226 Difference]: Without dead ends: 3220 [2022-07-13 18:16:23,328 INFO L412 NwaCegarLoop]: 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-07-13 18:16:23,328 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 86 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:23,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 385 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:23,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2022-07-13 18:16:23,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 3218. [2022-07-13 18:16:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3218 states, 3217 states have (on average 1.5461610195834627) internal successors, (4974), 3217 states have internal predecessors, (4974), 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-07-13 18:16:23,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 4974 transitions. [2022-07-13 18:16:23,453 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 4974 transitions. Word has length 49 [2022-07-13 18:16:23,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:23,453 INFO L495 AbstractCegarLoop]: Abstraction has 3218 states and 4974 transitions. [2022-07-13 18:16:23,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-07-13 18:16:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 4974 transitions. [2022-07-13 18:16:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 18:16:23,455 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:23,455 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:23,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 18:16:23,455 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:23,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:23,456 INFO L85 PathProgramCache]: Analyzing trace with hash -644365379, now seen corresponding path program 1 times [2022-07-13 18:16:23,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:23,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670672479] [2022-07-13 18:16:23,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:23,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 18:16:23,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:23,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670672479] [2022-07-13 18:16:23,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670672479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:23,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:23,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:23,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611548013] [2022-07-13 18:16:23,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:23,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:23,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:23,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:23,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:23,470 INFO L87 Difference]: Start difference. First operand 3218 states and 4974 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-07-13 18:16:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:23,571 INFO L93 Difference]: Finished difference Result 6385 states and 9889 transitions. [2022-07-13 18:16:23,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:23,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 49 [2022-07-13 18:16:23,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:23,581 INFO L225 Difference]: With dead ends: 6385 [2022-07-13 18:16:23,581 INFO L226 Difference]: Without dead ends: 3196 [2022-07-13 18:16:23,586 INFO L412 NwaCegarLoop]: 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-07-13 18:16:23,586 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:23,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 181 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:23,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2022-07-13 18:16:23,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 3196. [2022-07-13 18:16:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3196 states, 3195 states have (on average 1.5486697965571206) internal successors, (4948), 3195 states have internal predecessors, (4948), 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-07-13 18:16:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 4948 transitions. [2022-07-13 18:16:23,723 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 4948 transitions. Word has length 49 [2022-07-13 18:16:23,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:23,723 INFO L495 AbstractCegarLoop]: Abstraction has 3196 states and 4948 transitions. [2022-07-13 18:16:23,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-07-13 18:16:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 4948 transitions. [2022-07-13 18:16:23,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 18:16:23,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:23,724 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:23,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 18:16:23,725 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:23,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:23,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1777423200, now seen corresponding path program 1 times [2022-07-13 18:16:23,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:23,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549131503] [2022-07-13 18:16:23,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:23,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:23,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:23,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549131503] [2022-07-13 18:16:23,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549131503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:23,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:23,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:16:23,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187023029] [2022-07-13 18:16:23,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:23,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:16:23,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:23,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:16:23,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:16:23,747 INFO L87 Difference]: Start difference. First operand 3196 states and 4948 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-07-13 18:16:23,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:23,974 INFO L93 Difference]: Finished difference Result 8133 states and 12621 transitions. [2022-07-13 18:16:23,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:16:23,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2022-07-13 18:16:23,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:23,986 INFO L225 Difference]: With dead ends: 8133 [2022-07-13 18:16:23,986 INFO L226 Difference]: Without dead ends: 4173 [2022-07-13 18:16:23,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07-13 18:16:23,991 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 401 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:23,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 305 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2022-07-13 18:16:24,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4173. [2022-07-13 18:16:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4173 states, 4172 states have (on average 1.537392138063279) internal successors, (6414), 4172 states have internal predecessors, (6414), 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-07-13 18:16:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 4173 states and 6414 transitions. [2022-07-13 18:16:24,149 INFO L78 Accepts]: Start accepts. Automaton has 4173 states and 6414 transitions. Word has length 50 [2022-07-13 18:16:24,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:24,149 INFO L495 AbstractCegarLoop]: Abstraction has 4173 states and 6414 transitions. [2022-07-13 18:16:24,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-07-13 18:16:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 6414 transitions. [2022-07-13 18:16:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 18:16:24,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:24,151 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:16:24,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 18:16:24,151 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:24,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:24,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1800183507, now seen corresponding path program 1 times [2022-07-13 18:16:24,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:24,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556419301] [2022-07-13 18:16:24,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:24,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:24,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:24,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556419301] [2022-07-13 18:16:24,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556419301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:24,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:24,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:16:24,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484210930] [2022-07-13 18:16:24,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:24,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:16:24,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:24,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:16:24,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:16:24,176 INFO L87 Difference]: Start difference. First operand 4173 states and 6414 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-07-13 18:16:24,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:24,415 INFO L93 Difference]: Finished difference Result 10612 states and 16218 transitions. [2022-07-13 18:16:24,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 18:16:24,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 56 [2022-07-13 18:16:24,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:24,436 INFO L225 Difference]: With dead ends: 10612 [2022-07-13 18:16:24,436 INFO L226 Difference]: Without dead ends: 6462 [2022-07-13 18:16:24,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:24,443 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 684 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:24,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 514 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:24,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6462 states. [2022-07-13 18:16:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6462 to 4868. [2022-07-13 18:16:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4868 states, 4867 states have (on average 1.5062666940620506) internal successors, (7331), 4867 states have internal predecessors, (7331), 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-07-13 18:16:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 7331 transitions. [2022-07-13 18:16:24,639 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 7331 transitions. Word has length 56 [2022-07-13 18:16:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:24,639 INFO L495 AbstractCegarLoop]: Abstraction has 4868 states and 7331 transitions. [2022-07-13 18:16:24,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-07-13 18:16:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 7331 transitions. [2022-07-13 18:16:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 18:16:24,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:24,643 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-13 18:16:24,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 18:16:24,643 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:24,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash 138410889, now seen corresponding path program 1 times [2022-07-13 18:16:24,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:24,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580846834] [2022-07-13 18:16:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:24,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:24,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:24,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580846834] [2022-07-13 18:16:24,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580846834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:24,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:24,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:24,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510837256] [2022-07-13 18:16:24,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:24,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:24,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:24,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:24,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:24,664 INFO L87 Difference]: Start difference. First operand 4868 states and 7331 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-07-13 18:16:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:24,838 INFO L93 Difference]: Finished difference Result 10083 states and 15152 transitions. [2022-07-13 18:16:24,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:24,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 90 [2022-07-13 18:16:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:24,847 INFO L225 Difference]: With dead ends: 10083 [2022-07-13 18:16:24,847 INFO L226 Difference]: Without dead ends: 5244 [2022-07-13 18:16:24,851 INFO L412 NwaCegarLoop]: 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-07-13 18:16:24,852 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 128 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:24,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 311 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:24,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2022-07-13 18:16:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 5212. [2022-07-13 18:16:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5212 states, 5211 states have (on average 1.459220878909998) internal successors, (7604), 5211 states have internal predecessors, (7604), 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-07-13 18:16:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5212 states to 5212 states and 7604 transitions. [2022-07-13 18:16:25,026 INFO L78 Accepts]: Start accepts. Automaton has 5212 states and 7604 transitions. Word has length 90 [2022-07-13 18:16:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:25,026 INFO L495 AbstractCegarLoop]: Abstraction has 5212 states and 7604 transitions. [2022-07-13 18:16:25,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-07-13 18:16:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 5212 states and 7604 transitions. [2022-07-13 18:16:25,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 18:16:25,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:25,030 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-13 18:16:25,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 18:16:25,053 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:25,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:25,053 INFO L85 PathProgramCache]: Analyzing trace with hash -56607288, now seen corresponding path program 1 times [2022-07-13 18:16:25,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:25,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564270372] [2022-07-13 18:16:25,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:25,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:25,072 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:25,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:25,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564270372] [2022-07-13 18:16:25,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564270372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:25,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:25,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:25,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237350563] [2022-07-13 18:16:25,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:25,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:25,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:25,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:25,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:25,075 INFO L87 Difference]: Start difference. First operand 5212 states and 7604 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-07-13 18:16:25,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:25,299 INFO L93 Difference]: Finished difference Result 10937 states and 15918 transitions. [2022-07-13 18:16:25,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:25,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2022-07-13 18:16:25,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:25,309 INFO L225 Difference]: With dead ends: 10937 [2022-07-13 18:16:25,309 INFO L226 Difference]: Without dead ends: 5766 [2022-07-13 18:16:25,315 INFO L412 NwaCegarLoop]: 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-07-13 18:16:25,316 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 127 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:25,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 310 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2022-07-13 18:16:25,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5718. [2022-07-13 18:16:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5718 states, 5717 states have (on average 1.4131537519678152) internal successors, (8079), 5717 states have internal predecessors, (8079), 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-07-13 18:16:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5718 states to 5718 states and 8079 transitions. [2022-07-13 18:16:25,537 INFO L78 Accepts]: Start accepts. Automaton has 5718 states and 8079 transitions. Word has length 91 [2022-07-13 18:16:25,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:25,537 INFO L495 AbstractCegarLoop]: Abstraction has 5718 states and 8079 transitions. [2022-07-13 18:16:25,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-07-13 18:16:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 5718 states and 8079 transitions. [2022-07-13 18:16:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-13 18:16:25,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:25,541 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-13 18:16:25,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 18:16:25,542 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:25,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:25,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1840400199, now seen corresponding path program 1 times [2022-07-13 18:16:25,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:25,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633528263] [2022-07-13 18:16:25,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:25,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:25,558 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:25,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:25,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633528263] [2022-07-13 18:16:25,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633528263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:25,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:25,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:25,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828312696] [2022-07-13 18:16:25,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:25,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:25,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:25,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:25,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:25,561 INFO L87 Difference]: Start difference. First operand 5718 states and 8079 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-07-13 18:16:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:25,738 INFO L93 Difference]: Finished difference Result 11756 states and 16622 transitions. [2022-07-13 18:16:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:25,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 92 [2022-07-13 18:16:25,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:25,748 INFO L225 Difference]: With dead ends: 11756 [2022-07-13 18:16:25,748 INFO L226 Difference]: Without dead ends: 6099 [2022-07-13 18:16:25,754 INFO L412 NwaCegarLoop]: 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-07-13 18:16:25,755 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 123 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:25,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 307 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:25,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6099 states. [2022-07-13 18:16:25,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6099 to 5484. [2022-07-13 18:16:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5484 states, 5483 states have (on average 1.3549151924129126) internal successors, (7429), 5483 states have internal predecessors, (7429), 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-07-13 18:16:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 7429 transitions. [2022-07-13 18:16:25,976 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 7429 transitions. Word has length 92 [2022-07-13 18:16:25,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:25,977 INFO L495 AbstractCegarLoop]: Abstraction has 5484 states and 7429 transitions. [2022-07-13 18:16:25,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-07-13 18:16:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 7429 transitions. [2022-07-13 18:16:25,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-13 18:16:25,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:25,981 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-13 18:16:25,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 18:16:25,981 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:25,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:25,982 INFO L85 PathProgramCache]: Analyzing trace with hash -195529206, now seen corresponding path program 1 times [2022-07-13 18:16:25,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:25,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047567312] [2022-07-13 18:16:25,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:25,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 18:16:26,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:26,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047567312] [2022-07-13 18:16:26,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047567312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:26,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:26,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:16:26,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239531342] [2022-07-13 18:16:26,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:26,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:16:26,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:26,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:16:26,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:16:26,006 INFO L87 Difference]: Start difference. First operand 5484 states and 7429 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-07-13 18:16:26,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:26,285 INFO L93 Difference]: Finished difference Result 10260 states and 13825 transitions. [2022-07-13 18:16:26,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:16:26,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 93 [2022-07-13 18:16:26,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:26,292 INFO L225 Difference]: With dead ends: 10260 [2022-07-13 18:16:26,292 INFO L226 Difference]: Without dead ends: 5263 [2022-07-13 18:16:26,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07-13 18:16:26,295 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 441 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:26,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 390 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:26,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2022-07-13 18:16:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5149. [2022-07-13 18:16:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5149 states, 5148 states have (on average 1.3090520590520591) internal successors, (6739), 5148 states have internal predecessors, (6739), 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-07-13 18:16:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5149 states to 5149 states and 6739 transitions. [2022-07-13 18:16:26,473 INFO L78 Accepts]: Start accepts. Automaton has 5149 states and 6739 transitions. Word has length 93 [2022-07-13 18:16:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:26,474 INFO L495 AbstractCegarLoop]: Abstraction has 5149 states and 6739 transitions. [2022-07-13 18:16:26,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-07-13 18:16:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 5149 states and 6739 transitions. [2022-07-13 18:16:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-13 18:16:26,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:26,481 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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, 1, 1] [2022-07-13 18:16:26,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 18:16:26,481 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:26,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:26,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1965826331, now seen corresponding path program 1 times [2022-07-13 18:16:26,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:26,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290550924] [2022-07-13 18:16:26,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:26,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 18:16:26,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:26,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290550924] [2022-07-13 18:16:26,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290550924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:26,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:26,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:26,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830153626] [2022-07-13 18:16:26,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:26,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:26,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:26,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:26,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:26,503 INFO L87 Difference]: Start difference. First operand 5149 states and 6739 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-07-13 18:16:26,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:26,717 INFO L93 Difference]: Finished difference Result 9832 states and 12854 transitions. [2022-07-13 18:16:26,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:26,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 122 [2022-07-13 18:16:26,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:26,724 INFO L225 Difference]: With dead ends: 9832 [2022-07-13 18:16:26,725 INFO L226 Difference]: Without dead ends: 5095 [2022-07-13 18:16:26,729 INFO L412 NwaCegarLoop]: 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-07-13 18:16:26,730 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 34 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:26,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 301 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:26,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5095 states. [2022-07-13 18:16:26,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5095 to 5095. [2022-07-13 18:16:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 5094 states have (on average 1.302120141342756) internal successors, (6633), 5094 states have internal predecessors, (6633), 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-07-13 18:16:26,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 6633 transitions. [2022-07-13 18:16:26,962 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 6633 transitions. Word has length 122 [2022-07-13 18:16:26,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:26,962 INFO L495 AbstractCegarLoop]: Abstraction has 5095 states and 6633 transitions. [2022-07-13 18:16:26,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-07-13 18:16:26,962 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 6633 transitions. [2022-07-13 18:16:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 18:16:26,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:26,969 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 18:16:26,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 18:16:26,970 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:26,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:26,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1720762163, now seen corresponding path program 1 times [2022-07-13 18:16:26,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:26,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274333340] [2022-07-13 18:16:26,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:26,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 18:16:27,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:27,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274333340] [2022-07-13 18:16:27,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274333340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:27,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:27,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:16:27,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543376961] [2022-07-13 18:16:27,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:27,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:16:27,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:27,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:16:27,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:16:27,015 INFO L87 Difference]: Start difference. First operand 5095 states and 6633 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-07-13 18:16:27,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:27,242 INFO L93 Difference]: Finished difference Result 9065 states and 11821 transitions. [2022-07-13 18:16:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:16:27,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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 135 [2022-07-13 18:16:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:27,250 INFO L225 Difference]: With dead ends: 9065 [2022-07-13 18:16:27,250 INFO L226 Difference]: Without dead ends: 5011 [2022-07-13 18:16:27,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07-13 18:16:27,256 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 306 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:27,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 312 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2022-07-13 18:16:27,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 5009. [2022-07-13 18:16:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5009 states, 5008 states have (on average 1.279552715654952) internal successors, (6408), 5008 states have internal predecessors, (6408), 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-07-13 18:16:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5009 states to 5009 states and 6408 transitions. [2022-07-13 18:16:27,490 INFO L78 Accepts]: Start accepts. Automaton has 5009 states and 6408 transitions. Word has length 135 [2022-07-13 18:16:27,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:27,490 INFO L495 AbstractCegarLoop]: Abstraction has 5009 states and 6408 transitions. [2022-07-13 18:16:27,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-07-13 18:16:27,490 INFO L276 IsEmpty]: Start isEmpty. Operand 5009 states and 6408 transitions. [2022-07-13 18:16:27,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-13 18:16:27,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:27,498 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 18:16:27,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 18:16:27,499 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:27,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:27,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1604483709, now seen corresponding path program 1 times [2022-07-13 18:16:27,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:27,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119171189] [2022-07-13 18:16:27,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:27,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 18:16:27,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:27,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119171189] [2022-07-13 18:16:27,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119171189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:27,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:27,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:27,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035043730] [2022-07-13 18:16:27,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:27,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:27,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:27,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:27,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:27,535 INFO L87 Difference]: Start difference. First operand 5009 states and 6408 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-07-13 18:16:27,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:27,700 INFO L93 Difference]: Finished difference Result 9599 states and 12268 transitions. [2022-07-13 18:16:27,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:27,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 141 [2022-07-13 18:16:27,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:27,709 INFO L225 Difference]: With dead ends: 9599 [2022-07-13 18:16:27,709 INFO L226 Difference]: Without dead ends: 5009 [2022-07-13 18:16:27,714 INFO L412 NwaCegarLoop]: 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-07-13 18:16:27,715 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 25 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 300 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-07-13 18:16:27,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 300 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:27,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5009 states. [2022-07-13 18:16:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5009 to 4969. [2022-07-13 18:16:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4969 states, 4968 states have (on average 1.2733494363929148) internal successors, (6326), 4968 states have internal predecessors, (6326), 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-07-13 18:16:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4969 states to 4969 states and 6326 transitions. [2022-07-13 18:16:27,899 INFO L78 Accepts]: Start accepts. Automaton has 4969 states and 6326 transitions. Word has length 141 [2022-07-13 18:16:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:27,899 INFO L495 AbstractCegarLoop]: Abstraction has 4969 states and 6326 transitions. [2022-07-13 18:16:27,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-07-13 18:16:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4969 states and 6326 transitions. [2022-07-13 18:16:27,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-13 18:16:27,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:27,906 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 18:16:27,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 18:16:27,907 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:27,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:27,907 INFO L85 PathProgramCache]: Analyzing trace with hash -371935883, now seen corresponding path program 1 times [2022-07-13 18:16:27,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:27,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933621513] [2022-07-13 18:16:27,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:27,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 18:16:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:27,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933621513] [2022-07-13 18:16:27,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933621513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:27,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:27,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:27,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308283849] [2022-07-13 18:16:27,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:27,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:27,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:27,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:27,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:27,932 INFO L87 Difference]: Start difference. First operand 4969 states and 6326 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-07-13 18:16:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:28,096 INFO L93 Difference]: Finished difference Result 9547 states and 12146 transitions. [2022-07-13 18:16:28,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:28,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 141 [2022-07-13 18:16:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:28,108 INFO L225 Difference]: With dead ends: 9547 [2022-07-13 18:16:28,108 INFO L226 Difference]: Without dead ends: 4978 [2022-07-13 18:16:28,113 INFO L412 NwaCegarLoop]: 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-07-13 18:16:28,114 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 21 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 299 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-07-13 18:16:28,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 299 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4978 states. [2022-07-13 18:16:28,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4978 to 4938. [2022-07-13 18:16:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4938 states, 4937 states have (on average 1.2667611910066843) internal successors, (6254), 4937 states have internal predecessors, (6254), 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-07-13 18:16:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 6254 transitions. [2022-07-13 18:16:28,316 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 6254 transitions. Word has length 141 [2022-07-13 18:16:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:28,316 INFO L495 AbstractCegarLoop]: Abstraction has 4938 states and 6254 transitions. [2022-07-13 18:16:28,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-07-13 18:16:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 6254 transitions. [2022-07-13 18:16:28,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-13 18:16:28,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:28,323 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 18:16:28,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 18:16:28,324 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:28,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:28,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1226586588, now seen corresponding path program 1 times [2022-07-13 18:16:28,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:28,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985596671] [2022-07-13 18:16:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:28,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:28,359 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 18:16:28,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:28,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985596671] [2022-07-13 18:16:28,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985596671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:28,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:28,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:16:28,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461303488] [2022-07-13 18:16:28,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:28,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:16:28,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:28,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:16:28,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:16:28,361 INFO L87 Difference]: Start difference. First operand 4938 states and 6254 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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-07-13 18:16:28,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:28,509 INFO L93 Difference]: Finished difference Result 8060 states and 10251 transitions. [2022-07-13 18:16:28,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:16:28,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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 145 [2022-07-13 18:16:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:28,515 INFO L225 Difference]: With dead ends: 8060 [2022-07-13 18:16:28,516 INFO L226 Difference]: Without dead ends: 3522 [2022-07-13 18:16:28,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07-13 18:16:28,521 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 278 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:28,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 291 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3522 states. [2022-07-13 18:16:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3522 to 3520. [2022-07-13 18:16:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 3519 states have (on average 1.2358624609263995) internal successors, (4349), 3519 states have internal predecessors, (4349), 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-07-13 18:16:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4349 transitions. [2022-07-13 18:16:28,654 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4349 transitions. Word has length 145 [2022-07-13 18:16:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:28,655 INFO L495 AbstractCegarLoop]: Abstraction has 3520 states and 4349 transitions. [2022-07-13 18:16:28,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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-07-13 18:16:28,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4349 transitions. [2022-07-13 18:16:28,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-13 18:16:28,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:28,659 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 18:16:28,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 18:16:28,660 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:28,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:28,660 INFO L85 PathProgramCache]: Analyzing trace with hash 546835114, now seen corresponding path program 1 times [2022-07-13 18:16:28,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:28,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087336763] [2022-07-13 18:16:28,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:28,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 18:16:28,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:28,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087336763] [2022-07-13 18:16:28,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087336763] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:28,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:28,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:16:28,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543977914] [2022-07-13 18:16:28,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:28,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:16:28,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:28,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:16:28,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:16:28,685 INFO L87 Difference]: Start difference. First operand 3520 states and 4349 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-07-13 18:16:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:28,787 INFO L93 Difference]: Finished difference Result 5695 states and 7039 transitions. [2022-07-13 18:16:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:16:28,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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 145 [2022-07-13 18:16:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:28,791 INFO L225 Difference]: With dead ends: 5695 [2022-07-13 18:16:28,791 INFO L226 Difference]: Without dead ends: 2256 [2022-07-13 18:16:28,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07-13 18:16:28,795 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 282 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:28,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 284 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2022-07-13 18:16:28,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2254. [2022-07-13 18:16:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2253 states have (on average 1.2041722148246783) internal successors, (2713), 2253 states have internal predecessors, (2713), 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-07-13 18:16:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 2713 transitions. [2022-07-13 18:16:28,878 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 2713 transitions. Word has length 145 [2022-07-13 18:16:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:28,878 INFO L495 AbstractCegarLoop]: Abstraction has 2254 states and 2713 transitions. [2022-07-13 18:16:28,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-07-13 18:16:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 2713 transitions. [2022-07-13 18:16:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-13 18:16:28,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:28,880 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 18:16:28,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 18:16:28,880 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:28,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:28,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1626731220, now seen corresponding path program 1 times [2022-07-13 18:16:28,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:28,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299062358] [2022-07-13 18:16:28,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:28,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 18:16:28,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:28,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299062358] [2022-07-13 18:16:28,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299062358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:28,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:28,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:28,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615890591] [2022-07-13 18:16:28,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:28,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:28,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:28,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:28,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:28,915 INFO L87 Difference]: Start difference. First operand 2254 states and 2713 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-07-13 18:16:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:29,001 INFO L93 Difference]: Finished difference Result 4070 states and 4934 transitions. [2022-07-13 18:16:29,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:29,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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 184 [2022-07-13 18:16:29,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:29,005 INFO L225 Difference]: With dead ends: 4070 [2022-07-13 18:16:29,005 INFO L226 Difference]: Without dead ends: 2192 [2022-07-13 18:16:29,006 INFO L412 NwaCegarLoop]: 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-07-13 18:16:29,007 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 1 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:29,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 300 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:29,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2022-07-13 18:16:29,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2114. [2022-07-13 18:16:29,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 2113 states have (on average 1.1902508282063418) internal successors, (2515), 2113 states have internal predecessors, (2515), 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-07-13 18:16:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2515 transitions. [2022-07-13 18:16:29,081 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2515 transitions. Word has length 184 [2022-07-13 18:16:29,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:29,081 INFO L495 AbstractCegarLoop]: Abstraction has 2114 states and 2515 transitions. [2022-07-13 18:16:29,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-07-13 18:16:29,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2515 transitions. [2022-07-13 18:16:29,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-13 18:16:29,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:29,083 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 18:16:29,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-13 18:16:29,083 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:29,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1822764650, now seen corresponding path program 1 times [2022-07-13 18:16:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:29,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030227635] [2022-07-13 18:16:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-13 18:16:29,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:29,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030227635] [2022-07-13 18:16:29,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030227635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:29,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:29,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:29,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752240881] [2022-07-13 18:16:29,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:29,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:29,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:29,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:29,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:29,114 INFO L87 Difference]: Start difference. First operand 2114 states and 2515 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-07-13 18:16:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:29,205 INFO L93 Difference]: Finished difference Result 4533 states and 5432 transitions. [2022-07-13 18:16:29,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:29,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 191 [2022-07-13 18:16:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:29,209 INFO L225 Difference]: With dead ends: 4533 [2022-07-13 18:16:29,210 INFO L226 Difference]: Without dead ends: 2789 [2022-07-13 18:16:29,211 INFO L412 NwaCegarLoop]: 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-07-13 18:16:29,211 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 132 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:29,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 298 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:29,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2022-07-13 18:16:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 2408. [2022-07-13 18:16:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 2407 states have (on average 1.1761528874117158) internal successors, (2831), 2407 states have internal predecessors, (2831), 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-07-13 18:16:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 2831 transitions. [2022-07-13 18:16:29,298 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 2831 transitions. Word has length 191 [2022-07-13 18:16:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:29,298 INFO L495 AbstractCegarLoop]: Abstraction has 2408 states and 2831 transitions. [2022-07-13 18:16:29,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-07-13 18:16:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 2831 transitions. [2022-07-13 18:16:29,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-13 18:16:29,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:29,300 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 18:16:29,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-13 18:16:29,300 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:29,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:29,301 INFO L85 PathProgramCache]: Analyzing trace with hash 377236115, now seen corresponding path program 1 times [2022-07-13 18:16:29,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:29,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207889483] [2022-07-13 18:16:29,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:29,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 18:16:29,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:29,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207889483] [2022-07-13 18:16:29,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207889483] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:16:29,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232719569] [2022-07-13 18:16:29,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:29,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:16:29,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:16:29,439 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-07-13 18:16:29,471 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-07-13 18:16:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:29,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 18:16:29,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:16:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 18:16:29,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:16:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 18:16:30,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232719569] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:16:30,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:16:30,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 27 [2022-07-13 18:16:30,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458550831] [2022-07-13 18:16:30,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:16:30,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 18:16:30,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:30,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 18:16:30,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-07-13 18:16:30,193 INFO L87 Difference]: Start difference. First operand 2408 states and 2831 transitions. Second operand has 27 states, 27 states have (on average 17.51851851851852) internal successors, (473), 27 states have internal predecessors, (473), 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-07-13 18:16:32,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:32,199 INFO L93 Difference]: Finished difference Result 9992 states and 11725 transitions. [2022-07-13 18:16:32,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-07-13 18:16:32,200 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 17.51851851851852) internal successors, (473), 27 states have internal predecessors, (473), 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 194 [2022-07-13 18:16:32,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:32,210 INFO L225 Difference]: With dead ends: 9992 [2022-07-13 18:16:32,211 INFO L226 Difference]: Without dead ends: 7941 [2022-07-13 18:16:32,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=745, Invalid=5735, Unknown=0, NotChecked=0, Total=6480 [2022-07-13 18:16:32,216 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 3720 mSDsluCounter, 10174 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3720 SdHoareTripleChecker+Valid, 10776 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:32,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3720 Valid, 10776 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 18:16:32,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7941 states. [2022-07-13 18:16:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7941 to 3429. [2022-07-13 18:16:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3429 states, 3428 states have (on average 1.175029171528588) internal successors, (4028), 3428 states have internal predecessors, (4028), 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-07-13 18:16:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 4028 transitions. [2022-07-13 18:16:32,417 INFO L78 Accepts]: Start accepts. Automaton has 3429 states and 4028 transitions. Word has length 194 [2022-07-13 18:16:32,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:32,417 INFO L495 AbstractCegarLoop]: Abstraction has 3429 states and 4028 transitions. [2022-07-13 18:16:32,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 17.51851851851852) internal successors, (473), 27 states have internal predecessors, (473), 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-07-13 18:16:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 4028 transitions. [2022-07-13 18:16:32,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-13 18:16:32,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:32,420 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 18:16:32,440 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-07-13 18:16:32,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-07-13 18:16:32,641 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:32,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:32,642 INFO L85 PathProgramCache]: Analyzing trace with hash -714863608, now seen corresponding path program 1 times [2022-07-13 18:16:32,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:32,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069290445] [2022-07-13 18:16:32,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:32,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-13 18:16:32,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:32,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069290445] [2022-07-13 18:16:32,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069290445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:32,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:32,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:32,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736510510] [2022-07-13 18:16:32,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:32,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:32,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:32,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:32,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:32,682 INFO L87 Difference]: Start difference. First operand 3429 states and 4028 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-07-13 18:16:32,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:32,808 INFO L93 Difference]: Finished difference Result 5329 states and 6235 transitions. [2022-07-13 18:16:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:32,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 263 [2022-07-13 18:16:32,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:32,811 INFO L225 Difference]: With dead ends: 5329 [2022-07-13 18:16:32,812 INFO L226 Difference]: Without dead ends: 2305 [2022-07-13 18:16:32,814 INFO L412 NwaCegarLoop]: 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-07-13 18:16:32,814 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 3 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:32,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 314 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:32,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2022-07-13 18:16:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2272. [2022-07-13 18:16:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2271 states have (on average 1.1501541171290182) internal successors, (2612), 2271 states have internal predecessors, (2612), 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-07-13 18:16:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2612 transitions. [2022-07-13 18:16:32,936 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2612 transitions. Word has length 263 [2022-07-13 18:16:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:32,936 INFO L495 AbstractCegarLoop]: Abstraction has 2272 states and 2612 transitions. [2022-07-13 18:16:32,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-07-13 18:16:32,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2612 transitions. [2022-07-13 18:16:32,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-13 18:16:32,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:32,940 INFO L195 NwaCegarLoop]: trace histogram [10, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 18:16:32,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-13 18:16:32,940 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:32,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:32,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1759293355, now seen corresponding path program 1 times [2022-07-13 18:16:32,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:32,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124155883] [2022-07-13 18:16:32,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:32,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 18:16:32,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:32,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124155883] [2022-07-13 18:16:32,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124155883] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:32,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:32,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:16:32,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458000108] [2022-07-13 18:16:32,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:32,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:16:32,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:32,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:16:32,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:16:32,994 INFO L87 Difference]: Start difference. First operand 2272 states and 2612 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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-07-13 18:16:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:33,134 INFO L93 Difference]: Finished difference Result 4253 states and 4901 transitions. [2022-07-13 18:16:33,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:16:33,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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 271 [2022-07-13 18:16:33,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:33,137 INFO L225 Difference]: With dead ends: 4253 [2022-07-13 18:16:33,137 INFO L226 Difference]: Without dead ends: 2273 [2022-07-13 18:16:33,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07-13 18:16:33,140 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 191 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:33,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 225 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:33,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2022-07-13 18:16:33,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2272. [2022-07-13 18:16:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2271 states have (on average 1.141347424042272) internal successors, (2592), 2271 states have internal predecessors, (2592), 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-07-13 18:16:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2592 transitions. [2022-07-13 18:16:33,237 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2592 transitions. Word has length 271 [2022-07-13 18:16:33,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:33,238 INFO L495 AbstractCegarLoop]: Abstraction has 2272 states and 2592 transitions. [2022-07-13 18:16:33,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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-07-13 18:16:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2592 transitions. [2022-07-13 18:16:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-07-13 18:16:33,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:33,240 INFO L195 NwaCegarLoop]: trace histogram [10, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 18:16:33,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-13 18:16:33,240 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:33,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:33,241 INFO L85 PathProgramCache]: Analyzing trace with hash 550996924, now seen corresponding path program 1 times [2022-07-13 18:16:33,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:33,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556328077] [2022-07-13 18:16:33,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:33,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 18:16:33,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:33,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556328077] [2022-07-13 18:16:33,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556328077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:33,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:33,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:33,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222666587] [2022-07-13 18:16:33,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:33,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:33,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:33,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:33,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:33,274 INFO L87 Difference]: Start difference. First operand 2272 states and 2592 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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-07-13 18:16:33,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:33,319 INFO L93 Difference]: Finished difference Result 2676 states and 3041 transitions. [2022-07-13 18:16:33,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:33,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 273 [2022-07-13 18:16:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:33,320 INFO L225 Difference]: With dead ends: 2676 [2022-07-13 18:16:33,320 INFO L226 Difference]: Without dead ends: 809 [2022-07-13 18:16:33,322 INFO L412 NwaCegarLoop]: 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-07-13 18:16:33,322 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 28 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:33,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 302 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-13 18:16:33,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2022-07-13 18:16:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 1.103960396039604) internal successors, (892), 808 states have internal predecessors, (892), 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-07-13 18:16:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 892 transitions. [2022-07-13 18:16:33,358 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 892 transitions. Word has length 273 [2022-07-13 18:16:33,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:33,358 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 892 transitions. [2022-07-13 18:16:33,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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-07-13 18:16:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 892 transitions. [2022-07-13 18:16:33,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2022-07-13 18:16:33,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:33,360 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 18:16:33,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-13 18:16:33,360 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:33,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:33,361 INFO L85 PathProgramCache]: Analyzing trace with hash 249689584, now seen corresponding path program 1 times [2022-07-13 18:16:33,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:33,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787890784] [2022-07-13 18:16:33,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:33,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-07-13 18:16:33,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:33,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787890784] [2022-07-13 18:16:33,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787890784] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:33,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:33,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:16:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780936857] [2022-07-13 18:16:33,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:33,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:33,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:33,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:16:33,412 INFO L87 Difference]: Start difference. First operand 809 states and 892 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-07-13 18:16:33,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:33,447 INFO L93 Difference]: Finished difference Result 1090 states and 1202 transitions. [2022-07-13 18:16:33,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:33,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 290 [2022-07-13 18:16:33,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:33,448 INFO L225 Difference]: With dead ends: 1090 [2022-07-13 18:16:33,448 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 18:16:33,449 INFO L412 NwaCegarLoop]: 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-07-13 18:16:33,449 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 3 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:33,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 283 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:33,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 18:16:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 18:16:33,450 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-07-13 18:16:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 18:16:33,450 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 290 [2022-07-13 18:16:33,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:33,451 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 18:16:33,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-07-13 18:16:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 18:16:33,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 18:16:33,453 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 18:16:33,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-13 18:16:33,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 18:16:54,268 WARN L233 SmtUtils]: Spent 16.53s on a formula simplification. DAG size of input: 227 DAG size of output: 227 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-13 18:17:24,565 INFO L899 garLoopResultBuilder]: For program point L597(lines 545 685) no Hoare annotation was computed. [2022-07-13 18:17:24,565 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 568) no Hoare annotation was computed. [2022-07-13 18:17:24,565 INFO L899 garLoopResultBuilder]: For program point L564-2(lines 545 685) no Hoare annotation was computed. [2022-07-13 18:17:24,565 INFO L899 garLoopResultBuilder]: For program point L366(lines 298 396) no Hoare annotation was computed. [2022-07-13 18:17:24,565 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 238) no Hoare annotation was computed. [2022-07-13 18:17:24,565 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 110) no Hoare annotation was computed. [2022-07-13 18:17:24,565 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 77) no Hoare annotation was computed. [2022-07-13 18:17:24,565 INFO L899 garLoopResultBuilder]: For program point L598(lines 598 602) no Hoare annotation was computed. [2022-07-13 18:17:24,565 INFO L895 garLoopResultBuilder]: At program point L235(lines 230 257) the Hoare annotation is: (let ((.cse22 (= ~c2_st~0 0)) (.cse24 (= ~c1_st~0 0))) (let ((.cse13 (not .cse24)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse14 (not .cse22)) (.cse15 (= ~wb_pc~0 1)) (.cse2 (not (= ~e_g~0 1))) (.cse3 (not (= ~e_e~0 0))) (.cse4 (not (= ~e_c~0 0))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_e~0 1))) (.cse7 (not (= ~e_wl~0 1))) (.cse8 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse9 (= ~c2_i~0 1)) (.cse10 (= ~e_f~0 2)) (.cse17 (= ~c1_pc~0 1)) (.cse18 (not (= ~wb_st~0 0))) (.cse19 (not (= ~r_st~0 0))) (.cse20 (= ~c2_pc~0 1)) (.cse21 (= ~processed~0 0)) (.cse11 (not (= ~e_wl~0 0))) (.cse23 (= ~data~0 (+ ~t_b~0 1))) (.cse12 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ~wl_pc~0) .cse12) (and .cse0 .cse1 .cse13 .cse14 .cse15 (= (+ ~t_b~0 2) ~data~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse18 .cse19 .cse20 .cse21 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse15 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse18 .cse19 .cse20 .cse21 .cse11 .cse23 .cse12) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 (not (= 2 ~wl_pc~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse20 .cse11 .cse12) (and .cse0 .cse1 .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse18 .cse19 .cse20 .cse21 .cse11 .cse23 .cse24 .cse12)))) [2022-07-13 18:17:24,565 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 107) no Hoare annotation was computed. [2022-07-13 18:17:24,566 INFO L895 garLoopResultBuilder]: At program point L70(lines 65 135) the Hoare annotation is: (and (let ((.cse22 (+ ~t_b~0 1)) (.cse4 (+ ~t_b~0 2))) (let ((.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (or (= .cse22 ~d~0) (= .cse4 ~d~0))) (.cse3 (= ~wb_pc~0 1)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (not (= ~e_e~0 0))) (.cse7 (not (= ~r_i~0 1))) (.cse8 (or (= .cse4 ~c~0) (= .cse22 ~c~0))) (.cse9 (not (= ~e_e~0 1))) (.cse10 (not (= ~e_wl~0 1))) (.cse11 (= ~c1_i~0 1)) (.cse12 (= ~e_c~0 2)) (.cse13 (= ~c2_i~0 1)) (.cse14 (= ~e_f~0 2)) (.cse15 (= ~c1_pc~0 1)) (.cse16 (not (= ~wb_st~0 0))) (.cse17 (not (= ~r_st~0 0))) (.cse18 (= ~c2_pc~0 1)) (.cse19 (or (= ~c_t~0 .cse22) (= .cse4 ~c_t~0))) (.cse20 (not (= ~e_wl~0 0))) (.cse21 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= .cse4 ~data~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= ~data~0 .cse22) .cse21)))) (= 2 ~wl_pc~0)) [2022-07-13 18:17:24,566 INFO L899 garLoopResultBuilder]: For program point L434-1(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,566 INFO L899 garLoopResultBuilder]: For program point L534-1(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,566 INFO L899 garLoopResultBuilder]: For program point L336(lines 298 396) no Hoare annotation was computed. [2022-07-13 18:17:24,566 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 319) no Hoare annotation was computed. [2022-07-13 18:17:24,566 INFO L895 garLoopResultBuilder]: At program point L204-1(lines 185 225) the Hoare annotation is: (let ((.cse37 (+ ~t_b~0 1)) (.cse33 (= ~wb_st~0 0)) (.cse19 (= ~c1_st~0 0)) (.cse20 (= 0 ~wl_pc~0)) (.cse38 (+ ~t_b~0 2))) (let ((.cse26 (= .cse38 ~data~0)) (.cse1 (= ~d~0 0)) (.cse4 (= ~c1_pc~0 0)) (.cse6 (= ~t_b~0 0)) (.cse8 (= ~data~0 0)) (.cse35 (not (= 2 ~wl_pc~0))) (.cse36 (not .cse20)) (.cse32 (= ~wb_pc~0 0)) (.cse17 (= ~processed~0 0)) (.cse23 (= ~r_st~0 ~e_f~0)) (.cse21 (= ~c_req_up~0 ~r_i~0)) (.cse24 (not (= 0 ~wl_st~0))) (.cse0 (not (= ~e_g~0 0))) (.cse25 (not .cse19)) (.cse2 (not (= ~c2_st~0 0))) (.cse3 (= ~wb_pc~0 1)) (.cse5 (not (= ~e_g~0 1))) (.cse7 (not (= ~e_e~0 0))) (.cse27 (not (= ~e_c~0 0))) (.cse9 (not (= ~r_i~0 1))) (.cse10 (not (= ~e_e~0 1))) (.cse11 (not (= ~e_wl~0 1))) (.cse12 (= ~c1_i~0 1)) (.cse13 (= ~e_c~0 2)) (.cse14 (= ~c2_i~0 1)) (.cse15 (= ~e_f~0 2)) (.cse28 (= ~c1_pc~0 1)) (.cse16 (not .cse33)) (.cse29 (not (= ~r_st~0 0))) (.cse30 (= ~c2_pc~0 1)) (.cse31 (or (= ~c_t~0 .cse37) (= .cse38 ~c_t~0))) (.cse18 (not (= ~e_wl~0 0))) (.cse34 (= ~data~0 .cse37)) (.cse22 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse25 .cse2 .cse3 .cse26 .cse5 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse29 .cse30 .cse31 .cse18 .cse22) (and .cse0 .cse25 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse32 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse17 .cse18 .cse20 .cse33 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse2 .cse3 .cse5 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse29 .cse30 .cse17 .cse18 .cse34 .cse19 .cse33 .cse22) (and .cse24 .cse0 .cse25 .cse2 .cse3 .cse26 .cse5 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse29 .cse30 .cse17 .cse18 .cse33 .cse22) (and .cse24 .cse0 .cse5 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse18 .cse20 .cse22) (and .cse24 .cse0 .cse25 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse35 .cse36 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse32 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse33 .cse21 .cse22 .cse23) (and .cse0 .cse25 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse25 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse35 .cse36 .cse9 .cse10 .cse32 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse17 .cse33 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse3 .cse5 .cse7 .cse27 .cse35 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse28 .cse30 .cse18 .cse22) (and .cse24 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse35 .cse36 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse35 .cse36 .cse9 .cse10 .cse32 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19 .cse33 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse25 .cse2 .cse3 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse29 .cse30 .cse18 .cse21 .cse22) (and .cse24 .cse0 .cse25 .cse2 .cse3 .cse5 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse29 .cse30 .cse31 .cse18 .cse34 .cse22)))) [2022-07-13 18:17:24,566 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 76) no Hoare annotation was computed. [2022-07-13 18:17:24,566 INFO L899 garLoopResultBuilder]: For program point L667(lines 667 683) no Hoare annotation was computed. [2022-07-13 18:17:24,566 INFO L899 garLoopResultBuilder]: For program point L634-1(lines 545 685) no Hoare annotation was computed. [2022-07-13 18:17:24,566 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 377) no Hoare annotation was computed. [2022-07-13 18:17:24,566 INFO L899 garLoopResultBuilder]: For program point L569-1(lines 545 685) no Hoare annotation was computed. [2022-07-13 18:17:24,566 INFO L899 garLoopResultBuilder]: For program point L470(lines 470 474) no Hoare annotation was computed. [2022-07-13 18:17:24,566 INFO L895 garLoopResultBuilder]: At program point L272(lines 265 282) the Hoare annotation is: (let ((.cse24 (+ ~t_b~0 1)) (.cse6 (+ ~t_b~0 2))) (let ((.cse2 (not (= ~c1_st~0 0))) (.cse3 (or (= .cse24 ~d~0) (= .cse6 ~d~0))) (.cse4 (not (= ~c2_st~0 0))) (.cse11 (or (= .cse6 ~c~0) (= .cse24 ~c~0))) (.cse14 (= ~e_c~0 2)) (.cse18 (not (= ~wb_st~0 0))) (.cse21 (or (= ~c_t~0 .cse24) (= .cse6 ~c_t~0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse5 (= ~wb_pc~0 1)) (.cse7 (not (= ~e_g~0 1))) (.cse8 (not (= ~e_e~0 0))) (.cse9 (not (= ~e_c~0 0))) (.cse10 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_wl~0 1))) (.cse13 (= ~c1_i~0 1)) (.cse15 (= ~c2_i~0 1)) (.cse16 (= ~e_f~0 2)) (.cse17 (= ~c1_pc~0 1)) (.cse19 (not (= ~r_st~0 0))) (.cse20 (= ~c2_pc~0 1)) (.cse22 (not (= ~e_wl~0 0))) (.cse23 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 ~data~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= ~data~0 .cse24) .cse23) (and .cse0 .cse1 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse22 (= 0 ~wl_pc~0) .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse8 .cse9 (not (= 2 ~wl_pc~0)) .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse22 .cse23)))) [2022-07-13 18:17:24,566 INFO L899 garLoopResultBuilder]: For program point L306(lines 306 318) no Hoare annotation was computed. [2022-07-13 18:17:24,567 INFO L899 garLoopResultBuilder]: For program point L273(lines 265 282) no Hoare annotation was computed. [2022-07-13 18:17:24,567 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2022-07-13 18:17:24,567 INFO L899 garLoopResultBuilder]: For program point L207-1(lines 207 215) no Hoare annotation was computed. [2022-07-13 18:17:24,567 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 149) no Hoare annotation was computed. [2022-07-13 18:17:24,567 INFO L899 garLoopResultBuilder]: For program point L670(lines 670 682) no Hoare annotation was computed. [2022-07-13 18:17:24,567 INFO L899 garLoopResultBuilder]: For program point L505(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,567 INFO L899 garLoopResultBuilder]: For program point L439-1(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,567 INFO L899 garLoopResultBuilder]: For program point L340(lines 340 347) no Hoare annotation was computed. [2022-07-13 18:17:24,570 INFO L899 garLoopResultBuilder]: For program point L274(lines 274 278) no Hoare annotation was computed. [2022-07-13 18:17:24,572 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 212) no Hoare annotation was computed. [2022-07-13 18:17:24,572 INFO L899 garLoopResultBuilder]: For program point L506(lines 506 510) no Hoare annotation was computed. [2022-07-13 18:17:24,573 INFO L895 garLoopResultBuilder]: At program point L242-1(lines 230 257) the Hoare annotation is: (let ((.cse37 (+ ~t_b~0 2))) (let ((.cse34 (= ~c2_st~0 0)) (.cse33 (= 0 ~wl_pc~0)) (.cse39 (+ ~t_b~0 1)) (.cse38 (= .cse37 ~c_t~0)) (.cse21 (= ~c1_st~0 0))) (let ((.cse35 (= ~c2_pc~0 0)) (.cse23 (not .cse21)) (.cse3 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_c~0 0))) (.cse14 (= ~c1_pc~0 1)) (.cse16 (not (= ~r_st~0 0))) (.cse18 (or (= ~c_t~0 .cse39) .cse38)) (.cse20 (= ~data~0 .cse39)) (.cse0 (not (= 0 ~wl_st~0))) (.cse27 (not (= 2 ~wl_pc~0))) (.cse28 (not .cse33)) (.cse1 (not (= ~e_g~0 0))) (.cse24 (= ~d~0 0)) (.cse2 (not .cse34)) (.cse36 (= ~c1_pc~0 0)) (.cse4 (not (= ~e_g~0 1))) (.cse25 (= ~t_b~0 0)) (.cse5 (not (= ~e_e~0 0))) (.cse26 (= ~data~0 0)) (.cse7 (not (= ~r_i~0 1))) (.cse8 (not (= ~e_e~0 1))) (.cse29 (= ~wb_pc~0 0)) (.cse9 (not (= ~e_wl~0 1))) (.cse10 (= ~c1_i~0 1)) (.cse11 (= ~e_c~0 2)) (.cse12 (= ~c2_i~0 1)) (.cse13 (= ~e_f~0 2)) (.cse15 (not (= ~wb_st~0 0))) (.cse17 (= ~c2_pc~0 1)) (.cse30 (= ~processed~0 0)) (.cse19 (not (= ~e_wl~0 0))) (.cse31 (= ~c_req_up~0 ~r_i~0)) (.cse22 (= ~wb_i~0 1)) (.cse32 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse23 .cse24 .cse2 .cse4 .cse25 .cse5 .cse26 .cse27 .cse28 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse30 .cse31 .cse22 .cse32) (and .cse1 .cse23 .cse24 .cse2 .cse4 .cse25 .cse5 .cse26 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse30 .cse19 .cse33 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse19 .cse33 .cse22) (and .cse0 .cse1 .cse24 .cse34 .cse35 .cse36 .cse4 .cse25 .cse5 .cse26 .cse27 .cse28 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse30 .cse21 .cse31 .cse22 .cse32) (and .cse1 .cse23 .cse24 .cse34 .cse35 .cse4 .cse25 .cse5 .cse26 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse19 .cse33 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse23 .cse24 .cse34 .cse35 .cse4 .cse25 .cse5 .cse26 .cse27 .cse28 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse23 .cse2 .cse3 (= .cse37 ~data~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse38 .cse19 .cse22) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse17 .cse19 .cse22) (and .cse1 .cse24 .cse34 .cse35 .cse36 .cse4 .cse25 .cse5 .cse26 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse30 .cse19 .cse21 .cse33 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse23 .cse3 .cse34 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse24 .cse2 .cse36 .cse4 .cse25 .cse5 .cse26 .cse27 .cse28 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse30 .cse21 .cse31 .cse22 .cse32) (and .cse1 .cse24 .cse2 .cse36 .cse4 .cse25 .cse5 .cse26 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse30 .cse19 .cse21 .cse33 .cse31 .cse22 .cse32))))) [2022-07-13 18:17:24,573 INFO L895 garLoopResultBuilder]: At program point L176(lines 137 181) the Hoare annotation is: (let ((.cse27 (= 0 ~wl_pc~0)) (.cse37 (+ ~t_b~0 1)) (.cse34 (= ~wb_st~0 0)) (.cse30 (= ~c2_st~0 0)) (.cse38 (+ ~t_b~0 2))) (let ((.cse5 (= .cse38 ~data~0)) (.cse3 (not .cse30)) (.cse4 (= ~wb_pc~0 1)) (.cse8 (not (= ~e_c~0 0))) (.cse17 (not .cse34)) (.cse18 (not (= ~r_st~0 0))) (.cse19 (= ~c2_pc~0 1)) (.cse20 (or (= ~c_t~0 .cse37) (= .cse38 ~c_t~0))) (.cse21 (not (= ~e_wl~0 0))) (.cse36 (= ~data~0 .cse37)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (not (= ~c1_st~0 0))) (.cse23 (= ~d~0 0)) (.cse31 (= ~c2_pc~0 0)) (.cse6 (not (= ~e_g~0 1))) (.cse24 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse25 (= ~data~0 0)) (.cse32 (not (= 2 ~wl_pc~0))) (.cse33 (not .cse27)) (.cse9 (not (= ~r_i~0 1))) (.cse10 (not (= ~e_e~0 1))) (.cse35 (= ~wb_pc~0 0)) (.cse11 (not (= ~e_wl~0 1))) (.cse12 (= ~c1_i~0 1)) (.cse13 (= ~e_c~0 2)) (.cse14 (= ~c2_i~0 1)) (.cse15 (= ~e_f~0 2)) (.cse16 (= ~c1_pc~0 1)) (.cse26 (= ~processed~0 0)) (.cse28 (= ~c_req_up~0 ~r_i~0)) (.cse22 (= ~wb_i~0 1)) (.cse29 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse23 .cse3 .cse4 .cse6 .cse24 .cse7 .cse25 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse26 .cse21 .cse27 .cse28 .cse22 .cse29) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse30 .cse31 .cse6 .cse24 .cse7 .cse25 .cse32 .cse33 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26 .cse28 .cse22 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse26 .cse21 .cse34 .cse22) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse21 .cse27 .cse22) (and .cse1 .cse2 .cse23 .cse4 .cse30 .cse31 .cse6 .cse24 .cse7 .cse25 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26 .cse21 .cse27 .cse28 .cse22 .cse29) (and .cse0 .cse1 .cse2 .cse23 .cse3 .cse6 .cse24 .cse7 .cse25 .cse32 .cse33 .cse9 .cse10 .cse35 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse26 .cse34 .cse28 .cse22 .cse29) (and .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse6 .cse24 .cse7 .cse25 .cse32 .cse33 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse26 .cse28 .cse22 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse30 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse26 .cse21 .cse36 .cse34 .cse22) (and .cse1 .cse2 .cse23 .cse30 .cse31 .cse6 .cse24 .cse7 .cse25 .cse9 .cse10 .cse35 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse21 .cse27 .cse34 .cse28 .cse22 .cse29) (and .cse1 .cse2 .cse23 .cse3 .cse6 .cse24 .cse7 .cse25 .cse9 .cse10 .cse35 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse26 .cse21 .cse27 .cse34 .cse28 .cse22 .cse29) (and .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse32 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse19 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse28 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse36 .cse22) (and .cse0 .cse1 .cse2 .cse23 .cse30 .cse31 .cse6 .cse24 .cse7 .cse25 .cse32 .cse33 .cse9 .cse10 .cse35 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse34 .cse28 .cse22 .cse29)))) [2022-07-13 18:17:24,573 INFO L899 garLoopResultBuilder]: For program point L639-1(lines 545 685) no Hoare annotation was computed. [2022-07-13 18:17:24,573 INFO L899 garLoopResultBuilder]: For program point L408(lines 408 418) no Hoare annotation was computed. [2022-07-13 18:17:24,573 INFO L899 garLoopResultBuilder]: For program point L408-2(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,573 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 317) no Hoare annotation was computed. [2022-07-13 18:17:24,574 INFO L899 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2022-07-13 18:17:24,574 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 148) no Hoare annotation was computed. [2022-07-13 18:17:24,574 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 681) no Hoare annotation was computed. [2022-07-13 18:17:24,574 INFO L899 garLoopResultBuilder]: For program point L607(lines 545 685) no Hoare annotation was computed. [2022-07-13 18:17:24,574 INFO L899 garLoopResultBuilder]: For program point L574-1(lines 545 685) no Hoare annotation was computed. [2022-07-13 18:17:24,574 INFO L899 garLoopResultBuilder]: For program point L409(lines 409 414) no Hoare annotation was computed. [2022-07-13 18:17:24,574 INFO L899 garLoopResultBuilder]: For program point L409-2(lines 409 414) no Hoare annotation was computed. [2022-07-13 18:17:24,574 INFO L895 garLoopResultBuilder]: At program point L145(lines 140 180) the Hoare annotation is: (let ((.cse25 (+ ~t_b~0 1)) (.cse21 (= ~wb_st~0 0)) (.cse23 (= ~c2_st~0 0))) (let ((.cse18 (= ~processed~0 0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (not (= ~c1_st~0 0))) (.cse3 (not .cse23)) (.cse4 (= ~wb_pc~0 1)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (not (= ~e_e~0 0))) (.cse7 (not (= ~e_c~0 0))) (.cse8 (not (= ~r_i~0 1))) (.cse9 (not (= ~e_e~0 1))) (.cse10 (not (= ~e_wl~0 1))) (.cse11 (= ~c1_i~0 1)) (.cse12 (= ~e_c~0 2)) (.cse13 (= ~c2_i~0 1)) (.cse14 (= ~e_f~0 2)) (.cse15 (= ~c1_pc~0 1)) (.cse24 (not .cse21)) (.cse16 (not (= ~r_st~0 0))) (.cse17 (= ~c2_pc~0 1)) (.cse19 (not (= ~e_wl~0 0))) (.cse20 (= ~data~0 .cse25)) (.cse22 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~data~0 |ULTIMATE.start_write_loop_~t~0#1|) .cse10 .cse11 .cse12 .cse13 (= ~data~0 ~t_b~0) .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse0 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse19 (= 0 ~wl_pc~0) .cse22) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 (not (= 2 ~wl_pc~0)) .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse17 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 (or (= ~c_t~0 .cse25) (= (+ ~t_b~0 2) ~c_t~0)) .cse19 .cse20 .cse22)))) [2022-07-13 18:17:24,575 INFO L895 garLoopResultBuilder]: At program point L79(lines 65 135) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse20 (= ~c1_st~0 0))) (let ((.cse27 (not .cse20)) (.cse3 (not .cse25)) (.cse12 (= ~wb_pc~0 0)) (.cse29 (= ~c1_pc~0 1)) (.cse18 (= ~c2_pc~0 1)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~d~0 0)) (.cse28 (= ~wb_pc~0 1)) (.cse26 (= ~c2_pc~0 0)) (.cse4 (= ~c1_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse9 (not (= 2 ~wl_pc~0))) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse30 (not .cse21)) (.cse19 (= ~processed~0 0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1)) (.cse24 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24)))) [2022-07-13 18:17:24,575 INFO L899 garLoopResultBuilder]: For program point L608(lines 608 612) no Hoare annotation was computed. [2022-07-13 18:17:24,576 INFO L895 garLoopResultBuilder]: At program point L476(lines 469 486) the Hoare annotation is: (let ((.cse0 (= ~c2_st~0 0)) (.cse1 (not (= ~r_i~0 1))) (.cse2 (= ~e_g~0 ~e_f~0)) (.cse3 (= ~c1_i~0 1)) (.cse4 (= ~e_c~0 2)) (.cse5 (= ~c2_i~0 1)) (.cse6 (= ~e_wl~0 ~e_c~0)) (.cse7 (= ~e_f~0 2)) (.cse8 (= ~e_e~0 ~e_f~0)) (.cse9 (= ~c1_st~0 0)) (.cse10 (= 0 ~wl_pc~0)) (.cse11 (= ~wb_st~0 0)) (.cse12 (= ~c_req_up~0 ~r_i~0)) (.cse13 (= ~wb_i~0 1))) (or (and (not (= 0 ~wl_st~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (= ~d~0 0) .cse0 (= ~c2_pc~0 0) (= ~c1_pc~0 0) (= ~t_b~0 0) (= ~data~0 0) .cse1 (= ~wb_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~processed~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~r_st~0 ~e_f~0)))) [2022-07-13 18:17:24,576 INFO L899 garLoopResultBuilder]: For program point L477(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,576 INFO L899 garLoopResultBuilder]: For program point L444-1(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,576 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 316) no Hoare annotation was computed. [2022-07-13 18:17:24,576 INFO L899 garLoopResultBuilder]: For program point L312-1(lines 298 396) no Hoare annotation was computed. [2022-07-13 18:17:24,576 INFO L899 garLoopResultBuilder]: For program point L676(lines 676 680) no Hoare annotation was computed. [2022-07-13 18:17:24,576 INFO L899 garLoopResultBuilder]: For program point L676-1(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,576 INFO L899 garLoopResultBuilder]: For program point L478(lines 478 482) no Hoare annotation was computed. [2022-07-13 18:17:24,577 INFO L899 garLoopResultBuilder]: For program point L644-1(lines 545 685) no Hoare annotation was computed. [2022-07-13 18:17:24,578 INFO L899 garLoopResultBuilder]: For program point L546(line 546) no Hoare annotation was computed. [2022-07-13 18:17:24,578 INFO L899 garLoopResultBuilder]: For program point L579-1(lines 545 685) no Hoare annotation was computed. [2022-07-13 18:17:24,578 INFO L895 garLoopResultBuilder]: At program point L381(lines 298 396) the Hoare annotation is: (let ((.cse33 (= 0 ~wl_pc~0)) (.cse43 (= 2 ~wl_pc~0)) (.cse21 (= ~c1_st~0 0)) (.cse22 (= ~wb_st~0 0)) (.cse31 (= ~c2_st~0 0)) (.cse41 (+ ~t_b~0 1)) (.cse42 (+ ~t_b~0 2))) (let ((.cse34 (= .cse42 ~data~0)) (.cse36 (or (= .cse42 ~c~0) (= .cse41 ~c~0))) (.cse35 (not (= ~e_c~0 0))) (.cse37 (or (= ~c_t~0 .cse41) (= .cse42 ~c_t~0))) (.cse38 (= ~data~0 .cse41)) (.cse39 (not (= ~r_st~0 0))) (.cse3 (not .cse31)) (.cse27 (= ~wb_pc~0 1)) (.cse4 (= ~c1_pc~0 0)) (.cse29 (not .cse22)) (.cse19 (= ~c2_pc~0 1)) (.cse30 (not (= ~e_wl~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse26 (not .cse21)) (.cse2 (= ~d~0 0)) (.cse32 (= ~c2_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse9 (not .cse43)) (.cse10 (not .cse33)) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_e~0 1))) (.cse13 (= ~wb_pc~0 0)) (.cse14 (not (= ~e_wl~0 1))) (.cse15 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse17 (= ~c2_i~0 1)) (.cse18 (= ~e_f~0 2)) (.cse28 (= ~c1_pc~0 1)) (.cse20 (= ~processed~0 0)) (.cse23 (= ~c_req_up~0 ~r_i~0)) (.cse24 (= ~wb_i~0 1)) (.cse25 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse26 .cse2 .cse3 .cse27 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse19 .cse20 .cse30 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse27 .cse31 .cse32 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse20 .cse30 .cse21 .cse33 .cse23 .cse24 .cse25) (and .cse18 (or (and .cse0 .cse1 .cse26 .cse3 .cse27 .cse34 .cse5 .cse7 .cse35 .cse11 .cse36 .cse12 .cse14 .cse15 .cse16 .cse17 .cse28 .cse29 .cse19 .cse37 .cse30 .cse24) (and .cse0 .cse1 .cse26 .cse3 .cse27 .cse5 .cse7 .cse35 .cse11 .cse36 .cse12 .cse14 .cse15 .cse16 .cse17 .cse28 .cse29 .cse19 .cse37 .cse30 .cse38 .cse24))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse3 .cse27 .cse34 .cse5 .cse7 .cse35 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse39 .cse19 .cse37 .cse30 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse27 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse27 .cse5 .cse7 .cse35 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse39 .cse19 .cse20 .cse30 .cse38 .cse21 .cse22 .cse24) (and .cse0 .cse1 .cse26 .cse2 .cse27 .cse31 .cse32 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse20 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse3 .cse27 .cse34 .cse5 .cse7 .cse35 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse39 .cse19 .cse20 .cse30 .cse22 .cse24) (and (let ((.cse40 (or (= .cse41 ~d~0) (= .cse42 ~d~0)))) (or (and .cse1 .cse26 .cse40 .cse3 .cse27 .cse34 .cse5 .cse7 .cse35 .cse11 .cse36 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse39 .cse19 .cse37 .cse30 .cse24) (and .cse1 .cse26 .cse40 .cse3 .cse27 .cse5 .cse7 .cse35 .cse11 .cse36 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse39 .cse19 .cse37 .cse30 .cse38 .cse24))) .cse43) (and .cse0 .cse1 .cse5 .cse7 .cse35 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse30 .cse33 .cse24) (and .cse1 .cse26 .cse2 .cse27 .cse31 .cse32 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse20 .cse30 .cse33 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse31 .cse32 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse2 .cse3 .cse27 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse19 .cse20 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse27 .cse31 .cse5 .cse7 .cse35 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse39 .cse19 .cse20 .cse30 .cse38 .cse22 .cse24) (and .cse1 .cse26 .cse2 .cse31 .cse32 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse20 .cse30 .cse33 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse31 .cse32 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse26 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse30 .cse33 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse27 .cse5 .cse7 .cse35 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse39 .cse19 .cse37 .cse30 .cse38 .cse24) (and .cse0 .cse1 .cse27 .cse5 .cse7 .cse35 .cse9 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse28 .cse19 .cse30 .cse24) (and .cse0 .cse1 .cse2 .cse27 .cse31 .cse32 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse20 .cse21 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse27 .cse31 .cse5 .cse7 .cse35 .cse11 .cse12 (= ~data~0 |ULTIMATE.start_write_loop_~t~0#1|) .cse14 .cse15 .cse16 .cse17 (= ~data~0 ~t_b~0) .cse18 .cse28 .cse29 .cse39 .cse19 .cse20 .cse30 .cse21 .cse24) (and .cse0 .cse1 .cse26 .cse27 .cse5 .cse7 .cse35 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse39 .cse19 .cse37 .cse30 .cse38 .cse24) (and .cse0 .cse1 .cse26 .cse3 .cse27 .cse5 .cse7 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse39 .cse19 .cse30 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse27 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20 .cse30 .cse21 .cse33 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse2 .cse31 .cse32 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse20 .cse22 .cse23 .cse24 .cse25)))) [2022-07-13 18:17:24,578 INFO L899 garLoopResultBuilder]: For program point L514-1(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,578 INFO L899 garLoopResultBuilder]: For program point L449-1(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,578 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 18:17:24,579 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 129) no Hoare annotation was computed. [2022-07-13 18:17:24,579 INFO L899 garLoopResultBuilder]: For program point L351(lines 298 396) no Hoare annotation was computed. [2022-07-13 18:17:24,579 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 194) no Hoare annotation was computed. [2022-07-13 18:17:24,579 INFO L899 garLoopResultBuilder]: For program point L153(line 153) no Hoare annotation was computed. [2022-07-13 18:17:24,579 INFO L899 garLoopResultBuilder]: For program point L616(lines 545 685) no Hoare annotation was computed. [2022-07-13 18:17:24,579 INFO L899 garLoopResultBuilder]: For program point L649-1(lines 545 685) no Hoare annotation was computed. [2022-07-13 18:17:24,579 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 392) no Hoare annotation was computed. [2022-07-13 18:17:24,579 INFO L895 garLoopResultBuilder]: At program point L286(lines 259 288) the Hoare annotation is: (let ((.cse26 (+ ~t_b~0 1)) (.cse25 (+ ~t_b~0 2))) (let ((.cse5 (= .cse25 ~data~0)) (.cse1 (not (= ~c1_st~0 0))) (.cse3 (not (= ~c2_st~0 0))) (.cse14 (= ~e_c~0 2)) (.cse18 (not (= ~wb_st~0 0))) (.cse20 (or (= ~c_t~0 .cse26) (= .cse25 ~c_t~0))) (.cse24 (= ~data~0 .cse26)) (.cse28 (not (= 0 ~wl_st~0))) (.cse0 (not (= ~e_g~0 0))) (.cse4 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_g~0 1))) (.cse7 (not (= ~e_e~0 0))) (.cse8 (not (= ~e_c~0 0))) (.cse27 (= 2 ~wl_pc~0)) (.cse9 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (not (= ~e_wl~0 1))) (.cse13 (= ~c1_i~0 1)) (.cse15 (= ~c2_i~0 1)) (.cse16 (= ~e_f~0 2)) (.cse17 (= ~c1_pc~0 1)) (.cse19 (= ~c2_pc~0 1)) (.cse21 (not (= ~e_wl~0 0))) (.cse22 (= ~wb_i~0 1)) (.cse23 (= ~r_st~0 ~e_f~0))) (or (and (let ((.cse2 (or (= .cse26 ~d~0) (= .cse25 ~d~0))) (.cse10 (or (= .cse25 ~c~0) (= .cse26 ~c~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse22 .cse23))) .cse27) (and .cse28 .cse0 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse21 (= 0 ~wl_pc~0) .cse22) (and .cse28 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse28 .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse22 .cse23) (and .cse28 .cse0 .cse4 .cse6 .cse7 .cse8 (not .cse27) .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse23)))) [2022-07-13 18:17:24,580 INFO L895 garLoopResultBuilder]: At program point L253(lines 227 258) the Hoare annotation is: (let ((.cse36 (+ ~t_b~0 2))) (let ((.cse38 (+ ~t_b~0 1)) (.cse37 (= .cse36 ~c_t~0)) (.cse20 (= ~c1_st~0 0)) (.cse3 (= ~c2_st~0 0)) (.cse21 (= 0 ~wl_pc~0))) (let ((.cse4 (= ~c2_pc~0 0)) (.cse27 (not (= 2 ~wl_pc~0))) (.cse28 (not .cse21)) (.cse1 (= ~d~0 0)) (.cse26 (not .cse3)) (.cse5 (= ~c1_pc~0 0)) (.cse7 (= ~t_b~0 0)) (.cse9 (= ~data~0 0)) (.cse18 (= ~processed~0 0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse24 (= ~r_st~0 ~e_f~0)) (.cse25 (not (= 0 ~wl_st~0))) (.cse0 (not (= ~e_g~0 0))) (.cse30 (not .cse20)) (.cse2 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_g~0 1))) (.cse8 (not (= ~e_e~0 0))) (.cse32 (not (= ~e_c~0 0))) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (not (= ~e_wl~0 1))) (.cse13 (= ~c1_i~0 1)) (.cse14 (= ~e_c~0 2)) (.cse15 (= ~c2_i~0 1)) (.cse16 (= ~e_f~0 2)) (.cse31 (= ~c1_pc~0 1)) (.cse17 (not (= ~wb_st~0 0))) (.cse33 (not (= ~r_st~0 0))) (.cse29 (= ~c2_pc~0 1)) (.cse34 (or (= ~c_t~0 .cse38) .cse37)) (.cse19 (not (= ~e_wl~0 0))) (.cse35 (= ~data~0 .cse38)) (.cse23 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse1 .cse26 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse30 .cse1 .cse26 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse26 .cse2 .cse6 .cse8 .cse32 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse33 .cse29 .cse34 .cse19 .cse35 .cse20 .cse23) (and .cse25 .cse0 .cse30 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse27 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse6 .cse8 .cse32 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse19 .cse21 .cse23) (and .cse0 .cse30 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse30 .cse1 .cse26 .cse2 .cse6 .cse7 .cse8 .cse9 .cse27 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse29 .cse18 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse30 .cse26 .cse2 (= .cse36 ~data~0) .cse6 .cse8 .cse32 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse33 .cse29 .cse37 .cse19 .cse23) (and .cse25 .cse0 .cse2 .cse6 .cse8 .cse32 .cse27 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse31 .cse29 .cse19 .cse23) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse26 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse30 .cse2 .cse3 .cse6 .cse8 .cse32 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse33 .cse29 .cse34 .cse19 .cse35 .cse23))))) [2022-07-13 18:17:24,580 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2022-07-13 18:17:24,580 INFO L899 garLoopResultBuilder]: For program point L617(lines 617 621) no Hoare annotation was computed. [2022-07-13 18:17:24,580 INFO L899 garLoopResultBuilder]: For program point L584-1(lines 545 685) no Hoare annotation was computed. [2022-07-13 18:17:24,580 INFO L899 garLoopResultBuilder]: For program point L419-1(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,580 INFO L895 garLoopResultBuilder]: At program point L221(lines 182 226) the Hoare annotation is: (let ((.cse37 (+ ~t_b~0 1)) (.cse22 (= ~wb_st~0 0)) (.cse21 (= ~c1_st~0 0)) (.cse27 (= 0 ~wl_pc~0)) (.cse38 (+ ~t_b~0 2))) (let ((.cse30 (= .cse38 ~data~0)) (.cse10 (not .cse27)) (.cse13 (= ~wb_pc~0 0)) (.cse9 (not (= 2 ~wl_pc~0))) (.cse2 (= ~d~0 0)) (.cse4 (= ~c1_pc~0 0)) (.cse6 (= ~t_b~0 0)) (.cse8 (= ~data~0 0)) (.cse20 (= ~processed~0 0)) (.cse23 (= ~c_req_up~0 ~r_i~0)) (.cse25 (= ~r_st~0 ~e_f~0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse28 (not .cse21)) (.cse3 (not (= ~c2_st~0 0))) (.cse29 (= ~wb_pc~0 1)) (.cse5 (not (= ~e_g~0 1))) (.cse7 (not (= ~e_e~0 0))) (.cse31 (not (= ~e_c~0 0))) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_e~0 1))) (.cse14 (not (= ~e_wl~0 1))) (.cse15 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse17 (= ~c2_i~0 1)) (.cse18 (= ~e_f~0 2)) (.cse32 (= ~c1_pc~0 1)) (.cse33 (not .cse22)) (.cse34 (not (= ~r_st~0 0))) (.cse19 (= ~c2_pc~0 1)) (.cse35 (or (= ~c_t~0 .cse37) (= .cse38 ~c_t~0))) (.cse26 (not (= ~e_wl~0 0))) (.cse36 (= ~data~0 .cse37)) (.cse24 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse27 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse28 .cse3 .cse29 .cse30 .cse5 .cse7 .cse31 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse33 .cse34 .cse19 .cse35 .cse26 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse33 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25) (and .cse1 .cse28 .cse2 .cse3 .cse29 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse33 .cse19 .cse20 .cse26 .cse27 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse29 .cse5 .cse7 .cse31 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse34 .cse19 .cse20 .cse26 .cse36 .cse21 .cse22 .cse24) (and .cse0 .cse1 .cse28 .cse3 .cse29 .cse30 .cse5 .cse7 .cse31 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse34 .cse19 .cse20 .cse26 .cse22 .cse24) (and .cse0 .cse1 .cse5 .cse7 .cse31 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse26 .cse27 .cse24) (and .cse0 .cse1 .cse28 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse28 .cse2 .cse3 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse33 .cse19 .cse20 .cse23 .cse24 .cse25) (and .cse1 .cse28 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse19 .cse20 .cse26 .cse27 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse29 .cse5 .cse7 .cse31 .cse9 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse32 .cse19 .cse26 .cse24) (and .cse0 .cse1 .cse28 .cse3 .cse29 .cse5 .cse7 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse33 .cse34 .cse19 .cse26 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse33 .cse19 .cse20 .cse26 .cse21 .cse27 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse28 .cse3 .cse29 .cse5 .cse7 .cse31 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse33 .cse34 .cse19 .cse35 .cse26 .cse36 .cse24)))) [2022-07-13 18:17:24,580 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 128) no Hoare annotation was computed. [2022-07-13 18:17:24,581 INFO L895 garLoopResultBuilder]: At program point L122-2(lines 65 135) the Hoare annotation is: (let ((.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~wb_pc~0 1)) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 0))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_e~0 1))) (.cse7 (not (= ~e_wl~0 1))) (.cse8 (= ~c1_i~0 1)) (.cse9 (= ~e_c~0 2)) (.cse10 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse11 (= ~c1_pc~0 1)) (.cse12 (not (= ~wb_st~0 0))) (.cse14 (= ~c2_pc~0 1)) (.cse15 (not (= ~e_wl~0 0))) (.cse16 (= ~wb_i~0 1))) (or (and (let ((.cse13 (not (= ~r_st~0 0)))) (or (and .cse0 .cse1 .cse2 (= (+ ~t_b~0 2) ~data~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~data~0 ~t_b~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~data~0 (+ ~t_b~0 1)) .cse16))) .cse17 (= 2 ~wl_pc~0)) (and .cse0 .cse1 (not (= ~c1_st~0 0)) (= ~d~0 0) (not (= ~c2_st~0 0)) .cse2 .cse3 (= ~t_b~0 0) .cse4 (= ~data~0 0) (not (= 0 ~wl_pc~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse12 .cse14 (= ~processed~0 0) .cse15 (= ~c_req_up~0 ~r_i~0) .cse16 (= ~r_st~0 ~e_f~0)))) [2022-07-13 18:17:24,581 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-07-13 18:17:24,581 INFO L895 garLoopResultBuilder]: At program point L717(lines 692 719) the Hoare annotation is: (= ~c2_i~0 1) [2022-07-13 18:17:24,581 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 562) no Hoare annotation was computed. [2022-07-13 18:17:24,581 INFO L899 garLoopResultBuilder]: For program point L519-1(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,581 INFO L899 garLoopResultBuilder]: For program point L552-2(lines 552 562) no Hoare annotation was computed. [2022-07-13 18:17:24,581 INFO L899 garLoopResultBuilder]: For program point L321(lines 298 396) no Hoare annotation was computed. [2022-07-13 18:17:24,582 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 193) no Hoare annotation was computed. [2022-07-13 18:17:24,582 INFO L895 garLoopResultBuilder]: At program point L24(lines 19 26) the Hoare annotation is: false [2022-07-13 18:17:24,582 INFO L899 garLoopResultBuilder]: For program point L553(lines 553 558) no Hoare annotation was computed. [2022-07-13 18:17:24,582 INFO L899 garLoopResultBuilder]: For program point L487(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,582 INFO L899 garLoopResultBuilder]: For program point L553-2(lines 553 558) no Hoare annotation was computed. [2022-07-13 18:17:24,582 INFO L899 garLoopResultBuilder]: For program point L454-1(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,582 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 362) no Hoare annotation was computed. [2022-07-13 18:17:24,582 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 18:17:24,582 INFO L895 garLoopResultBuilder]: At program point L190(lines 185 225) the Hoare annotation is: (let ((.cse25 (+ ~t_b~0 1)) (.cse21 (= ~wb_st~0 0)) (.cse24 (= ~c1_st~0 0))) (let ((.cse18 (= ~processed~0 0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (not .cse24)) (.cse3 (not (= ~c2_st~0 0))) (.cse4 (= ~wb_pc~0 1)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (not (= ~e_e~0 0))) (.cse7 (not (= ~e_c~0 0))) (.cse8 (not (= ~r_i~0 1))) (.cse9 (not (= ~e_e~0 1))) (.cse10 (not (= ~e_wl~0 1))) (.cse11 (= ~c1_i~0 1)) (.cse12 (= ~e_c~0 2)) (.cse13 (= ~c2_i~0 1)) (.cse14 (= ~e_f~0 2)) (.cse15 (= ~c1_pc~0 1)) (.cse23 (not .cse21)) (.cse16 (not (= ~r_st~0 0))) (.cse17 (= ~c2_pc~0 1)) (.cse19 (not (= ~e_wl~0 0))) (.cse20 (= ~data~0 .cse25)) (.cse22 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse19 (= 0 ~wl_pc~0) .cse22) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~data~0 |ULTIMATE.start_write_loop_~t~0#1|) .cse10 .cse11 .cse12 .cse13 (= ~data~0 ~t_b~0) .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19 .cse24 .cse22) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 (not (= 2 ~wl_pc~0)) .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse17 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 (or (= ~c_t~0 .cse25) (= (+ ~t_b~0 2) ~c_t~0)) .cse19 .cse20 .cse22)))) [2022-07-13 18:17:24,583 INFO L895 garLoopResultBuilder]: At program point L686(lines 403 691) the Hoare annotation is: (= ~c2_i~0 1) [2022-07-13 18:17:24,583 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2022-07-13 18:17:24,583 INFO L899 garLoopResultBuilder]: For program point L654-1(lines 545 685) no Hoare annotation was computed. [2022-07-13 18:17:24,583 INFO L895 garLoopResultBuilder]: At program point L159-1(lines 140 180) the Hoare annotation is: (let ((.cse37 (+ ~t_b~0 1)) (.cse30 (= ~wb_st~0 0)) (.cse5 (= ~c2_st~0 0)) (.cse38 (+ ~t_b~0 2)) (.cse28 (= 0 ~wl_pc~0))) (let ((.cse12 (not .cse28)) (.cse31 (= .cse38 ~data~0)) (.cse11 (not (= 2 ~wl_pc~0))) (.cse3 (= ~d~0 0)) (.cse6 (= ~c2_pc~0 0)) (.cse8 (= ~t_b~0 0)) (.cse10 (= ~data~0 0)) (.cse29 (= ~wb_pc~0 0)) (.cse21 (= ~processed~0 0)) (.cse24 (= ~r_st~0 ~e_f~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (not (= ~c1_st~0 0))) (.cse25 (not .cse5)) (.cse4 (= ~wb_pc~0 1)) (.cse7 (not (= ~e_g~0 1))) (.cse9 (not (= ~e_e~0 0))) (.cse32 (not (= ~e_c~0 0))) (.cse13 (not (= ~r_i~0 1))) (.cse14 (not (= ~e_e~0 1))) (.cse15 (not (= ~e_wl~0 1))) (.cse16 (= ~c1_i~0 1)) (.cse17 (= ~e_c~0 2)) (.cse18 (= ~c2_i~0 1)) (.cse19 (= ~e_f~0 2)) (.cse33 (= ~c1_pc~0 1)) (.cse20 (not .cse30)) (.cse34 (not (= ~r_st~0 0))) (.cse26 (= ~c2_pc~0 1)) (.cse35 (or (= ~c_t~0 .cse37) (= .cse38 ~c_t~0))) (.cse27 (not (= ~e_wl~0 0))) (.cse36 (= ~data~0 .cse37)) (.cse23 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse25 .cse4 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse27 .cse28 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse30 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse19 .cse26 .cse21 .cse30 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse4 .cse31 .cse7 .cse9 .cse32 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse33 .cse20 .cse34 .cse26 .cse35 .cse27 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse4 .cse31 .cse7 .cse9 .cse32 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse33 .cse34 .cse26 .cse21 .cse27 .cse30 .cse23) (and .cse0 .cse1 .cse7 .cse9 .cse32 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse27 .cse28 .cse23) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse27 .cse28 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse25 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse19 .cse26 .cse21 .cse27 .cse28 .cse30 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse9 .cse32 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse33 .cse34 .cse26 .cse21 .cse27 .cse36 .cse30 .cse23) (and .cse0 .cse1 .cse4 .cse7 .cse9 .cse32 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse33 .cse26 .cse27 .cse23) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse27 .cse28 .cse30 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse4 .cse7 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse33 .cse20 .cse34 .cse26 .cse27 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse25 .cse4 .cse7 .cse9 .cse32 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse33 .cse20 .cse34 .cse26 .cse35 .cse27 .cse36 .cse23)))) [2022-07-13 18:17:24,583 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2022-07-13 18:17:24,583 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 87 130) no Hoare annotation was computed. [2022-07-13 18:17:24,583 INFO L899 garLoopResultBuilder]: For program point L424-1(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,584 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 332) no Hoare annotation was computed. [2022-07-13 18:17:24,584 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2022-07-13 18:17:24,598 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 18:17:24,599 INFO L899 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2022-07-13 18:17:24,599 INFO L899 garLoopResultBuilder]: For program point L524-1(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,599 INFO L899 garLoopResultBuilder]: For program point L459-1(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,599 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 170) no Hoare annotation was computed. [2022-07-13 18:17:24,599 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 162 170) no Hoare annotation was computed. [2022-07-13 18:17:24,599 INFO L899 garLoopResultBuilder]: For program point L625(lines 545 685) no Hoare annotation was computed. [2022-07-13 18:17:24,599 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2022-07-13 18:17:24,599 INFO L899 garLoopResultBuilder]: For program point L626(lines 626 630) no Hoare annotation was computed. [2022-07-13 18:17:24,599 INFO L899 garLoopResultBuilder]: For program point L659-1(lines 545 685) no Hoare annotation was computed. [2022-07-13 18:17:24,600 INFO L895 garLoopResultBuilder]: At program point L131(lines 62 136) the Hoare annotation is: (let ((.cse34 (= 2 ~wl_pc~0)) (.cse21 (= ~c1_st~0 0)) (.cse22 (= ~wb_st~0 0)) (.cse29 (= ~c2_st~0 0))) (let ((.cse4 (= ~c1_pc~0 0)) (.cse3 (not .cse29)) (.cse26 (= ~wb_pc~0 1)) (.cse27 (not .cse22)) (.cse32 (not (= ~r_st~0 0))) (.cse19 (= ~c2_pc~0 1)) (.cse33 (not (= ~e_wl~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse28 (not .cse21)) (.cse2 (= ~d~0 0)) (.cse30 (= ~c2_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse9 (not .cse34)) (.cse10 (not (= 0 ~wl_pc~0))) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_e~0 1))) (.cse13 (= ~wb_pc~0 0)) (.cse14 (not (= ~e_wl~0 1))) (.cse15 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse17 (= ~c2_i~0 1)) (.cse18 (= ~e_f~0 2)) (.cse31 (= ~c1_pc~0 1)) (.cse20 (= ~processed~0 0)) (.cse23 (= ~c_req_up~0 ~r_i~0)) (.cse24 (= ~wb_i~0 1)) (.cse25 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse27 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse28 .cse2 .cse26 .cse29 .cse30 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse27 .cse20 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse28 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse28 .cse2 .cse3 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse27 .cse19 .cse20 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse29 .cse30 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse26 .cse29 .cse30 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse27 .cse20 .cse21 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse29 .cse5 .cse7 .cse11 .cse12 (= ~data~0 |ULTIMATE.start_write_loop_~t~0#1|) .cse14 .cse15 .cse16 .cse17 (= ~data~0 ~t_b~0) .cse18 .cse31 .cse27 .cse32 .cse19 .cse20 .cse33 .cse21 .cse34 .cse24) (and .cse0 .cse1 .cse28 .cse3 .cse26 .cse5 .cse7 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse27 .cse32 .cse19 .cse33 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse2 .cse29 .cse30 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse20 .cse22 .cse23 .cse24 .cse25)))) [2022-07-13 18:17:24,600 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 18:17:24,600 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 23) no Hoare annotation was computed. [2022-07-13 18:17:24,600 INFO L899 garLoopResultBuilder]: For program point L429-1(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,600 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 239) no Hoare annotation was computed. [2022-07-13 18:17:24,600 INFO L899 garLoopResultBuilder]: For program point L198(line 198) no Hoare annotation was computed. [2022-07-13 18:17:24,600 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 78) no Hoare annotation was computed. [2022-07-13 18:17:24,601 INFO L899 garLoopResultBuilder]: For program point L496(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,601 INFO L899 garLoopResultBuilder]: For program point L529-1(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,601 INFO L895 garLoopResultBuilder]: At program point L397(lines 289 402) the Hoare annotation is: (let ((.cse26 (+ ~t_b~0 1)) (.cse5 (+ ~t_b~0 2))) (let ((.cse23 (not (= 2 ~wl_pc~0))) (.cse24 (= 0 ~wl_pc~0)) (.cse25 (= ~c_req_up~0 ~r_i~0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (not (= ~c1_st~0 0))) (.cse3 (not (= ~c2_st~0 0))) (.cse4 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_g~0 1))) (.cse7 (not (= ~e_e~0 0))) (.cse8 (not (= ~e_c~0 0))) (.cse9 (not (= ~r_i~0 1))) (.cse10 (not (= ~e_e~0 1))) (.cse11 (not (= ~e_wl~0 1))) (.cse12 (= ~c1_i~0 1)) (.cse13 (= ~e_c~0 2)) (.cse14 (= ~c2_i~0 1)) (.cse15 (= ~e_f~0 2)) (.cse16 (= ~c1_pc~0 1)) (.cse17 (not (= ~wb_st~0 0))) (.cse18 (not (= ~r_st~0 0))) (.cse19 (= ~c2_pc~0 1)) (.cse20 (or (= ~c_t~0 .cse26) (= .cse5 ~c_t~0))) (.cse21 (not (= ~e_wl~0 0))) (.cse22 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= .cse5 ~data~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse23 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse21 .cse22) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse21 .cse24 .cse22) (and .cse0 .cse1 .cse2 (= ~d~0 0) .cse3 .cse4 .cse6 (= ~t_b~0 0) .cse7 (= ~data~0 0) .cse23 (not .cse24) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 (= ~processed~0 0) .cse25 .cse22 (= ~r_st~0 ~e_f~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse25 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (= ~data~0 .cse26) .cse22)))) [2022-07-13 18:17:24,601 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 282) no Hoare annotation was computed. [2022-07-13 18:17:24,601 INFO L895 garLoopResultBuilder]: At program point L596(lines 589 606) the Hoare annotation is: (let ((.cse18 (+ ~t_b~0 2)) (.cse23 (+ ~t_b~0 1))) (let ((.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse16 (not (= ~c1_st~0 0))) (.cse17 (not (= ~c2_st~0 0))) (.cse2 (= ~wb_pc~0 1)) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 0))) (.cse5 (not (= ~e_c~0 0))) (.cse6 (not (= ~r_i~0 1))) (.cse19 (or (= .cse18 ~c~0) (= .cse23 ~c~0))) (.cse7 (not (= ~e_e~0 1))) (.cse20 (not (= ~e_wl~0 1))) (.cse8 (= ~c1_i~0 1)) (.cse9 (= ~c2_i~0 1)) (.cse10 (= ~e_f~0 2)) (.cse11 (= ~c1_pc~0 1)) (.cse21 (not (= ~wb_st~0 0))) (.cse12 (not (= ~r_st~0 0))) (.cse13 (= ~c2_pc~0 1)) (.cse22 (or (= ~c_t~0 .cse23) (= .cse18 ~c_t~0))) (.cse14 (not (= ~e_wl~0 0))) (.cse15 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 2 ~wl_pc~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse16 .cse17 .cse2 (= .cse18 ~data~0) .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13 .cse22 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse14 (= 0 ~wl_pc~0) .cse15) (and .cse0 .cse1 .cse16 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 (= ~e_c~0 2) .cse9 .cse10 .cse11 .cse21 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse16 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13 .cse22 .cse14 (= ~data~0 .cse23) .cse15)))) [2022-07-13 18:17:24,601 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2022-07-13 18:17:24,601 INFO L899 garLoopResultBuilder]: For program point L464-1(lines 406 690) no Hoare annotation was computed. [2022-07-13 18:17:24,601 INFO L899 garLoopResultBuilder]: For program point L299(lines 298 396) no Hoare annotation was computed. [2022-07-13 18:17:24,602 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 270) no Hoare annotation was computed. [2022-07-13 18:17:24,604 INFO L356 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:17:24,610 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 18:17:24,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:17:24 BoogieIcfgContainer [2022-07-13 18:17:24,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 18:17:24,764 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 18:17:24,764 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 18:17:24,765 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 18:17:24,765 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:16:20" (3/4) ... [2022-07-13 18:17:24,781 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 18:17:24,797 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-13 18:17:24,797 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 18:17:24,798 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 18:17:24,798 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 18:17:24,919 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 18:17:24,935 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 18:17:24,938 INFO L158 Benchmark]: Toolchain (without parser) took 65031.06ms. Allocated memory was 111.1MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 83.6MB in the beginning and 666.1MB in the end (delta: -582.5MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-07-13 18:17:24,938 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 111.1MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:17:24,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.54ms. Allocated memory was 111.1MB in the beginning and 197.1MB in the end (delta: 86.0MB). Free memory was 83.3MB in the beginning and 167.5MB in the end (delta: -84.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 18:17:24,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.37ms. Allocated memory is still 197.1MB. Free memory was 167.5MB in the beginning and 164.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 18:17:24,952 INFO L158 Benchmark]: Boogie Preprocessor took 39.67ms. Allocated memory is still 197.1MB. Free memory was 164.4MB in the beginning and 162.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:17:24,953 INFO L158 Benchmark]: RCFGBuilder took 440.81ms. Allocated memory is still 197.1MB. Free memory was 162.9MB in the beginning and 142.9MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-13 18:17:24,954 INFO L158 Benchmark]: TraceAbstraction took 63816.65ms. Allocated memory was 197.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 142.3MB in the beginning and 673.4MB in the end (delta: -531.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-07-13 18:17:24,954 INFO L158 Benchmark]: Witness Printer took 170.93ms. Allocated memory is still 1.7GB. Free memory was 673.4MB in the beginning and 666.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 18:17:24,956 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.15ms. Allocated memory is still 111.1MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.54ms. Allocated memory was 111.1MB in the beginning and 197.1MB in the end (delta: 86.0MB). Free memory was 83.3MB in the beginning and 167.5MB in the end (delta: -84.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.37ms. Allocated memory is still 197.1MB. Free memory was 167.5MB in the beginning and 164.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.67ms. Allocated memory is still 197.1MB. Free memory was 164.4MB in the beginning and 162.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 440.81ms. Allocated memory is still 197.1MB. Free memory was 162.9MB in the beginning and 142.9MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 63816.65ms. Allocated memory was 197.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 142.3MB in the beginning and 673.4MB in the end (delta: -531.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 170.93ms. Allocated memory is still 1.7GB. Free memory was 673.4MB in the beginning and 666.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * 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: 23]: 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, 132 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.6s, OverallIterations: 36, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 51.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11719 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11719 mSDsluCounter, 22319 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14501 mSDsCounter, 323 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1694 IncrementalHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 323 mSolverCounterUnsat, 7818 mSDtfsCounter, 1694 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 649 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5718occurred in iteration=21, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 9012 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 599 NumberOfFragments, 14758 HoareAnnotationTreeSize, 22 FomulaSimplifications, 520 FormulaSimplificationTreeSizeReduction, 35.7s HoareSimplificationTime, 22 FomulaSimplificationsInter, 7092547 FormulaSimplificationTreeSizeReductionInter, 15.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 3833 NumberOfCodeBlocks, 3833 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3989 ConstructedInterpolants, 0 QuantifiedInterpolants, 8559 SizeOfPredicates, 6 NumberOfNonLiveVariables, 531 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 38 InterpolantComputations, 35 PerfectInterpolantSequences, 2142/2272 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: 182]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_i == 1)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) - InvariantResult [Line: 692]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) && e_f == 2) && 2 == wl_pc) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && wb_st == 0) && wb_i == 1) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && data == t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: ((((((((((((((!(0 == wl_st) && c2_st == 0) && !(r_i == 1)) && e_g == e_f) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_wl == e_c) && e_f == 2) && e_e == e_f) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) || (((((((((((((((((((((d == 0 && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && t_b == 0) && data == 0) && !(r_i == 1)) && wb_pc == 0) && e_g == e_f) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_wl == e_c) && e_f == 2) && processed == 0) && e_e == e_f) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && data == t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 2 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && (t_b + 1 == d || t_b + 2 == d)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && (t_b + 1 == d || t_b + 2 == d)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || ((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_i == 1) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && wb_st == 0) && wb_i == 1) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && data == t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) - InvariantResult [Line: 589]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_i == 1) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && (t_b + 1 == d || t_b + 2 == d)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && (t_b + 1 == d || t_b + 2 == d)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) && 2 == wl_pc - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && (t_b + 1 == d || t_b + 2 == d)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && (t_b + 1 == d || t_b + 2 == d)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) && r_st == e_f)) && 2 == wl_pc) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (e_f == 2 && ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)))) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && (t_b + 1 == d || t_b + 2 == d)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && (t_b + 1 == d || t_b + 2 == d)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) && 2 == wl_pc)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && data == t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) RESULT: Ultimate proved your program to be correct! [2022-07-13 18:17:25,065 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE