./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/openssl-simplified/s3_srvr_4.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 f559dc59bc463f9a27da280f1f7098996cb99e14cb280bd541f8697a124cb729 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 11:09:51,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:09:51,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:09:51,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:09:51,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:09:51,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:09:51,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:09:51,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:09:51,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:09:51,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:09:51,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:09:51,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:09:51,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:09:51,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:09:51,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:09:51,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:09:51,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:09:51,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:09:51,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:09:51,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:09:51,279 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:09:51,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:09:51,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:09:51,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:09:51,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:09:51,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:09:51,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:09:51,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:09:51,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:09:51,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:09:51,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:09:51,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:09:51,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:09:51,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:09:51,288 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:09:51,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:09:51,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:09:51,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:09:51,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:09:51,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:09:51,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:09:51,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:09:51,306 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 11:09:51,319 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:09:51,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:09:51,320 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:09:51,320 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:09:51,321 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:09:51,321 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:09:51,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:09:51,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:09:51,321 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:09:51,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:09:51,322 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:09:51,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:09:51,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:09:51,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:09:51,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:09:51,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:09:51,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:09:51,323 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:09:51,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:09:51,323 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:09:51,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:09:51,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:09:51,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:09:51,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:09:51,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:09:51,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:09:51,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:09:51,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:09:51,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:09:51,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 11:09:51,324 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:09:51,325 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:09:51,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:09:51,325 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 -> f559dc59bc463f9a27da280f1f7098996cb99e14cb280bd541f8697a124cb729 [2022-07-22 11:09:51,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:09:51,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:09:51,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:09:51,522 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:09:51,522 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:09:51,523 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2022-07-22 11:09:51,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d2f2438/5c3ce64e90264547a3c1cf520275fc5f/FLAGd8f762366 [2022-07-22 11:09:51,920 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:09:51,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2022-07-22 11:09:51,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d2f2438/5c3ce64e90264547a3c1cf520275fc5f/FLAGd8f762366 [2022-07-22 11:09:52,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d2f2438/5c3ce64e90264547a3c1cf520275fc5f [2022-07-22 11:09:52,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:09:52,329 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:09:52,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:09:52,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:09:52,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:09:52,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:09:52" (1/1) ... [2022-07-22 11:09:52,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67e10e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:52, skipping insertion in model container [2022-07-22 11:09:52,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:09:52" (1/1) ... [2022-07-22 11:09:52,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:09:52,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:09:52,562 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/openssl-simplified/s3_srvr_4.cil.c[42875,42888] [2022-07-22 11:09:52,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:09:52,580 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:09:52,638 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/openssl-simplified/s3_srvr_4.cil.c[42875,42888] [2022-07-22 11:09:52,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:09:52,652 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:09:52,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:52 WrapperNode [2022-07-22 11:09:52,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:09:52,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:09:52,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:09:52,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:09:52,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:52" (1/1) ... [2022-07-22 11:09:52,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:52" (1/1) ... [2022-07-22 11:09:52,708 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 546 [2022-07-22 11:09:52,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:09:52,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:09:52,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:09:52,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:09:52,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:52" (1/1) ... [2022-07-22 11:09:52,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:52" (1/1) ... [2022-07-22 11:09:52,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:52" (1/1) ... [2022-07-22 11:09:52,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:52" (1/1) ... [2022-07-22 11:09:52,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:52" (1/1) ... [2022-07-22 11:09:52,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:52" (1/1) ... [2022-07-22 11:09:52,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:52" (1/1) ... [2022-07-22 11:09:52,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:09:52,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:09:52,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:09:52,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:09:52,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:52" (1/1) ... [2022-07-22 11:09:52,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:09:52,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:09:52,795 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-22 11:09:52,797 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-22 11:09:52,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:09:52,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:09:52,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:09:52,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:09:52,945 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:09:52,946 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:09:52,957 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:09:53,344 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-22 11:09:53,344 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-22 11:09:53,345 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:09:53,352 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:09:53,355 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 11:09:53,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:09:53 BoogieIcfgContainer [2022-07-22 11:09:53,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:09:53,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:09:53,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:09:53,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:09:53,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:09:52" (1/3) ... [2022-07-22 11:09:53,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779c4a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:09:53, skipping insertion in model container [2022-07-22 11:09:53,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:52" (2/3) ... [2022-07-22 11:09:53,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779c4a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:09:53, skipping insertion in model container [2022-07-22 11:09:53,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:09:53" (3/3) ... [2022-07-22 11:09:53,376 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2022-07-22 11:09:53,385 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:09:53,385 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:09:53,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:09:53,427 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@ff7057b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@30dc3079 [2022-07-22 11:09:53,427 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:09:53,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 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-22 11:09:53,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 11:09:53,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:53,439 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:53,440 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:53,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:53,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1632005994, now seen corresponding path program 1 times [2022-07-22 11:09:53,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:53,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631808872] [2022-07-22 11:09:53,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:53,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:53,584 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-22 11:09:53,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:53,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631808872] [2022-07-22 11:09:53,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631808872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:53,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:53,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019574065] [2022-07-22 11:09:53,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:53,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:53,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:53,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:53,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:53,615 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 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 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-22 11:09:53,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:53,805 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2022-07-22 11:09:53,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:53,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-07-22 11:09:53,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:53,816 INFO L225 Difference]: With dead ends: 328 [2022-07-22 11:09:53,817 INFO L226 Difference]: Without dead ends: 175 [2022-07-22 11:09:53,819 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-22 11:09:53,821 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 170 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:53,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 190 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-22 11:09:53,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2022-07-22 11:09:53,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.6272189349112427) internal successors, (275), 169 states have internal predecessors, (275), 0 states have call successors, (0), 0 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-22 11:09:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2022-07-22 11:09:53,854 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2022-07-22 11:09:53,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:53,855 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2022-07-22 11:09:53,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-22 11:09:53,855 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2022-07-22 11:09:53,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-22 11:09:53,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:53,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:53,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 11:09:53,857 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:53,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:53,858 INFO L85 PathProgramCache]: Analyzing trace with hash -954576436, now seen corresponding path program 1 times [2022-07-22 11:09:53,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:53,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829747767] [2022-07-22 11:09:53,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:53,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:53,910 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-22 11:09:53,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:53,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829747767] [2022-07-22 11:09:53,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829747767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:53,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:53,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:53,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843298508] [2022-07-22 11:09:53,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:53,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:53,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:53,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:53,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:53,914 INFO L87 Difference]: Start difference. First operand 170 states and 275 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-22 11:09:54,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:54,087 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2022-07-22 11:09:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:54,088 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 45 [2022-07-22 11:09:54,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:54,092 INFO L225 Difference]: With dead ends: 380 [2022-07-22 11:09:54,092 INFO L226 Difference]: Without dead ends: 216 [2022-07-22 11:09:54,097 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-22 11:09:54,099 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 129 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:54,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 142 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-22 11:09:54,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2022-07-22 11:09:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.6761904761904762) internal successors, (352), 210 states have internal predecessors, (352), 0 states have call successors, (0), 0 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-22 11:09:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2022-07-22 11:09:54,111 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2022-07-22 11:09:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:54,111 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2022-07-22 11:09:54,111 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-22 11:09:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2022-07-22 11:09:54,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 11:09:54,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:54,113 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 11:09:54,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 11:09:54,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:54,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:54,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1754997851, now seen corresponding path program 1 times [2022-07-22 11:09:54,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:54,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062756543] [2022-07-22 11:09:54,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:54,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:09:54,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:54,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062756543] [2022-07-22 11:09:54,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062756543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:54,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:54,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:54,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508671403] [2022-07-22 11:09:54,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:54,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:54,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:54,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:54,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:54,195 INFO L87 Difference]: Start difference. First operand 211 states and 352 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 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-22 11:09:54,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:54,297 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2022-07-22 11:09:54,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:54,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-07-22 11:09:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:54,300 INFO L225 Difference]: With dead ends: 445 [2022-07-22 11:09:54,301 INFO L226 Difference]: Without dead ends: 242 [2022-07-22 11:09:54,304 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-22 11:09:54,308 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 136 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:54,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 155 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:54,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-22 11:09:54,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-07-22 11:09:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.6929460580912863) internal successors, (408), 241 states have internal predecessors, (408), 0 states have call successors, (0), 0 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-22 11:09:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2022-07-22 11:09:54,330 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2022-07-22 11:09:54,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:54,331 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2022-07-22 11:09:54,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 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-22 11:09:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2022-07-22 11:09:54,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-22 11:09:54,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:54,339 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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-22 11:09:54,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 11:09:54,339 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:54,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:54,343 INFO L85 PathProgramCache]: Analyzing trace with hash -479038981, now seen corresponding path program 1 times [2022-07-22 11:09:54,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:54,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547701771] [2022-07-22 11:09:54,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:54,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 11:09:54,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:54,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547701771] [2022-07-22 11:09:54,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547701771] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:54,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:54,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:54,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017325367] [2022-07-22 11:09:54,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:54,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:54,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:54,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:54,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:54,409 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 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-22 11:09:54,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:54,480 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2022-07-22 11:09:54,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:54,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-07-22 11:09:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:54,483 INFO L225 Difference]: With dead ends: 493 [2022-07-22 11:09:54,483 INFO L226 Difference]: Without dead ends: 259 [2022-07-22 11:09:54,483 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-22 11:09:54,488 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 158 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:54,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 150 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:54,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-22 11:09:54,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-07-22 11:09:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.68359375) internal successors, (431), 256 states have internal predecessors, (431), 0 states have call successors, (0), 0 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-22 11:09:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2022-07-22 11:09:54,509 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2022-07-22 11:09:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:54,509 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2022-07-22 11:09:54,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 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-22 11:09:54,510 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2022-07-22 11:09:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-22 11:09:54,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:54,511 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 11:09:54,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 11:09:54,512 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:54,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1816808322, now seen corresponding path program 1 times [2022-07-22 11:09:54,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:54,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858097863] [2022-07-22 11:09:54,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:09:54,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:54,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858097863] [2022-07-22 11:09:54,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858097863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:54,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:54,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:54,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876310528] [2022-07-22 11:09:54,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:54,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:54,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:54,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:54,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:54,568 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:54,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:54,673 INFO L93 Difference]: Finished difference Result 553 states and 933 transitions. [2022-07-22 11:09:54,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:54,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-07-22 11:09:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:54,676 INFO L225 Difference]: With dead ends: 553 [2022-07-22 11:09:54,676 INFO L226 Difference]: Without dead ends: 304 [2022-07-22 11:09:54,676 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-22 11:09:54,677 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 133 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:54,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 147 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-22 11:09:54,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 299. [2022-07-22 11:09:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6946308724832215) internal successors, (505), 298 states have internal predecessors, (505), 0 states have call successors, (0), 0 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-22 11:09:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2022-07-22 11:09:54,687 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2022-07-22 11:09:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:54,689 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2022-07-22 11:09:54,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2022-07-22 11:09:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-22 11:09:54,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:54,691 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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-22 11:09:54,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 11:09:54,692 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:54,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:54,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1697148062, now seen corresponding path program 1 times [2022-07-22 11:09:54,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:54,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598582589] [2022-07-22 11:09:54,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:54,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:54,753 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 11:09:54,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:54,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598582589] [2022-07-22 11:09:54,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598582589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:54,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:54,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:54,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60680046] [2022-07-22 11:09:54,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:54,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:54,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:54,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:54,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:54,759 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-22 11:09:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:54,830 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2022-07-22 11:09:54,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:54,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-07-22 11:09:54,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:54,832 INFO L225 Difference]: With dead ends: 592 [2022-07-22 11:09:54,832 INFO L226 Difference]: Without dead ends: 301 [2022-07-22 11:09:54,832 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-22 11:09:54,833 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 157 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:54,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 138 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-22 11:09:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2022-07-22 11:09:54,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6812080536912752) internal successors, (501), 298 states have internal predecessors, (501), 0 states have call successors, (0), 0 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-22 11:09:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2022-07-22 11:09:54,841 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2022-07-22 11:09:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:54,843 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2022-07-22 11:09:54,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-22 11:09:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2022-07-22 11:09:54,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-22 11:09:54,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:54,844 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 11:09:54,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 11:09:54,844 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:54,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1432172412, now seen corresponding path program 1 times [2022-07-22 11:09:54,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:54,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129643495] [2022-07-22 11:09:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:09:54,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:54,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129643495] [2022-07-22 11:09:54,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129643495] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:54,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:54,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:54,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428855649] [2022-07-22 11:09:54,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:54,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:54,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:54,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:54,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:54,923 INFO L87 Difference]: Start difference. First operand 299 states and 501 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:55,019 INFO L93 Difference]: Finished difference Result 595 states and 997 transitions. [2022-07-22 11:09:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:55,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-07-22 11:09:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:55,021 INFO L225 Difference]: With dead ends: 595 [2022-07-22 11:09:55,021 INFO L226 Difference]: Without dead ends: 302 [2022-07-22 11:09:55,021 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-22 11:09:55,022 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 130 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:55,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 145 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-07-22 11:09:55,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2022-07-22 11:09:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.6756756756756757) internal successors, (496), 296 states have internal predecessors, (496), 0 states have call successors, (0), 0 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-22 11:09:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2022-07-22 11:09:55,031 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2022-07-22 11:09:55,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:55,031 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2022-07-22 11:09:55,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:55,031 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2022-07-22 11:09:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-22 11:09:55,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:55,033 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-22 11:09:55,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 11:09:55,033 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:55,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:55,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1085183485, now seen corresponding path program 1 times [2022-07-22 11:09:55,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:55,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100769887] [2022-07-22 11:09:55,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:55,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-22 11:09:55,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:55,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100769887] [2022-07-22 11:09:55,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100769887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:55,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:55,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:55,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061641581] [2022-07-22 11:09:55,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:55,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:55,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:55,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:55,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:55,085 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-22 11:09:55,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:55,156 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2022-07-22 11:09:55,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:55,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 97 [2022-07-22 11:09:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:55,157 INFO L225 Difference]: With dead ends: 595 [2022-07-22 11:09:55,157 INFO L226 Difference]: Without dead ends: 306 [2022-07-22 11:09:55,158 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-22 11:09:55,158 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 162 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:55,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 149 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:55,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-22 11:09:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2022-07-22 11:09:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.6459016393442623) internal successors, (502), 305 states have internal predecessors, (502), 0 states have call successors, (0), 0 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-22 11:09:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2022-07-22 11:09:55,167 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2022-07-22 11:09:55,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:55,168 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2022-07-22 11:09:55,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-22 11:09:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2022-07-22 11:09:55,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-22 11:09:55,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:55,170 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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-22 11:09:55,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 11:09:55,170 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:55,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:55,170 INFO L85 PathProgramCache]: Analyzing trace with hash -860132162, now seen corresponding path program 1 times [2022-07-22 11:09:55,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:55,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911992631] [2022-07-22 11:09:55,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:55,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 11:09:55,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:55,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911992631] [2022-07-22 11:09:55,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911992631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:55,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:55,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:55,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944066288] [2022-07-22 11:09:55,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:55,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:55,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:55,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:55,210 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:55,290 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2022-07-22 11:09:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:55,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-07-22 11:09:55,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:55,292 INFO L225 Difference]: With dead ends: 635 [2022-07-22 11:09:55,292 INFO L226 Difference]: Without dead ends: 337 [2022-07-22 11:09:55,293 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-22 11:09:55,294 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 141 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:55,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 141 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-22 11:09:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-07-22 11:09:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6437125748502994) internal successors, (549), 334 states have internal predecessors, (549), 0 states have call successors, (0), 0 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-22 11:09:55,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2022-07-22 11:09:55,303 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2022-07-22 11:09:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:55,304 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2022-07-22 11:09:55,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:55,304 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2022-07-22 11:09:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-22 11:09:55,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:55,305 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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-22 11:09:55,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 11:09:55,305 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:55,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:55,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1120928325, now seen corresponding path program 1 times [2022-07-22 11:09:55,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:55,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545745527] [2022-07-22 11:09:55,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:55,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 11:09:55,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:55,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545745527] [2022-07-22 11:09:55,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545745527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:55,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:55,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:55,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326685802] [2022-07-22 11:09:55,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:55,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:55,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:55,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:55,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:55,341 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-22 11:09:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:55,421 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2022-07-22 11:09:55,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:55,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 99 [2022-07-22 11:09:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:55,423 INFO L225 Difference]: With dead ends: 664 [2022-07-22 11:09:55,423 INFO L226 Difference]: Without dead ends: 337 [2022-07-22 11:09:55,424 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-22 11:09:55,424 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:55,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 141 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-22 11:09:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-07-22 11:09:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6317365269461077) internal successors, (545), 334 states have internal predecessors, (545), 0 states have call successors, (0), 0 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-22 11:09:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2022-07-22 11:09:55,431 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2022-07-22 11:09:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:55,432 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2022-07-22 11:09:55,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-22 11:09:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2022-07-22 11:09:55,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-22 11:09:55,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:55,433 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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-22 11:09:55,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 11:09:55,433 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:55,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:55,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1084775058, now seen corresponding path program 1 times [2022-07-22 11:09:55,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:55,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656272785] [2022-07-22 11:09:55,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:55,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:55,464 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 11:09:55,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:55,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656272785] [2022-07-22 11:09:55,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656272785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:55,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:55,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:55,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841790255] [2022-07-22 11:09:55,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:55,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:55,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:55,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:55,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:55,466 INFO L87 Difference]: Start difference. First operand 335 states and 545 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-22 11:09:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:55,546 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2022-07-22 11:09:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:55,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 100 [2022-07-22 11:09:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:55,547 INFO L225 Difference]: With dead ends: 697 [2022-07-22 11:09:55,547 INFO L226 Difference]: Without dead ends: 370 [2022-07-22 11:09:55,548 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-22 11:09:55,548 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 143 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:55,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 149 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:55,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-22 11:09:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2022-07-22 11:09:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.626038781163435) internal successors, (587), 361 states have internal predecessors, (587), 0 states have call successors, (0), 0 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-22 11:09:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2022-07-22 11:09:55,559 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2022-07-22 11:09:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:55,559 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2022-07-22 11:09:55,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-22 11:09:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2022-07-22 11:09:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-22 11:09:55,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:55,560 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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-22 11:09:55,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 11:09:55,561 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:55,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:55,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1691577195, now seen corresponding path program 1 times [2022-07-22 11:09:55,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:55,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097700510] [2022-07-22 11:09:55,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:55,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 11:09:55,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:55,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097700510] [2022-07-22 11:09:55,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097700510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:55,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:55,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:55,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134775992] [2022-07-22 11:09:55,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:55,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:55,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:55,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:55,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:55,591 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:55,673 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2022-07-22 11:09:55,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:55,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-07-22 11:09:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:55,675 INFO L225 Difference]: With dead ends: 724 [2022-07-22 11:09:55,675 INFO L226 Difference]: Without dead ends: 370 [2022-07-22 11:09:55,675 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-22 11:09:55,676 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:55,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 149 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-22 11:09:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2022-07-22 11:09:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.6121883656509695) internal successors, (582), 361 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-22 11:09:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2022-07-22 11:09:55,685 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2022-07-22 11:09:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:55,685 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2022-07-22 11:09:55,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2022-07-22 11:09:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-22 11:09:55,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:55,687 INFO L195 NwaCegarLoop]: trace histogram [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, 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-22 11:09:55,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 11:09:55,687 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:55,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:55,688 INFO L85 PathProgramCache]: Analyzing trace with hash -479008336, now seen corresponding path program 1 times [2022-07-22 11:09:55,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:55,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978739828] [2022-07-22 11:09:55,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:55,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 11:09:55,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:55,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978739828] [2022-07-22 11:09:55,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978739828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:55,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:55,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:55,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213632155] [2022-07-22 11:09:55,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:55,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:55,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:55,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:55,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:55,709 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-22 11:09:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:55,800 INFO L93 Difference]: Finished difference Result 741 states and 1193 transitions. [2022-07-22 11:09:55,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:55,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-07-22 11:09:55,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:55,802 INFO L225 Difference]: With dead ends: 741 [2022-07-22 11:09:55,802 INFO L226 Difference]: Without dead ends: 387 [2022-07-22 11:09:55,803 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-22 11:09:55,803 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 149 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:55,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 144 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-07-22 11:09:55,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2022-07-22 11:09:55,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5994764397905759) internal successors, (611), 382 states have internal predecessors, (611), 0 states have call successors, (0), 0 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-22 11:09:55,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2022-07-22 11:09:55,829 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2022-07-22 11:09:55,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:55,829 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2022-07-22 11:09:55,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-22 11:09:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2022-07-22 11:09:55,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-22 11:09:55,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:55,831 INFO L195 NwaCegarLoop]: trace histogram [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, 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-22 11:09:55,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 11:09:55,831 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:55,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:55,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2118869193, now seen corresponding path program 1 times [2022-07-22 11:09:55,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:55,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176225250] [2022-07-22 11:09:55,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:55,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 11:09:55,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:55,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176225250] [2022-07-22 11:09:55,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176225250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:55,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:55,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:55,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283402931] [2022-07-22 11:09:55,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:55,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:55,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:55,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:55,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:55,882 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 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-22 11:09:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:55,995 INFO L93 Difference]: Finished difference Result 762 states and 1216 transitions. [2022-07-22 11:09:56,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:56,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-22 11:09:56,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:56,003 INFO L225 Difference]: With dead ends: 762 [2022-07-22 11:09:56,003 INFO L226 Difference]: Without dead ends: 387 [2022-07-22 11:09:56,004 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-22 11:09:56,004 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 148 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:56,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 144 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-07-22 11:09:56,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2022-07-22 11:09:56,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5837696335078535) internal successors, (605), 382 states have internal predecessors, (605), 0 states have call successors, (0), 0 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-22 11:09:56,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2022-07-22 11:09:56,013 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2022-07-22 11:09:56,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:56,013 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2022-07-22 11:09:56,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 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-22 11:09:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2022-07-22 11:09:56,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-22 11:09:56,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:56,015 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-07-22 11:09:56,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 11:09:56,015 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:56,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:56,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1932137040, now seen corresponding path program 1 times [2022-07-22 11:09:56,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:56,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058496841] [2022-07-22 11:09:56,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:56,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-22 11:09:56,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:56,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058496841] [2022-07-22 11:09:56,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058496841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:56,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:56,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:56,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107861359] [2022-07-22 11:09:56,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:56,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:56,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:56,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:56,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:56,042 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-22 11:09:56,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:56,069 INFO L93 Difference]: Finished difference Result 1131 states and 1790 transitions. [2022-07-22 11:09:56,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:56,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 121 [2022-07-22 11:09:56,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:56,072 INFO L225 Difference]: With dead ends: 1131 [2022-07-22 11:09:56,072 INFO L226 Difference]: Without dead ends: 756 [2022-07-22 11:09:56,074 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-22 11:09:56,074 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 137 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:56,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 543 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:09:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-07-22 11:09:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2022-07-22 11:09:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.5788079470198675) internal successors, (1192), 755 states have internal predecessors, (1192), 0 states have call successors, (0), 0 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-22 11:09:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1192 transitions. [2022-07-22 11:09:56,102 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1192 transitions. Word has length 121 [2022-07-22 11:09:56,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:56,102 INFO L495 AbstractCegarLoop]: Abstraction has 756 states and 1192 transitions. [2022-07-22 11:09:56,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-22 11:09:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1192 transitions. [2022-07-22 11:09:56,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-22 11:09:56,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:56,104 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-07-22 11:09:56,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 11:09:56,104 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:56,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:56,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1552830339, now seen corresponding path program 1 times [2022-07-22 11:09:56,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:56,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521759253] [2022-07-22 11:09:56,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:56,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 11:09:56,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:56,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521759253] [2022-07-22 11:09:56,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521759253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:56,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:56,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:56,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894374309] [2022-07-22 11:09:56,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:56,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:56,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:56,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:56,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:56,136 INFO L87 Difference]: Start difference. First operand 756 states and 1192 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 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-22 11:09:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:56,164 INFO L93 Difference]: Finished difference Result 1832 states and 2893 transitions. [2022-07-22 11:09:56,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:56,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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-22 11:09:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:56,167 INFO L225 Difference]: With dead ends: 1832 [2022-07-22 11:09:56,167 INFO L226 Difference]: Without dead ends: 1084 [2022-07-22 11:09:56,168 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-22 11:09:56,170 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 134 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:56,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 543 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:09:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2022-07-22 11:09:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2022-07-22 11:09:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 1.5780240073868883) internal successors, (1709), 1083 states have internal predecessors, (1709), 0 states have call successors, (0), 0 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-22 11:09:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1709 transitions. [2022-07-22 11:09:56,193 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1709 transitions. Word has length 122 [2022-07-22 11:09:56,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:56,193 INFO L495 AbstractCegarLoop]: Abstraction has 1084 states and 1709 transitions. [2022-07-22 11:09:56,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 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-22 11:09:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1709 transitions. [2022-07-22 11:09:56,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-22 11:09:56,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:56,195 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-07-22 11:09:56,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 11:09:56,195 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:56,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:56,196 INFO L85 PathProgramCache]: Analyzing trace with hash 323652479, now seen corresponding path program 1 times [2022-07-22 11:09:56,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:56,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912536696] [2022-07-22 11:09:56,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:56,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 11:09:56,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:56,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912536696] [2022-07-22 11:09:56,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912536696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:56,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:56,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:56,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519541692] [2022-07-22 11:09:56,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:56,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:56,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:56,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:56,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:56,218 INFO L87 Difference]: Start difference. First operand 1084 states and 1709 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:56,251 INFO L93 Difference]: Finished difference Result 2529 states and 3993 transitions. [2022-07-22 11:09:56,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:56,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-07-22 11:09:56,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:56,255 INFO L225 Difference]: With dead ends: 2529 [2022-07-22 11:09:56,256 INFO L226 Difference]: Without dead ends: 1453 [2022-07-22 11:09:56,257 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-22 11:09:56,257 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 155 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:56,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 546 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:09:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2022-07-22 11:09:56,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2022-07-22 11:09:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1452 states have (on average 1.5778236914600552) internal successors, (2291), 1452 states have internal predecessors, (2291), 0 states have call successors, (0), 0 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-22 11:09:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2291 transitions. [2022-07-22 11:09:56,286 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2291 transitions. Word has length 122 [2022-07-22 11:09:56,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:56,286 INFO L495 AbstractCegarLoop]: Abstraction has 1453 states and 2291 transitions. [2022-07-22 11:09:56,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2291 transitions. [2022-07-22 11:09:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-22 11:09:56,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:56,288 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-07-22 11:09:56,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 11:09:56,289 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:56,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:56,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1712946493, now seen corresponding path program 1 times [2022-07-22 11:09:56,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:56,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507815973] [2022-07-22 11:09:56,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:56,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-22 11:09:56,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:56,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507815973] [2022-07-22 11:09:56,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507815973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:56,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:56,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:56,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624882660] [2022-07-22 11:09:56,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:56,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:56,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:56,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:56,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:56,309 INFO L87 Difference]: Start difference. First operand 1453 states and 2291 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:56,354 INFO L93 Difference]: Finished difference Result 3249 states and 5126 transitions. [2022-07-22 11:09:56,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:56,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-07-22 11:09:56,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:56,360 INFO L225 Difference]: With dead ends: 3249 [2022-07-22 11:09:56,360 INFO L226 Difference]: Without dead ends: 1804 [2022-07-22 11:09:56,361 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-22 11:09:56,362 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 170 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:56,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 388 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:09:56,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2022-07-22 11:09:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2022-07-22 11:09:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.5762617859123682) internal successors, (2842), 1803 states have internal predecessors, (2842), 0 states have call successors, (0), 0 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-22 11:09:56,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2842 transitions. [2022-07-22 11:09:56,397 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2842 transitions. Word has length 122 [2022-07-22 11:09:56,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:56,398 INFO L495 AbstractCegarLoop]: Abstraction has 1804 states and 2842 transitions. [2022-07-22 11:09:56,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:56,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2842 transitions. [2022-07-22 11:09:56,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-22 11:09:56,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:56,401 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:56,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 11:09:56,401 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:56,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:56,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1532697181, now seen corresponding path program 1 times [2022-07-22 11:09:56,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:56,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256791351] [2022-07-22 11:09:56,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:56,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-22 11:09:56,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:56,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256791351] [2022-07-22 11:09:56,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256791351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:56,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:56,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:56,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805923309] [2022-07-22 11:09:56,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:56,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:56,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:56,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:56,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:56,443 INFO L87 Difference]: Start difference. First operand 1804 states and 2842 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-22 11:09:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:56,557 INFO L93 Difference]: Finished difference Result 3650 states and 5732 transitions. [2022-07-22 11:09:56,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:56,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 199 [2022-07-22 11:09:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:56,563 INFO L225 Difference]: With dead ends: 3650 [2022-07-22 11:09:56,563 INFO L226 Difference]: Without dead ends: 1854 [2022-07-22 11:09:56,566 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-22 11:09:56,566 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 50 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:56,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 297 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:56,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2022-07-22 11:09:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1804. [2022-07-22 11:09:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.5363283416528009) internal successors, (2770), 1803 states have internal predecessors, (2770), 0 states have call successors, (0), 0 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-22 11:09:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2770 transitions. [2022-07-22 11:09:56,623 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2770 transitions. Word has length 199 [2022-07-22 11:09:56,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:56,623 INFO L495 AbstractCegarLoop]: Abstraction has 1804 states and 2770 transitions. [2022-07-22 11:09:56,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-22 11:09:56,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2770 transitions. [2022-07-22 11:09:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-22 11:09:56,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:56,627 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 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, 1, 1, 1, 1, 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-22 11:09:56,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 11:09:56,627 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:56,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:56,627 INFO L85 PathProgramCache]: Analyzing trace with hash -995291011, now seen corresponding path program 1 times [2022-07-22 11:09:56,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:56,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099333612] [2022-07-22 11:09:56,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:56,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-22 11:09:56,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:56,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099333612] [2022-07-22 11:09:56,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099333612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:56,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:56,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:56,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378823169] [2022-07-22 11:09:56,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:56,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:56,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:56,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:56,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:56,666 INFO L87 Difference]: Start difference. First operand 1804 states and 2770 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-22 11:09:56,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:56,785 INFO L93 Difference]: Finished difference Result 3667 states and 5605 transitions. [2022-07-22 11:09:56,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:56,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 213 [2022-07-22 11:09:56,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:56,791 INFO L225 Difference]: With dead ends: 3667 [2022-07-22 11:09:56,791 INFO L226 Difference]: Without dead ends: 1871 [2022-07-22 11:09:56,793 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-22 11:09:56,793 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 152 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:56,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 163 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2022-07-22 11:09:56,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1804. [2022-07-22 11:09:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.4941763727121464) internal successors, (2694), 1803 states have internal predecessors, (2694), 0 states have call successors, (0), 0 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-22 11:09:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2694 transitions. [2022-07-22 11:09:56,835 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2694 transitions. Word has length 213 [2022-07-22 11:09:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:56,836 INFO L495 AbstractCegarLoop]: Abstraction has 1804 states and 2694 transitions. [2022-07-22 11:09:56,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-22 11:09:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2694 transitions. [2022-07-22 11:09:56,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-07-22 11:09:56,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:56,839 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 11:09:56,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 11:09:56,839 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:56,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:56,840 INFO L85 PathProgramCache]: Analyzing trace with hash -344869126, now seen corresponding path program 1 times [2022-07-22 11:09:56,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:56,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098901911] [2022-07-22 11:09:56,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:56,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-22 11:09:56,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:56,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098901911] [2022-07-22 11:09:56,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098901911] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:09:56,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048203946] [2022-07-22 11:09:56,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:56,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:09:56,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:09:56,912 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-22 11:09:56,979 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-22 11:09:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:57,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 11:09:57,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:09:57,130 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-22 11:09:57,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:09:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-22 11:09:57,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048203946] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:09:57,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:09:57,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-22 11:09:57,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202449925] [2022-07-22 11:09:57,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:09:57,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 11:09:57,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:57,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 11:09:57,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:09:57,211 INFO L87 Difference]: Start difference. First operand 1804 states and 2694 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 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-22 11:09:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:57,463 INFO L93 Difference]: Finished difference Result 4265 states and 6321 transitions. [2022-07-22 11:09:57,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 11:09:57,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 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 232 [2022-07-22 11:09:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:57,470 INFO L225 Difference]: With dead ends: 4265 [2022-07-22 11:09:57,470 INFO L226 Difference]: Without dead ends: 2436 [2022-07-22 11:09:57,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-22 11:09:57,473 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 486 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:57,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 448 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 11:09:57,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2022-07-22 11:09:57,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1604. [2022-07-22 11:09:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1603 states have (on average 1.470991890205864) internal successors, (2358), 1603 states have internal predecessors, (2358), 0 states have call successors, (0), 0 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-22 11:09:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2358 transitions. [2022-07-22 11:09:57,513 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2358 transitions. Word has length 232 [2022-07-22 11:09:57,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:57,513 INFO L495 AbstractCegarLoop]: Abstraction has 1604 states and 2358 transitions. [2022-07-22 11:09:57,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 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-22 11:09:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2358 transitions. [2022-07-22 11:09:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-22 11:09:57,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:57,517 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 11:09:57,546 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-22 11:09:57,732 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,SelfDestructingSolverStorable20 [2022-07-22 11:09:57,732 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:57,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:57,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1731638989, now seen corresponding path program 1 times [2022-07-22 11:09:57,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:57,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713344408] [2022-07-22 11:09:57,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:57,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-07-22 11:09:57,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:57,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713344408] [2022-07-22 11:09:57,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713344408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:57,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:57,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:57,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102587344] [2022-07-22 11:09:57,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:57,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:57,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:57,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:57,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:57,778 INFO L87 Difference]: Start difference. First operand 1604 states and 2358 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-22 11:09:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:57,885 INFO L93 Difference]: Finished difference Result 3395 states and 5009 transitions. [2022-07-22 11:09:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:57,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 241 [2022-07-22 11:09:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:57,892 INFO L225 Difference]: With dead ends: 3395 [2022-07-22 11:09:57,892 INFO L226 Difference]: Without dead ends: 1679 [2022-07-22 11:09:57,894 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-22 11:09:57,894 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 46 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:57,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 270 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:57,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2022-07-22 11:09:57,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2022-07-22 11:09:57,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1678 states have (on average 1.4439809296781883) internal successors, (2423), 1678 states have internal predecessors, (2423), 0 states have call successors, (0), 0 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-22 11:09:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2423 transitions. [2022-07-22 11:09:57,935 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2423 transitions. Word has length 241 [2022-07-22 11:09:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:57,935 INFO L495 AbstractCegarLoop]: Abstraction has 1679 states and 2423 transitions. [2022-07-22 11:09:57,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-22 11:09:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2423 transitions. [2022-07-22 11:09:57,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-22 11:09:57,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:57,938 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 11:09:57,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-22 11:09:57,939 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:57,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:57,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1272517136, now seen corresponding path program 1 times [2022-07-22 11:09:57,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:57,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761708946] [2022-07-22 11:09:57,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:57,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-22 11:09:57,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:57,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761708946] [2022-07-22 11:09:57,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761708946] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:09:57,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616593376] [2022-07-22 11:09:57,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:57,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:09:57,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:09:57,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 11:09:58,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 11:09:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:58,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 11:09:58,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:09:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-22 11:09:58,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:09:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-22 11:09:58,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616593376] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:09:58,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:09:58,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-22 11:09:58,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857853600] [2022-07-22 11:09:58,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:09:58,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 11:09:58,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:58,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 11:09:58,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:09:58,205 INFO L87 Difference]: Start difference. First operand 1679 states and 2423 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 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-22 11:09:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:58,953 INFO L93 Difference]: Finished difference Result 7700 states and 11238 transitions. [2022-07-22 11:09:58,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 11:09:58,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 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 253 [2022-07-22 11:09:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:58,970 INFO L225 Difference]: With dead ends: 7700 [2022-07-22 11:09:58,970 INFO L226 Difference]: Without dead ends: 6029 [2022-07-22 11:09:58,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-22 11:09:58,975 INFO L413 NwaCegarLoop]: 540 mSDtfsCounter, 438 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:58,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1186 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 11:09:58,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2022-07-22 11:09:59,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 2357. [2022-07-22 11:09:59,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2356 states have (on average 1.3247028862478778) internal successors, (3121), 2356 states have internal predecessors, (3121), 0 states have call successors, (0), 0 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-22 11:09:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3121 transitions. [2022-07-22 11:09:59,074 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3121 transitions. Word has length 253 [2022-07-22 11:09:59,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:59,074 INFO L495 AbstractCegarLoop]: Abstraction has 2357 states and 3121 transitions. [2022-07-22 11:09:59,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 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-22 11:09:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3121 transitions. [2022-07-22 11:09:59,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-22 11:09:59,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:59,078 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 11:09:59,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 11:09:59,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-22 11:09:59,292 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:59,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:59,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1561336526, now seen corresponding path program 1 times [2022-07-22 11:09:59,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:59,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139814190] [2022-07-22 11:09:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:59,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-22 11:09:59,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:59,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139814190] [2022-07-22 11:09:59,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139814190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:59,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:59,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:59,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014655781] [2022-07-22 11:09:59,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:59,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:59,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:59,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:59,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:59,323 INFO L87 Difference]: Start difference. First operand 2357 states and 3121 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 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-22 11:09:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:59,402 INFO L93 Difference]: Finished difference Result 6533 states and 8644 transitions. [2022-07-22 11:09:59,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:59,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 253 [2022-07-22 11:09:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:59,414 INFO L225 Difference]: With dead ends: 6533 [2022-07-22 11:09:59,414 INFO L226 Difference]: Without dead ends: 4184 [2022-07-22 11:09:59,417 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-22 11:09:59,418 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 120 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:59,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 514 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:09:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2022-07-22 11:09:59,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 4182. [2022-07-22 11:09:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4182 states, 4181 states have (on average 1.3207366658694093) internal successors, (5522), 4181 states have internal predecessors, (5522), 0 states have call successors, (0), 0 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-22 11:09:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4182 states to 4182 states and 5522 transitions. [2022-07-22 11:09:59,555 INFO L78 Accepts]: Start accepts. Automaton has 4182 states and 5522 transitions. Word has length 253 [2022-07-22 11:09:59,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:59,555 INFO L495 AbstractCegarLoop]: Abstraction has 4182 states and 5522 transitions. [2022-07-22 11:09:59,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 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-22 11:09:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4182 states and 5522 transitions. [2022-07-22 11:09:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-07-22 11:09:59,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:59,562 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 11:09:59,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-22 11:09:59,562 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:59,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash -914284920, now seen corresponding path program 1 times [2022-07-22 11:09:59,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:59,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510497341] [2022-07-22 11:09:59,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:59,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-22 11:09:59,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:59,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510497341] [2022-07-22 11:09:59,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510497341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:59,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:59,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:59,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380032199] [2022-07-22 11:09:59,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:59,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:59,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:59,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:59,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:59,598 INFO L87 Difference]: Start difference. First operand 4182 states and 5522 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 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-22 11:09:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:59,768 INFO L93 Difference]: Finished difference Result 8584 states and 11340 transitions. [2022-07-22 11:09:59,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:59,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 256 [2022-07-22 11:09:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:59,775 INFO L225 Difference]: With dead ends: 8584 [2022-07-22 11:09:59,775 INFO L226 Difference]: Without dead ends: 4410 [2022-07-22 11:09:59,778 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-22 11:09:59,778 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 137 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:59,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 166 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:59,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4410 states. [2022-07-22 11:09:59,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4410 to 4182. [2022-07-22 11:09:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4182 states, 4181 states have (on average 1.3035159052858167) internal successors, (5450), 4181 states have internal predecessors, (5450), 0 states have call successors, (0), 0 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-22 11:09:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4182 states to 4182 states and 5450 transitions. [2022-07-22 11:09:59,878 INFO L78 Accepts]: Start accepts. Automaton has 4182 states and 5450 transitions. Word has length 256 [2022-07-22 11:09:59,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:59,878 INFO L495 AbstractCegarLoop]: Abstraction has 4182 states and 5450 transitions. [2022-07-22 11:09:59,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 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-22 11:09:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 4182 states and 5450 transitions. [2022-07-22 11:09:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2022-07-22 11:09:59,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:59,884 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-22 11:09:59,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-22 11:09:59,885 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:59,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:59,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1357789354, now seen corresponding path program 1 times [2022-07-22 11:09:59,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:59,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343372299] [2022-07-22 11:09:59,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:59,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:59,910 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2022-07-22 11:09:59,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:59,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343372299] [2022-07-22 11:09:59,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343372299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:59,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:59,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:59,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370164359] [2022-07-22 11:09:59,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:59,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:59,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:59,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:59,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:59,912 INFO L87 Difference]: Start difference. First operand 4182 states and 5450 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-22 11:10:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:00,065 INFO L93 Difference]: Finished difference Result 8488 states and 11054 transitions. [2022-07-22 11:10:00,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:00,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-22 11:10:00,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:00,072 INFO L225 Difference]: With dead ends: 8488 [2022-07-22 11:10:00,072 INFO L226 Difference]: Without dead ends: 4314 [2022-07-22 11:10:00,076 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-22 11:10:00,076 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:00,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 300 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:10:00,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4314 states. [2022-07-22 11:10:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4314 to 4274. [2022-07-22 11:10:00,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4274 states, 4273 states have (on average 1.301661596068336) internal successors, (5562), 4273 states have internal predecessors, (5562), 0 states have call successors, (0), 0 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-22 11:10:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 5562 transitions. [2022-07-22 11:10:00,201 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 5562 transitions. Word has length 290 [2022-07-22 11:10:00,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:00,202 INFO L495 AbstractCegarLoop]: Abstraction has 4274 states and 5562 transitions. [2022-07-22 11:10:00,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-22 11:10:00,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 5562 transitions. [2022-07-22 11:10:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-07-22 11:10:00,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:00,208 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-22 11:10:00,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-22 11:10:00,208 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:00,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:00,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1702375352, now seen corresponding path program 1 times [2022-07-22 11:10:00,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:00,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878410757] [2022-07-22 11:10:00,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:00,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2022-07-22 11:10:00,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:00,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878410757] [2022-07-22 11:10:00,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878410757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:00,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:00,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:00,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994687652] [2022-07-22 11:10:00,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:00,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:00,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:00,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:00,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:00,240 INFO L87 Difference]: Start difference. First operand 4274 states and 5562 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-22 11:10:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:00,383 INFO L93 Difference]: Finished difference Result 8920 states and 11652 transitions. [2022-07-22 11:10:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:00,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 311 [2022-07-22 11:10:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:00,390 INFO L225 Difference]: With dead ends: 8920 [2022-07-22 11:10:00,390 INFO L226 Difference]: Without dead ends: 4654 [2022-07-22 11:10:00,394 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-22 11:10:00,395 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 29 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:00,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 299 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:10:00,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4654 states. [2022-07-22 11:10:00,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4654 to 4524. [2022-07-22 11:10:00,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 4523 states have (on average 1.2960424497015255) internal successors, (5862), 4523 states have internal predecessors, (5862), 0 states have call successors, (0), 0 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-22 11:10:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 5862 transitions. [2022-07-22 11:10:00,533 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 5862 transitions. Word has length 311 [2022-07-22 11:10:00,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:00,533 INFO L495 AbstractCegarLoop]: Abstraction has 4524 states and 5862 transitions. [2022-07-22 11:10:00,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-22 11:10:00,534 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 5862 transitions. [2022-07-22 11:10:00,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-07-22 11:10:00,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:00,541 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-22 11:10:00,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-22 11:10:00,542 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:00,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:00,542 INFO L85 PathProgramCache]: Analyzing trace with hash 602793911, now seen corresponding path program 1 times [2022-07-22 11:10:00,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:00,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809500115] [2022-07-22 11:10:00,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:00,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2022-07-22 11:10:00,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:00,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809500115] [2022-07-22 11:10:00,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809500115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:00,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:00,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:00,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583659252] [2022-07-22 11:10:00,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:00,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:00,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:00,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:00,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:00,585 INFO L87 Difference]: Start difference. First operand 4524 states and 5862 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-22 11:10:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:00,699 INFO L93 Difference]: Finished difference Result 7636 states and 9829 transitions. [2022-07-22 11:10:00,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:00,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 321 [2022-07-22 11:10:00,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:00,703 INFO L225 Difference]: With dead ends: 7636 [2022-07-22 11:10:00,703 INFO L226 Difference]: Without dead ends: 2476 [2022-07-22 11:10:00,707 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-22 11:10:00,707 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:00,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 288 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:10:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2022-07-22 11:10:00,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2022-07-22 11:10:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.2836363636363637) internal successors, (3177), 2475 states have internal predecessors, (3177), 0 states have call successors, (0), 0 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-22 11:10:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3177 transitions. [2022-07-22 11:10:00,754 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3177 transitions. Word has length 321 [2022-07-22 11:10:00,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:00,754 INFO L495 AbstractCegarLoop]: Abstraction has 2476 states and 3177 transitions. [2022-07-22 11:10:00,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-22 11:10:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3177 transitions. [2022-07-22 11:10:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2022-07-22 11:10:00,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:00,759 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-22 11:10:00,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-22 11:10:00,759 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:00,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:00,759 INFO L85 PathProgramCache]: Analyzing trace with hash -616309997, now seen corresponding path program 1 times [2022-07-22 11:10:00,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:00,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671120659] [2022-07-22 11:10:00,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:00,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2022-07-22 11:10:00,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:00,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671120659] [2022-07-22 11:10:00,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671120659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:00,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:00,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:00,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925731341] [2022-07-22 11:10:00,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:00,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:00,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:00,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:00,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:00,823 INFO L87 Difference]: Start difference. First operand 2476 states and 3177 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 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-22 11:10:00,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:00,920 INFO L93 Difference]: Finished difference Result 4984 states and 6407 transitions. [2022-07-22 11:10:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:00,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 337 [2022-07-22 11:10:00,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:00,924 INFO L225 Difference]: With dead ends: 4984 [2022-07-22 11:10:00,924 INFO L226 Difference]: Without dead ends: 2516 [2022-07-22 11:10:00,927 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-22 11:10:00,927 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 19 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:00,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 293 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:10:00,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2022-07-22 11:10:00,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2476. [2022-07-22 11:10:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.2735353535353535) internal successors, (3152), 2475 states have internal predecessors, (3152), 0 states have call successors, (0), 0 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-22 11:10:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3152 transitions. [2022-07-22 11:10:00,974 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3152 transitions. Word has length 337 [2022-07-22 11:10:00,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:00,974 INFO L495 AbstractCegarLoop]: Abstraction has 2476 states and 3152 transitions. [2022-07-22 11:10:00,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 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-22 11:10:00,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3152 transitions. [2022-07-22 11:10:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2022-07-22 11:10:00,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:00,979 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-22 11:10:00,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-22 11:10:00,979 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:00,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:00,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1063549815, now seen corresponding path program 1 times [2022-07-22 11:10:00,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:00,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563167139] [2022-07-22 11:10:00,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:00,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2022-07-22 11:10:01,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:01,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563167139] [2022-07-22 11:10:01,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563167139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:01,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:01,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:01,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045609304] [2022-07-22 11:10:01,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:01,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:01,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:01,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:01,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:01,019 INFO L87 Difference]: Start difference. First operand 2476 states and 3152 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 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-22 11:10:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:01,116 INFO L93 Difference]: Finished difference Result 4954 states and 6302 transitions. [2022-07-22 11:10:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:01,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 360 [2022-07-22 11:10:01,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:01,120 INFO L225 Difference]: With dead ends: 4954 [2022-07-22 11:10:01,120 INFO L226 Difference]: Without dead ends: 2486 [2022-07-22 11:10:01,122 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-22 11:10:01,122 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:01,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:10:01,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2022-07-22 11:10:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2476. [2022-07-22 11:10:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.2634343434343434) internal successors, (3127), 2475 states have internal predecessors, (3127), 0 states have call successors, (0), 0 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-22 11:10:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3127 transitions. [2022-07-22 11:10:01,170 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3127 transitions. Word has length 360 [2022-07-22 11:10:01,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:01,170 INFO L495 AbstractCegarLoop]: Abstraction has 2476 states and 3127 transitions. [2022-07-22 11:10:01,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 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-22 11:10:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3127 transitions. [2022-07-22 11:10:01,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2022-07-22 11:10:01,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:01,175 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-22 11:10:01,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-22 11:10:01,176 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:01,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:01,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2107174257, now seen corresponding path program 1 times [2022-07-22 11:10:01,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:01,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033393057] [2022-07-22 11:10:01,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2022-07-22 11:10:01,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:01,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033393057] [2022-07-22 11:10:01,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033393057] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:10:01,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955323299] [2022-07-22 11:10:01,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:01,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:10:01,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:10:01,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 11:10:01,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 11:10:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:01,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 11:10:01,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:10:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2022-07-22 11:10:01,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:10:01,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955323299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:01,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 11:10:01,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-22 11:10:01,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140595920] [2022-07-22 11:10:01,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:01,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:01,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:01,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:01,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:10:01,590 INFO L87 Difference]: Start difference. First operand 2476 states and 3127 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 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-22 11:10:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:01,636 INFO L93 Difference]: Finished difference Result 3068 states and 3883 transitions. [2022-07-22 11:10:01,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:01,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 393 [2022-07-22 11:10:01,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:01,640 INFO L225 Difference]: With dead ends: 3068 [2022-07-22 11:10:01,640 INFO L226 Difference]: Without dead ends: 2930 [2022-07-22 11:10:01,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:10:01,642 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 91 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:01,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 447 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:01,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2022-07-22 11:10:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2340. [2022-07-22 11:10:01,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2340 states, 2339 states have (on average 1.27105600684053) internal successors, (2973), 2339 states have internal predecessors, (2973), 0 states have call successors, (0), 0 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-22 11:10:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 2973 transitions. [2022-07-22 11:10:01,690 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 2973 transitions. Word has length 393 [2022-07-22 11:10:01,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:01,691 INFO L495 AbstractCegarLoop]: Abstraction has 2340 states and 2973 transitions. [2022-07-22 11:10:01,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 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-22 11:10:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 2973 transitions. [2022-07-22 11:10:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2022-07-22 11:10:01,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:01,694 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2022-07-22 11:10:01,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 11:10:01,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:10:01,923 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:01,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:01,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2021892229, now seen corresponding path program 1 times [2022-07-22 11:10:01,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:01,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884620759] [2022-07-22 11:10:01,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:01,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-07-22 11:10:01,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:01,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884620759] [2022-07-22 11:10:01,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884620759] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:10:01,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151800869] [2022-07-22 11:10:01,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:01,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:10:01,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:10:01,996 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 11:10:01,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 11:10:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:02,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 11:10:02,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:10:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-07-22 11:10:02,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:10:02,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-07-22 11:10:02,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151800869] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:10:02,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:10:02,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-22 11:10:02,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437551378] [2022-07-22 11:10:02,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:10:02,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 11:10:02,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:02,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 11:10:02,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:10:02,284 INFO L87 Difference]: Start difference. First operand 2340 states and 2973 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 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-22 11:10:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:02,562 INFO L93 Difference]: Finished difference Result 5609 states and 7131 transitions. [2022-07-22 11:10:02,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 11:10:02,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 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 409 [2022-07-22 11:10:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:02,567 INFO L225 Difference]: With dead ends: 5609 [2022-07-22 11:10:02,567 INFO L226 Difference]: Without dead ends: 3228 [2022-07-22 11:10:02,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 818 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-22 11:10:02,571 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 586 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:02,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 397 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 11:10:02,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2022-07-22 11:10:02,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 2400. [2022-07-22 11:10:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 2399 states have (on average 1.2705293872446852) internal successors, (3048), 2399 states have internal predecessors, (3048), 0 states have call successors, (0), 0 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-22 11:10:02,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3048 transitions. [2022-07-22 11:10:02,622 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3048 transitions. Word has length 409 [2022-07-22 11:10:02,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:02,623 INFO L495 AbstractCegarLoop]: Abstraction has 2400 states and 3048 transitions. [2022-07-22 11:10:02,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 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-22 11:10:02,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3048 transitions. [2022-07-22 11:10:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2022-07-22 11:10:02,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:02,627 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 8, 8, 6, 6, 4, 4, 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] [2022-07-22 11:10:02,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-22 11:10:02,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:10:02,863 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:02,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:02,864 INFO L85 PathProgramCache]: Analyzing trace with hash -50523035, now seen corresponding path program 1 times [2022-07-22 11:10:02,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:02,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444856005] [2022-07-22 11:10:02,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:02,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3128 backedges. 1661 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2022-07-22 11:10:02,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:02,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444856005] [2022-07-22 11:10:02,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444856005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:02,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:02,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:02,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823161406] [2022-07-22 11:10:02,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:02,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:02,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:02,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:02,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:02,926 INFO L87 Difference]: Start difference. First operand 2400 states and 3048 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-22 11:10:03,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:03,051 INFO L93 Difference]: Finished difference Result 4972 states and 6324 transitions. [2022-07-22 11:10:03,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:03,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 537 [2022-07-22 11:10:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:03,055 INFO L225 Difference]: With dead ends: 4972 [2022-07-22 11:10:03,055 INFO L226 Difference]: Without dead ends: 2580 [2022-07-22 11:10:03,057 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-22 11:10:03,057 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:03,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 290 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:10:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2022-07-22 11:10:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2570. [2022-07-22 11:10:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 2569 states have (on average 1.262358894511483) internal successors, (3243), 2569 states have internal predecessors, (3243), 0 states have call successors, (0), 0 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-22 11:10:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 3243 transitions. [2022-07-22 11:10:03,119 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 3243 transitions. Word has length 537 [2022-07-22 11:10:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:03,120 INFO L495 AbstractCegarLoop]: Abstraction has 2570 states and 3243 transitions. [2022-07-22 11:10:03,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-22 11:10:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3243 transitions. [2022-07-22 11:10:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2022-07-22 11:10:03,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:03,126 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2022-07-22 11:10:03,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-22 11:10:03,126 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:03,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:03,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1600887189, now seen corresponding path program 1 times [2022-07-22 11:10:03,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:03,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956259540] [2022-07-22 11:10:03,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:03,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-07-22 11:10:03,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:03,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956259540] [2022-07-22 11:10:03,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956259540] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:10:03,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908497025] [2022-07-22 11:10:03,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:03,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:10:03,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:10:03,224 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 11:10:03,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 11:10:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:03,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 11:10:03,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:10:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-07-22 11:10:03,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:10:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-07-22 11:10:03,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908497025] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:10:03,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:10:03,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-22 11:10:03,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635007769] [2022-07-22 11:10:03,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:10:03,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 11:10:03,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:03,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 11:10:03,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-22 11:10:03,496 INFO L87 Difference]: Start difference. First operand 2570 states and 3243 transitions. Second operand has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-22 11:10:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:03,664 INFO L93 Difference]: Finished difference Result 4135 states and 5217 transitions. [2022-07-22 11:10:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 11:10:03,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 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 599 [2022-07-22 11:10:03,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:03,665 INFO L225 Difference]: With dead ends: 4135 [2022-07-22 11:10:03,665 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 11:10:03,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1204 GetRequests, 1196 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-22 11:10:03,669 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 119 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:03,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 398 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:10:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 11:10:03,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 11:10:03,669 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-22 11:10:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 11:10:03,670 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 599 [2022-07-22 11:10:03,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:03,670 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 11:10:03,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-22 11:10:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 11:10:03,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 11:10:03,673 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 11:10:03,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-22 11:10:03,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-07-22 11:10:03,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 11:10:17,774 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-07-22 11:10:17,774 INFO L899 garLoopResultBuilder]: For program point L531-2(lines 531 535) no Hoare annotation was computed. [2022-07-22 11:10:17,774 INFO L899 garLoopResultBuilder]: For program point L399(lines 399 417) no Hoare annotation was computed. [2022-07-22 11:10:17,775 INFO L895 garLoopResultBuilder]: At program point L201(lines 197 562) the Hoare annotation is: (let ((.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (or (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse3 .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse0 .cse1) (and .cse3 .cse0 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)))) [2022-07-22 11:10:17,775 INFO L895 garLoopResultBuilder]: At program point L168(lines 164 573) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12))) [2022-07-22 11:10:17,775 INFO L895 garLoopResultBuilder]: At program point L135(lines 134 583) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse10))) [2022-07-22 11:10:17,775 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-07-22 11:10:17,775 INFO L899 garLoopResultBuilder]: For program point L499(lines 499 502) no Hoare annotation was computed. [2022-07-22 11:10:17,775 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 406) no Hoare annotation was computed. [2022-07-22 11:10:17,775 INFO L902 garLoopResultBuilder]: At program point L632(lines 623 634) the Hoare annotation is: true [2022-07-22 11:10:17,775 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 560) no Hoare annotation was computed. [2022-07-22 11:10:17,775 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 571) no Hoare annotation was computed. [2022-07-22 11:10:17,775 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 582) no Hoare annotation was computed. [2022-07-22 11:10:17,775 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 604) no Hoare annotation was computed. [2022-07-22 11:10:17,775 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2022-07-22 11:10:17,775 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2022-07-22 11:10:17,775 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2022-07-22 11:10:17,775 INFO L899 garLoopResultBuilder]: For program point L237-2(lines 219 553) no Hoare annotation was computed. [2022-07-22 11:10:17,775 INFO L899 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2022-07-22 11:10:17,775 INFO L899 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2022-07-22 11:10:17,776 INFO L899 garLoopResultBuilder]: For program point L437-1(lines 437 445) no Hoare annotation was computed. [2022-07-22 11:10:17,776 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-07-22 11:10:17,776 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 559) no Hoare annotation was computed. [2022-07-22 11:10:17,776 INFO L899 garLoopResultBuilder]: For program point L173(lines 173 570) no Hoare annotation was computed. [2022-07-22 11:10:17,776 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 581) no Hoare annotation was computed. [2022-07-22 11:10:17,776 INFO L899 garLoopResultBuilder]: For program point L504(lines 504 510) no Hoare annotation was computed. [2022-07-22 11:10:17,776 INFO L895 garLoopResultBuilder]: At program point L207(lines 203 560) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse7 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse7 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse7) .cse6))) [2022-07-22 11:10:17,776 INFO L895 garLoopResultBuilder]: At program point L174(lines 170 571) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3 .cse4))) [2022-07-22 11:10:17,776 INFO L899 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2022-07-22 11:10:17,776 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 379) no Hoare annotation was computed. [2022-07-22 11:10:17,776 INFO L899 garLoopResultBuilder]: For program point L209(lines 209 558) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 569) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 580) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L895 garLoopResultBuilder]: At program point L110-2(lines 110 609) the Hoare annotation is: (let ((.cse6 (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse25 (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse19 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640)) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse26 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse31 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse30 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not .cse19)) (.cse20 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse21 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse22 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse23 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse28 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse2 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse8 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse24 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse13 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse16 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse29 (not .cse25)) (.cse27 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse17 (not .cse6))) (or (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse3) (and .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15) (and .cse8 .cse9 .cse10 .cse11 .cse13 .cse5 .cse16 .cse14 .cse2 .cse7 .cse17) (and .cse18 .cse12 .cse4 .cse19 .cse20) (and .cse21 .cse22 .cse23 .cse7 .cse15) (and .cse8 .cse9 .cse10 .cse11 .cse24 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse13 .cse14 .cse19 .cse2 .cse23) (and .cse24 .cse19 .cse25) (and .cse24 .cse18 .cse26 .cse4 .cse23 .cse20) (and .cse0 .cse27) (and .cse1 .cse28 .cse19 .cse2 .cse7) (and .cse12 .cse1 .cse22 .cse2 .cse23) (and .cse18 .cse4 .cse7 .cse20) (and .cse24 .cse18 .cse26 .cse4 .cse3 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse21 .cse14) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528) .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse17) (and .cse30 .cse1 .cse28 .cse19 .cse2) (and .cse24 .cse1 .cse22 .cse19 .cse2 .cse23) (and .cse31 .cse30 .cse23 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse24 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512) .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse17) (and .cse31 .cse30 .cse3 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse13 .cse5 .cse16 .cse27 .cse14 .cse7 .cse17) (and .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse23 .cse17) (and .cse12 .cse21 .cse22 .cse23 .cse15) (and .cse24 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse22 .cse19 .cse23 .cse15) (and .cse24 .cse6 .cse19) (and .cse1 .cse22 .cse2 .cse23 .cse7) (and .cse12 .cse1 .cse28 .cse19 .cse2) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse27 .cse14) (and .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse27 .cse14 .cse17)))) [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L507(lines 507 509) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L507-2(lines 219 553) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L895 garLoopResultBuilder]: At program point L408(lines 399 417) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12))) [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L895 garLoopResultBuilder]: At program point L177(lines 176 569) the Hoare annotation is: (let ((.cse6 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse7 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse3 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse2 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse1 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse0 .cse1 (not .cse2)) (and .cse0 .cse3 .cse2 .cse1 .cse4) (and .cse5 .cse0 .cse6 .cse1 .cse7) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse3 .cse2 .cse1) (and (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse6 .cse2 .cse1 .cse7) (and .cse0 .cse6 .cse1 .cse7 .cse4) (and .cse5 .cse0 .cse3 .cse2 .cse1))) [2022-07-22 11:10:17,777 INFO L895 garLoopResultBuilder]: At program point L144(lines 137 582) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse10) (and .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse9 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 547) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L541-1(lines 541 547) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 378) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L344-1(lines 344 378) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 557) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 568) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 579) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 590) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L411(lines 411 413) no Hoare annotation was computed. [2022-07-22 11:10:17,777 INFO L899 garLoopResultBuilder]: For program point L345(lines 345 375) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L895 garLoopResultBuilder]: At program point L213(lines 209 558) the Hoare annotation is: (let ((.cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse2 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (and .cse0 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse0 .cse1 .cse2 (not .cse3)) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3))) [2022-07-22 11:10:17,778 INFO L895 garLoopResultBuilder]: At program point L114(lines 113 590) the Hoare annotation is: false [2022-07-22 11:10:17,778 INFO L902 garLoopResultBuilder]: At program point L610(lines 109 611) the Hoare annotation is: true [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point L544(lines 544 546) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 556) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 567) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 578) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 589) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 322) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point L315-2(lines 315 322) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L895 garLoopResultBuilder]: At program point L216(lines 215 556) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-22 11:10:17,778 INFO L895 garLoopResultBuilder]: At program point L183(lines 179 568) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6))) [2022-07-22 11:10:17,778 INFO L895 garLoopResultBuilder]: At program point L150(lines 146 579) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12 .cse13 .cse14) (and (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse14))) [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point L350(lines 350 373) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L895 garLoopResultBuilder]: At program point L218(lines 217 556) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 566) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 577) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 588) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 617) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point L615-2(lines 615 617) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point L516(lines 516 519) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2022-07-22 11:10:17,778 INFO L899 garLoopResultBuilder]: For program point L285-2(lines 219 553) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 357) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L353-2(lines 353 357) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 565) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 576) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 587) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 419) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L895 garLoopResultBuilder]: At program point L222(lines 116 589) the Hoare annotation is: false [2022-07-22 11:10:17,779 INFO L895 garLoopResultBuilder]: At program point L189(lines 185 566) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6))) [2022-07-22 11:10:17,779 INFO L895 garLoopResultBuilder]: At program point L156(lines 152 577) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6))) [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L902 garLoopResultBuilder]: At program point L620(lines 22 622) the Hoare annotation is: true [2022-07-22 11:10:17,779 INFO L895 garLoopResultBuilder]: At program point L554(lines 110 609) the Hoare annotation is: (let ((.cse6 (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse25 (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse19 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640)) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse26 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse31 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse30 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not .cse19)) (.cse20 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse21 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse22 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse23 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse28 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse2 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse8 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse24 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse13 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse16 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse29 (not .cse25)) (.cse27 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse17 (not .cse6))) (or (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse3) (and .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15) (and .cse8 .cse9 .cse10 .cse11 .cse13 .cse5 .cse16 .cse14 .cse2 .cse7 .cse17) (and .cse18 .cse12 .cse4 .cse19 .cse20) (and .cse21 .cse22 .cse23 .cse7 .cse15) (and .cse8 .cse9 .cse10 .cse11 .cse24 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse13 .cse14 .cse19 .cse2 .cse23) (and .cse24 .cse19 .cse25) (and .cse24 .cse18 .cse26 .cse4 .cse23 .cse20) (and .cse0 .cse27) (and .cse1 .cse28 .cse19 .cse2 .cse7) (and .cse12 .cse1 .cse22 .cse2 .cse23) (and .cse18 .cse4 .cse7 .cse20) (and .cse24 .cse18 .cse26 .cse4 .cse3 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse21 .cse14) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528) .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse17) (and .cse30 .cse1 .cse28 .cse19 .cse2) (and .cse24 .cse1 .cse22 .cse19 .cse2 .cse23) (and .cse31 .cse30 .cse23 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse24 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512) .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse17) (and .cse31 .cse30 .cse3 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse13 .cse5 .cse16 .cse27 .cse14 .cse7 .cse17) (and .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse23 .cse17) (and .cse12 .cse21 .cse22 .cse23 .cse15) (and .cse24 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse22 .cse19 .cse23 .cse15) (and .cse24 .cse6 .cse19) (and .cse1 .cse22 .cse2 .cse23 .cse7) (and .cse12 .cse1 .cse28 .cse19 .cse2) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse27 .cse14) (and .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse27 .cse14 .cse17)))) [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 564) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 575) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 586) no Hoare annotation was computed. [2022-07-22 11:10:17,779 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L489-2(lines 489 493) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 526) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 563) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 574) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 585) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 607) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L895 garLoopResultBuilder]: At program point L525(lines 83 621) the Hoare annotation is: false [2022-07-22 11:10:17,780 INFO L895 garLoopResultBuilder]: At program point L195(lines 191 564) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6))) [2022-07-22 11:10:17,780 INFO L895 garLoopResultBuilder]: At program point L162(lines 158 575) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6))) [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L592(lines 592 606) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 369) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L593(lines 593 598) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L527(lines 527 529) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L593-2(lines 592 606) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L895 garLoopResultBuilder]: At program point L362(lines 338 380) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6))) [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 562) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 573) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 584) no Hoare annotation was computed. [2022-07-22 11:10:17,780 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 11:10:17,781 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2022-07-22 11:10:17,781 INFO L899 garLoopResultBuilder]: For program point L429(lines 429 431) no Hoare annotation was computed. [2022-07-22 11:10:17,781 INFO L895 garLoopResultBuilder]: At program point L396(lines 387 419) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12))) [2022-07-22 11:10:17,781 INFO L895 garLoopResultBuilder]: At program point L132(lines 128 585) the Hoare annotation is: false [2022-07-22 11:10:17,781 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2022-07-22 11:10:17,781 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 366) no Hoare annotation was computed. [2022-07-22 11:10:17,781 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2022-07-22 11:10:17,781 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-07-22 11:10:17,781 INFO L899 garLoopResultBuilder]: For program point L298-2(lines 219 553) no Hoare annotation was computed. [2022-07-22 11:10:17,781 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 336) no Hoare annotation was computed. [2022-07-22 11:10:17,781 INFO L899 garLoopResultBuilder]: For program point L332-2(lines 219 553) no Hoare annotation was computed. [2022-07-22 11:10:17,781 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 561) no Hoare annotation was computed. [2022-07-22 11:10:17,781 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 572) no Hoare annotation was computed. [2022-07-22 11:10:17,781 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 583) no Hoare annotation was computed. [2022-07-22 11:10:17,781 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-07-22 11:10:17,781 INFO L899 garLoopResultBuilder]: For program point L101-1(lines 83 621) no Hoare annotation was computed. [2022-07-22 11:10:17,785 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] [2022-07-22 11:10:17,786 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 11:10:17,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:10:17 BoogieIcfgContainer [2022-07-22 11:10:17,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 11:10:17,813 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 11:10:17,813 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 11:10:17,813 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 11:10:17,814 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:09:53" (3/4) ... [2022-07-22 11:10:17,816 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 11:10:17,826 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-22 11:10:17,827 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-22 11:10:17,828 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 11:10:17,828 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 11:10:17,882 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 11:10:17,882 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 11:10:17,883 INFO L158 Benchmark]: Toolchain (without parser) took 25554.15ms. Allocated memory was 125.8MB in the beginning and 750.8MB in the end (delta: 625.0MB). Free memory was 97.2MB in the beginning and 533.3MB in the end (delta: -436.1MB). Peak memory consumption was 188.3MB. Max. memory is 16.1GB. [2022-07-22 11:10:17,883 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory was 49.4MB in the beginning and 49.3MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:10:17,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.74ms. Allocated memory is still 125.8MB. Free memory was 97.2MB in the beginning and 97.5MB in the end (delta: -306.2kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 11:10:17,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.73ms. Allocated memory is still 125.8MB. Free memory was 97.5MB in the beginning and 94.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 11:10:17,884 INFO L158 Benchmark]: Boogie Preprocessor took 46.44ms. Allocated memory is still 125.8MB. Free memory was 94.7MB in the beginning and 92.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 11:10:17,884 INFO L158 Benchmark]: RCFGBuilder took 597.45ms. Allocated memory is still 125.8MB. Free memory was 92.6MB in the beginning and 100.6MB in the end (delta: -8.0MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2022-07-22 11:10:17,884 INFO L158 Benchmark]: TraceAbstraction took 24454.30ms. Allocated memory was 125.8MB in the beginning and 750.8MB in the end (delta: 625.0MB). Free memory was 100.1MB in the beginning and 541.7MB in the end (delta: -441.6MB). Peak memory consumption was 464.3MB. Max. memory is 16.1GB. [2022-07-22 11:10:17,884 INFO L158 Benchmark]: Witness Printer took 69.57ms. Allocated memory is still 750.8MB. Free memory was 540.6MB in the beginning and 533.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-22 11:10:17,885 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.16ms. Allocated memory is still 92.3MB. Free memory was 49.4MB in the beginning and 49.3MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.74ms. Allocated memory is still 125.8MB. Free memory was 97.2MB in the beginning and 97.5MB in the end (delta: -306.2kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.73ms. Allocated memory is still 125.8MB. Free memory was 97.5MB in the beginning and 94.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.44ms. Allocated memory is still 125.8MB. Free memory was 94.7MB in the beginning and 92.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 597.45ms. Allocated memory is still 125.8MB. Free memory was 92.6MB in the beginning and 100.6MB in the end (delta: -8.0MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24454.30ms. Allocated memory was 125.8MB in the beginning and 750.8MB in the end (delta: 625.0MB). Free memory was 100.1MB in the beginning and 541.7MB in the end (delta: -441.6MB). Peak memory consumption was 464.3MB. Max. memory is 16.1GB. * Witness Printer took 69.57ms. Allocated memory is still 750.8MB. Free memory was 540.6MB in the beginning and 533.3MB 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: 619]: 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, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.4s, OverallIterations: 34, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4953 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4953 mSDsluCounter, 10153 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3407 mSDsCounter, 1020 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4114 IncrementalHoareTripleChecker+Invalid, 5134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1020 mSolverCounterUnsat, 6746 mSDtfsCounter, 4114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3496 GetRequests, 3436 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4524occurred in iteration=27, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 6551 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 235 NumberOfFragments, 3584 HoareAnnotationTreeSize, 28 FomulaSimplifications, 59890 FormulaSimplificationTreeSizeReduction, 6.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 208853 FormulaSimplificationTreeSizeReductionInter, 7.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 8782 NumberOfCodeBlocks, 8782 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 10232 ConstructedInterpolants, 0 QuantifiedInterpolants, 14466 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3095 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 43 InterpolantComputations, 30 PerfectInterpolantSequences, 34894/35202 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: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((!(8448 == s__state) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) || (((((((!(8448 == s__state) && !(s__state == 8481)) && blastFlag == 1) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && 0 == s__hit) && s__state <= 8672)) || ((((((!(8448 == s__state) && !(s__state == 8481)) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && blastFlag == 0) && s__state <= 8672)) || (((((((!(8448 == s__state) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && !(0 == s__hit)) && s__state <= 8672) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state <= 8640) && !(0 == s__hit))) || (8560 == s__state && blastFlag == 0)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || ((((!(s__state == 8657) && blastFlag == 1) && 8640 <= s__state) && 0 == s__hit) && s__state <= 8672)) || ((((!(s__state <= 8496) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && 0 == s__hit) && 8544 == s__state)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (s__s3__tmp__next_state___0 <= 8640 && s__state == 3)) || ((((s__state <= 8448 && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((!(s__state == 8657) && 8640 <= s__state) && blastFlag == 0) && s__state <= 8672)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(s__state <= 8496)) && !(s__state == 8480))) || (((((((((((((s__state == 8528 && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((8672 <= s__state && 3 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state == 8512) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || (((8672 <= s__state && 3 == blastFlag) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && s__state == 3) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || ((((blastFlag == 1 && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (((((2 == blastFlag && 8496 < s__state) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && 8560 == s__state) && 0 == s__hit)) || ((((s__state <= 8448 && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && s__state == 3) && !(s__state == 8480))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && s__state == 3) && !(s__state == 8480)) && !(8560 == s__state)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit)) || ((((s__state <= 8448 && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((((s__state <= 8448 && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((8672 <= s__state && 3 == blastFlag) && !(12292 == s__state)) && s__s3__tmp__next_state___0 <= 8576) || ((8672 <= s__state && !(12292 == s__state)) && blastFlag == 0)) || (((8672 <= s__state && 3 == blastFlag) && !(12292 == s__state)) && !(0 == s__hit))) || (((8672 <= s__state && blastFlag == 1) && !(12292 == s__state)) && 0 == s__hit) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 623]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((((((!(8576 <= s__state) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) || (((((!(8576 <= s__state) && !(s__state == 8545)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0)) || (((((!(8576 <= s__state) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state)) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state < 8656) && !(0 == s__hit)) || ((8640 <= s__state && s__state < 8656) && blastFlag == 0)) || (((2 == blastFlag && 8640 <= s__state) && s__state < 8656) && !(0 == s__hit))) || ((blastFlag == 1 && 8640 <= s__state) && s__state < 8656)) || (((2 == blastFlag && 8640 <= s__state) && s__state < 8656) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state <= 8640) && !(0 == s__hit))) || (8560 == s__state && blastFlag == 0)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || ((((!(s__state == 8657) && blastFlag == 1) && 8640 <= s__state) && 0 == s__hit) && s__state <= 8672)) || ((((!(s__state <= 8496) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && 0 == s__hit) && 8544 == s__state)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (s__s3__tmp__next_state___0 <= 8640 && s__state == 3)) || ((((s__state <= 8448 && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((!(s__state == 8657) && 8640 <= s__state) && blastFlag == 0) && s__state <= 8672)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(s__state <= 8496)) && !(s__state == 8480))) || (((((((((((((s__state == 8528 && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((8672 <= s__state && 3 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state == 8512) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || (((8672 <= s__state && 3 == blastFlag) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && s__state == 3) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || ((((blastFlag == 1 && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (((((2 == blastFlag && 8496 < s__state) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && 8560 == s__state) && 0 == s__hit)) || ((((s__state <= 8448 && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && s__state == 3) && !(s__state == 8480))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && s__state == 3) && !(s__state == 8480)) && !(8560 == s__state)) RESULT: Ultimate proved your program to be correct! [2022-07-22 11:10:17,935 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