./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.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 a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:25:28,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:25:28,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:25:28,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:25:28,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:25:28,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:25:28,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:25:28,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:25:28,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:25:28,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:25:28,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:25:28,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:25:28,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:25:28,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:25:28,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:25:28,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:25:28,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:25:28,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:25:28,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:25:28,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:25:28,241 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:25:28,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:25:28,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:25:28,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:25:28,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:25:28,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:25:28,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:25:28,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:25:28,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:25:28,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:25:28,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:25:28,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:25:28,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:25:28,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:25:28,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:25:28,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:25:28,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:25:28,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:25:28,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:25:28,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:25:28,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:25:28,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:25:28,266 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:25:28,301 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:25:28,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:25:28,302 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:25:28,302 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:25:28,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:25:28,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:25:28,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:25:28,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:25:28,304 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:25:28,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:25:28,305 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:25:28,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:25:28,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:25:28,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:25:28,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:25:28,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:25:28,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:25:28,307 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:25:28,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:25:28,307 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:25:28,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:25:28,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:25:28,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:25:28,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:25:28,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:25:28,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:25:28,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:25:28,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:25:28,310 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:25:28,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:25:28,310 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:25:28,311 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:25:28,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:25:28,311 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 -> a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f [2022-07-13 11:25:28,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:25:28,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:25:28,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:25:28,586 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:25:28,586 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:25:28,587 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2022-07-13 11:25:28,641 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b5c7ca1/bac41114d35c425ea8f65ab10dff1d3a/FLAG53865ca01 [2022-07-13 11:25:29,058 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:25:29,063 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2022-07-13 11:25:29,081 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b5c7ca1/bac41114d35c425ea8f65ab10dff1d3a/FLAG53865ca01 [2022-07-13 11:25:29,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b5c7ca1/bac41114d35c425ea8f65ab10dff1d3a [2022-07-13 11:25:29,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:25:29,436 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:25:29,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:25:29,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:25:29,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:25:29,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:25:29" (1/1) ... [2022-07-13 11:25:29,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28bd4190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:29, skipping insertion in model container [2022-07-13 11:25:29,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:25:29" (1/1) ... [2022-07-13 11:25:29,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:25:29,476 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:25:29,668 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/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2022-07-13 11:25:29,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:25:29,694 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:25:29,743 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/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2022-07-13 11:25:29,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:25:29,756 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:25:29,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:29 WrapperNode [2022-07-13 11:25:29,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:25:29,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:25:29,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:25:29,758 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:25:29,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:29" (1/1) ... [2022-07-13 11:25:29,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:29" (1/1) ... [2022-07-13 11:25:29,817 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 521 [2022-07-13 11:25:29,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:25:29,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:25:29,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:25:29,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:25:29,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:29" (1/1) ... [2022-07-13 11:25:29,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:29" (1/1) ... [2022-07-13 11:25:29,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:29" (1/1) ... [2022-07-13 11:25:29,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:29" (1/1) ... [2022-07-13 11:25:29,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:29" (1/1) ... [2022-07-13 11:25:29,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:29" (1/1) ... [2022-07-13 11:25:29,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:29" (1/1) ... [2022-07-13 11:25:29,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:25:29,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:25:29,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:25:29,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:25:29,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:29" (1/1) ... [2022-07-13 11:25:29,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:25:29,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:25:29,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:25:29,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:25:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:25:29,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:25:29,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:25:29,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:25:30,059 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:25:30,061 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:25:30,077 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:25:30,542 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-13 11:25:30,542 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-13 11:25:30,542 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:25:30,549 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:25:30,549 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:25:30,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:25:30 BoogieIcfgContainer [2022-07-13 11:25:30,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:25:30,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:25:30,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:25:30,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:25:30,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:25:29" (1/3) ... [2022-07-13 11:25:30,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6dd23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:25:30, skipping insertion in model container [2022-07-13 11:25:30,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:29" (2/3) ... [2022-07-13 11:25:30,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6dd23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:25:30, skipping insertion in model container [2022-07-13 11:25:30,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:25:30" (3/3) ... [2022-07-13 11:25:30,561 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2022-07-13 11:25:30,572 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:25:30,573 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:25:30,625 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:25:30,635 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@2b0ec7e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7a904930 [2022-07-13 11:25:30,636 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:25:30,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 138 states have (on average 1.7318840579710144) internal successors, (239), 139 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:25:30,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:30,655 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-13 11:25:30,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:30,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1632000041, now seen corresponding path program 1 times [2022-07-13 11:25:30,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:30,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649722004] [2022-07-13 11:25:30,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:30,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:25:30,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:30,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649722004] [2022-07-13 11:25:30,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649722004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:30,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:30,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:30,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079147026] [2022-07-13 11:25:30,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:30,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:30,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:30,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:30,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:30,951 INFO L87 Difference]: Start difference. First operand has 140 states, 138 states have (on average 1.7318840579710144) internal successors, (239), 139 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 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-13 11:25:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:31,204 INFO L93 Difference]: Finished difference Result 328 states and 565 transitions. [2022-07-13 11:25:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:31,206 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-13 11:25:31,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:31,218 INFO L225 Difference]: With dead ends: 328 [2022-07-13 11:25:31,218 INFO L226 Difference]: Without dead ends: 174 [2022-07-13 11:25:31,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:31,226 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 169 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 192 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.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:31,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 192 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:25:31,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-13 11:25:31,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 168. [2022-07-13 11:25:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.6407185628742516) internal successors, (274), 167 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 274 transitions. [2022-07-13 11:25:31,267 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 274 transitions. Word has length 44 [2022-07-13 11:25:31,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:31,267 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 274 transitions. [2022-07-13 11:25:31,267 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-13 11:25:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 274 transitions. [2022-07-13 11:25:31,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:25:31,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:31,270 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-13 11:25:31,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:25:31,271 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:31,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:31,272 INFO L85 PathProgramCache]: Analyzing trace with hash -954582389, now seen corresponding path program 1 times [2022-07-13 11:25:31,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:31,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178084541] [2022-07-13 11:25:31,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:31,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:25:31,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:31,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178084541] [2022-07-13 11:25:31,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178084541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:31,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:31,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:31,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893857111] [2022-07-13 11:25:31,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:31,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:31,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:31,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:31,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:31,382 INFO L87 Difference]: Start difference. First operand 168 states and 274 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:31,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:31,549 INFO L93 Difference]: Finished difference Result 377 states and 624 transitions. [2022-07-13 11:25:31,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:31,550 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-13 11:25:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:31,554 INFO L225 Difference]: With dead ends: 377 [2022-07-13 11:25:31,554 INFO L226 Difference]: Without dead ends: 215 [2022-07-13 11:25:31,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:31,557 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 128 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 143 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-13 11:25:31,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 143 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:31,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-13 11:25:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 209. [2022-07-13 11:25:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.6875) internal successors, (351), 208 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 351 transitions. [2022-07-13 11:25:31,572 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 351 transitions. Word has length 45 [2022-07-13 11:25:31,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:31,573 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 351 transitions. [2022-07-13 11:25:31,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 351 transitions. [2022-07-13 11:25:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-13 11:25:31,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:31,576 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, 1] [2022-07-13 11:25:31,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:25:31,576 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:31,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:31,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1257706733, now seen corresponding path program 1 times [2022-07-13 11:25:31,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:31,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421947229] [2022-07-13 11:25:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:31,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:31,636 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-13 11:25:31,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:31,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421947229] [2022-07-13 11:25:31,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421947229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:31,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:31,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:31,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926619407] [2022-07-13 11:25:31,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:31,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:31,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:31,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:31,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:31,641 INFO L87 Difference]: Start difference. First operand 209 states and 351 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-13 11:25:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:31,757 INFO L93 Difference]: Finished difference Result 441 states and 748 transitions. [2022-07-13 11:25:31,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:31,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-07-13 11:25:31,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:31,759 INFO L225 Difference]: With dead ends: 441 [2022-07-13 11:25:31,759 INFO L226 Difference]: Without dead ends: 240 [2022-07-13 11:25:31,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:31,761 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 134 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 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-13 11:25:31,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 155 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:31,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-07-13 11:25:31,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2022-07-13 11:25:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.702928870292887) internal successors, (407), 239 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 407 transitions. [2022-07-13 11:25:31,773 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 407 transitions. Word has length 73 [2022-07-13 11:25:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:31,773 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 407 transitions. [2022-07-13 11:25:31,773 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-13 11:25:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 407 transitions. [2022-07-13 11:25:31,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 11:25:31,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:31,776 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-13 11:25:31,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:25:31,777 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:31,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1858309952, now seen corresponding path program 1 times [2022-07-13 11:25:31,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:31,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773713023] [2022-07-13 11:25:31,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:31,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:31,880 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-13 11:25:31,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:31,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773713023] [2022-07-13 11:25:31,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773713023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:31,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:31,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:31,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235158834] [2022-07-13 11:25:31,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:31,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:31,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:31,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:31,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:31,884 INFO L87 Difference]: Start difference. First operand 240 states and 407 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-13 11:25:32,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:32,033 INFO L93 Difference]: Finished difference Result 518 states and 884 transitions. [2022-07-13 11:25:32,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:32,034 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-13 11:25:32,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:32,035 INFO L225 Difference]: With dead ends: 518 [2022-07-13 11:25:32,036 INFO L226 Difference]: Without dead ends: 286 [2022-07-13 11:25:32,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:32,037 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 132 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 143 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-13 11:25:32,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 143 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-13 11:25:32,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2022-07-13 11:25:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 281 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 482 transitions. [2022-07-13 11:25:32,049 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 482 transitions. Word has length 84 [2022-07-13 11:25:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:32,049 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 482 transitions. [2022-07-13 11:25:32,050 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-13 11:25:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 482 transitions. [2022-07-13 11:25:32,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-13 11:25:32,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:32,057 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, 1] [2022-07-13 11:25:32,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:25:32,058 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:32,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:32,060 INFO L85 PathProgramCache]: Analyzing trace with hash -793628611, now seen corresponding path program 1 times [2022-07-13 11:25:32,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:32,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157127294] [2022-07-13 11:25:32,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:32,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:32,095 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-13 11:25:32,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:32,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157127294] [2022-07-13 11:25:32,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157127294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:32,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:32,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:32,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136221324] [2022-07-13 11:25:32,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:32,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:32,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:32,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:32,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:32,098 INFO L87 Difference]: Start difference. First operand 282 states and 482 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-13 11:25:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:32,201 INFO L93 Difference]: Finished difference Result 573 states and 980 transitions. [2022-07-13 11:25:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:32,201 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-13 11:25:32,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:32,203 INFO L225 Difference]: With dead ends: 573 [2022-07-13 11:25:32,204 INFO L226 Difference]: Without dead ends: 299 [2022-07-13 11:25:32,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:32,209 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 157 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 149 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-13 11:25:32,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 149 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:32,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-13 11:25:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2022-07-13 11:25:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.7027027027027026) internal successors, (504), 296 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 504 transitions. [2022-07-13 11:25:32,225 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 504 transitions. Word has length 85 [2022-07-13 11:25:32,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:32,228 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 504 transitions. [2022-07-13 11:25:32,228 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-13 11:25:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 504 transitions. [2022-07-13 11:25:32,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-13 11:25:32,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:32,231 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-13 11:25:32,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:25:32,231 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:32,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:32,237 INFO L85 PathProgramCache]: Analyzing trace with hash -812323390, now seen corresponding path program 1 times [2022-07-13 11:25:32,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:32,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439762537] [2022-07-13 11:25:32,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:32,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:32,321 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-13 11:25:32,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:32,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439762537] [2022-07-13 11:25:32,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439762537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:32,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:32,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:32,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355980413] [2022-07-13 11:25:32,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:32,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:32,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:32,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:32,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:32,326 INFO L87 Difference]: Start difference. First operand 297 states and 504 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-13 11:25:32,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:32,446 INFO L93 Difference]: Finished difference Result 590 states and 1001 transitions. [2022-07-13 11:25:32,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:32,446 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-13 11:25:32,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:32,448 INFO L225 Difference]: With dead ends: 590 [2022-07-13 11:25:32,448 INFO L226 Difference]: Without dead ends: 299 [2022-07-13 11:25:32,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:32,453 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 130 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:32,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 141 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:32,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-13 11:25:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2022-07-13 11:25:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.6972789115646258) internal successors, (499), 294 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 499 transitions. [2022-07-13 11:25:32,469 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 499 transitions. Word has length 85 [2022-07-13 11:25:32,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:32,470 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 499 transitions. [2022-07-13 11:25:32,470 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-13 11:25:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 499 transitions. [2022-07-13 11:25:32,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-13 11:25:32,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:32,471 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, 1] [2022-07-13 11:25:32,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:25:32,472 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:32,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:32,472 INFO L85 PathProgramCache]: Analyzing trace with hash 99695542, now seen corresponding path program 1 times [2022-07-13 11:25:32,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:32,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175803882] [2022-07-13 11:25:32,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:32,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:32,524 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-13 11:25:32,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:32,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175803882] [2022-07-13 11:25:32,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175803882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:32,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:32,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:32,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538199144] [2022-07-13 11:25:32,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:32,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:32,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:32,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:32,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:32,527 INFO L87 Difference]: Start difference. First operand 295 states and 499 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:32,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:32,612 INFO L93 Difference]: Finished difference Result 584 states and 988 transitions. [2022-07-13 11:25:32,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:32,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 86 [2022-07-13 11:25:32,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:32,614 INFO L225 Difference]: With dead ends: 584 [2022-07-13 11:25:32,614 INFO L226 Difference]: Without dead ends: 297 [2022-07-13 11:25:32,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:32,617 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 156 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 137 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-13 11:25:32,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 137 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:32,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-13 11:25:32,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2022-07-13 11:25:32,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.683673469387755) internal successors, (495), 294 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 495 transitions. [2022-07-13 11:25:32,627 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 495 transitions. Word has length 86 [2022-07-13 11:25:32,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:32,628 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 495 transitions. [2022-07-13 11:25:32,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 495 transitions. [2022-07-13 11:25:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-13 11:25:32,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:32,630 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, 1] [2022-07-13 11:25:32,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:25:32,630 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:32,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:32,631 INFO L85 PathProgramCache]: Analyzing trace with hash -247819138, now seen corresponding path program 1 times [2022-07-13 11:25:32,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:32,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007215580] [2022-07-13 11:25:32,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:32,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:32,694 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-13 11:25:32,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:32,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007215580] [2022-07-13 11:25:32,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007215580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:32,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:32,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:32,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463821309] [2022-07-13 11:25:32,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:32,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:32,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:32,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:32,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:32,698 INFO L87 Difference]: Start difference. First operand 295 states and 495 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:32,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:32,774 INFO L93 Difference]: Finished difference Result 590 states and 989 transitions. [2022-07-13 11:25:32,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:32,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-13 11:25:32,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:32,776 INFO L225 Difference]: With dead ends: 590 [2022-07-13 11:25:32,777 INFO L226 Difference]: Without dead ends: 303 [2022-07-13 11:25:32,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:32,778 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 161 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 147 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-13 11:25:32,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 147 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-13 11:25:32,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2022-07-13 11:25:32,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.6556291390728477) internal successors, (500), 302 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 500 transitions. [2022-07-13 11:25:32,787 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 500 transitions. Word has length 98 [2022-07-13 11:25:32,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:32,787 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 500 transitions. [2022-07-13 11:25:32,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:32,788 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 500 transitions. [2022-07-13 11:25:32,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 11:25:32,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:32,789 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, 1] [2022-07-13 11:25:32,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:25:32,789 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:32,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:32,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1134276038, now seen corresponding path program 1 times [2022-07-13 11:25:32,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:32,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666676413] [2022-07-13 11:25:32,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:32,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:32,816 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-13 11:25:32,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:32,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666676413] [2022-07-13 11:25:32,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666676413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:32,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:32,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:32,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958166016] [2022-07-13 11:25:32,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:32,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:32,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:32,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:32,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:32,819 INFO L87 Difference]: Start difference. First operand 303 states and 500 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-13 11:25:32,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:32,921 INFO L93 Difference]: Finished difference Result 629 states and 1041 transitions. [2022-07-13 11:25:32,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:32,922 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-13 11:25:32,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:32,923 INFO L225 Difference]: With dead ends: 629 [2022-07-13 11:25:32,924 INFO L226 Difference]: Without dead ends: 334 [2022-07-13 11:25:32,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:32,925 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 140 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-13 11:25:32,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 140 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:32,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-07-13 11:25:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2022-07-13 11:25:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.6525679758308156) internal successors, (547), 331 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 547 transitions. [2022-07-13 11:25:32,935 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 547 transitions. Word has length 99 [2022-07-13 11:25:32,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:32,935 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 547 transitions. [2022-07-13 11:25:32,935 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-13 11:25:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 547 transitions. [2022-07-13 11:25:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 11:25:32,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:32,937 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-13 11:25:32,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 11:25:32,937 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:32,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:32,938 INFO L85 PathProgramCache]: Analyzing trace with hash -85258053, now seen corresponding path program 1 times [2022-07-13 11:25:32,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:32,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546028842] [2022-07-13 11:25:32,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:32,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:32,975 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-13 11:25:32,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:32,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546028842] [2022-07-13 11:25:32,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546028842] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:32,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:32,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:32,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375490141] [2022-07-13 11:25:32,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:32,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:32,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:32,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:32,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:32,978 INFO L87 Difference]: Start difference. First operand 332 states and 547 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-13 11:25:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:33,088 INFO L93 Difference]: Finished difference Result 690 states and 1141 transitions. [2022-07-13 11:25:33,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:33,089 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-13 11:25:33,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:33,090 INFO L225 Difference]: With dead ends: 690 [2022-07-13 11:25:33,090 INFO L226 Difference]: Without dead ends: 366 [2022-07-13 11:25:33,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:33,092 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 142 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 147 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-13 11:25:33,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 147 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:33,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-07-13 11:25:33,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 359. [2022-07-13 11:25:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.6452513966480447) internal successors, (589), 358 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 589 transitions. [2022-07-13 11:25:33,102 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 589 transitions. Word has length 100 [2022-07-13 11:25:33,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:33,103 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 589 transitions. [2022-07-13 11:25:33,103 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-13 11:25:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 589 transitions. [2022-07-13 11:25:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 11:25:33,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:33,105 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, 1] [2022-07-13 11:25:33,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:25:33,105 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:33,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:33,106 INFO L85 PathProgramCache]: Analyzing trace with hash 149056915, now seen corresponding path program 1 times [2022-07-13 11:25:33,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:33,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669101541] [2022-07-13 11:25:33,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:33,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:33,149 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-13 11:25:33,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:33,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669101541] [2022-07-13 11:25:33,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669101541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:33,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:33,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:33,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762092640] [2022-07-13 11:25:33,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:33,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:33,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:33,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:33,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:33,152 INFO L87 Difference]: Start difference. First operand 359 states and 589 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-13 11:25:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:33,254 INFO L93 Difference]: Finished difference Result 712 states and 1168 transitions. [2022-07-13 11:25:33,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:33,255 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-13 11:25:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:33,257 INFO L225 Difference]: With dead ends: 712 [2022-07-13 11:25:33,257 INFO L226 Difference]: Without dead ends: 361 [2022-07-13 11:25:33,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-13 11:25:33,258 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 139 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 140 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-13 11:25:33,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 140 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-07-13 11:25:33,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 359. [2022-07-13 11:25:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.6340782122905029) internal successors, (585), 358 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 585 transitions. [2022-07-13 11:25:33,269 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 585 transitions. Word has length 100 [2022-07-13 11:25:33,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:33,269 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 585 transitions. [2022-07-13 11:25:33,269 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-13 11:25:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 585 transitions. [2022-07-13 11:25:33,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 11:25:33,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:33,271 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-13 11:25:33,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:25:33,271 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:33,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:33,272 INFO L85 PathProgramCache]: Analyzing trace with hash -692060190, now seen corresponding path program 1 times [2022-07-13 11:25:33,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:33,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473744705] [2022-07-13 11:25:33,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:33,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:33,307 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-13 11:25:33,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:33,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473744705] [2022-07-13 11:25:33,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473744705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:33,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:33,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:33,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377337017] [2022-07-13 11:25:33,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:33,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:33,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:33,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:33,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:33,310 INFO L87 Difference]: Start difference. First operand 359 states and 585 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-13 11:25:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:33,414 INFO L93 Difference]: Finished difference Result 717 states and 1170 transitions. [2022-07-13 11:25:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:33,415 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-13 11:25:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:33,416 INFO L225 Difference]: With dead ends: 717 [2022-07-13 11:25:33,416 INFO L226 Difference]: Without dead ends: 366 [2022-07-13 11:25:33,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-13 11:25:33,418 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 141 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 147 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-13 11:25:33,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 147 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:33,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-07-13 11:25:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 359. [2022-07-13 11:25:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.6201117318435754) internal successors, (580), 358 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 580 transitions. [2022-07-13 11:25:33,429 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 580 transitions. Word has length 101 [2022-07-13 11:25:33,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:33,430 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 580 transitions. [2022-07-13 11:25:33,430 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-13 11:25:33,430 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 580 transitions. [2022-07-13 11:25:33,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-13 11:25:33,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:33,432 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-13 11:25:33,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:25:33,432 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:33,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:33,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1838364151, now seen corresponding path program 1 times [2022-07-13 11:25:33,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:33,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615361411] [2022-07-13 11:25:33,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:33,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:33,470 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-13 11:25:33,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:33,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615361411] [2022-07-13 11:25:33,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615361411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:33,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:33,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:33,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204643520] [2022-07-13 11:25:33,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:33,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:33,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:33,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:33,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:33,473 INFO L87 Difference]: Start difference. First operand 359 states and 580 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-13 11:25:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:33,565 INFO L93 Difference]: Finished difference Result 735 states and 1189 transitions. [2022-07-13 11:25:33,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:33,566 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-13 11:25:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:33,568 INFO L225 Difference]: With dead ends: 735 [2022-07-13 11:25:33,568 INFO L226 Difference]: Without dead ends: 384 [2022-07-13 11:25:33,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:33,570 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 148 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 143 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-13 11:25:33,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 143 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:33,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-07-13 11:25:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 380. [2022-07-13 11:25:33,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 1.6068601583113455) internal successors, (609), 379 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 609 transitions. [2022-07-13 11:25:33,583 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 609 transitions. Word has length 105 [2022-07-13 11:25:33,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:33,584 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 609 transitions. [2022-07-13 11:25:33,584 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-13 11:25:33,584 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 609 transitions. [2022-07-13 11:25:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 11:25:33,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:33,586 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-13 11:25:33,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:25:33,586 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:33,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:33,587 INFO L85 PathProgramCache]: Analyzing trace with hash 759513378, now seen corresponding path program 1 times [2022-07-13 11:25:33,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:33,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296457352] [2022-07-13 11:25:33,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:33,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:33,621 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-13 11:25:33,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:33,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296457352] [2022-07-13 11:25:33,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296457352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:33,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:33,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:33,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273590242] [2022-07-13 11:25:33,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:33,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:33,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:33,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:33,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:33,623 INFO L87 Difference]: Start difference. First operand 380 states and 609 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-13 11:25:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:33,710 INFO L93 Difference]: Finished difference Result 756 states and 1212 transitions. [2022-07-13 11:25:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:33,711 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-13 11:25:33,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:33,713 INFO L225 Difference]: With dead ends: 756 [2022-07-13 11:25:33,713 INFO L226 Difference]: Without dead ends: 384 [2022-07-13 11:25:33,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:33,715 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 147 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 143 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-13 11:25:33,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 143 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-07-13 11:25:33,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 380. [2022-07-13 11:25:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 1.5910290237467017) internal successors, (603), 379 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 603 transitions. [2022-07-13 11:25:33,726 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 603 transitions. Word has length 106 [2022-07-13 11:25:33,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:33,727 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 603 transitions. [2022-07-13 11:25:33,727 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-13 11:25:33,727 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 603 transitions. [2022-07-13 11:25:33,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 11:25:33,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:33,729 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-13 11:25:33,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:25:33,729 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:33,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:33,729 INFO L85 PathProgramCache]: Analyzing trace with hash 112174862, now seen corresponding path program 1 times [2022-07-13 11:25:33,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:33,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062952230] [2022-07-13 11:25:33,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:33,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:33,763 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-13 11:25:33,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:33,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062952230] [2022-07-13 11:25:33,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062952230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:33,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:33,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:33,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816407744] [2022-07-13 11:25:33,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:33,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:33,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:33,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:33,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:33,765 INFO L87 Difference]: Start difference. First operand 380 states and 603 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-13 11:25:33,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:33,800 INFO L93 Difference]: Finished difference Result 1118 states and 1779 transitions. [2022-07-13 11:25:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:33,801 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-13 11:25:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:33,803 INFO L225 Difference]: With dead ends: 1118 [2022-07-13 11:25:33,804 INFO L226 Difference]: Without dead ends: 746 [2022-07-13 11:25:33,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:33,805 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 131 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:33,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 531 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:25:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-07-13 11:25:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2022-07-13 11:25:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 1.5865771812080538) internal successors, (1182), 745 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:33,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1182 transitions. [2022-07-13 11:25:33,825 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1182 transitions. Word has length 121 [2022-07-13 11:25:33,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:33,825 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 1182 transitions. [2022-07-13 11:25:33,825 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-13 11:25:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1182 transitions. [2022-07-13 11:25:33,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 11:25:33,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:33,827 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-13 11:25:33,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 11:25:33,828 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:33,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:33,828 INFO L85 PathProgramCache]: Analyzing trace with hash -785218416, now seen corresponding path program 1 times [2022-07-13 11:25:33,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:33,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429251062] [2022-07-13 11:25:33,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:33,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:33,865 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-13 11:25:33,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:33,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429251062] [2022-07-13 11:25:33,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429251062] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:33,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:33,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:33,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485615220] [2022-07-13 11:25:33,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:33,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:33,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:33,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:33,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:33,867 INFO L87 Difference]: Start difference. First operand 746 states and 1182 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:33,908 INFO L93 Difference]: Finished difference Result 1810 states and 2873 transitions. [2022-07-13 11:25:33,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:33,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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-13 11:25:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:33,913 INFO L225 Difference]: With dead ends: 1810 [2022-07-13 11:25:33,913 INFO L226 Difference]: Without dead ends: 1072 [2022-07-13 11:25:33,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:33,914 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 133 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:33,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 536 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:25:33,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2022-07-13 11:25:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2022-07-13 11:25:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.584500466853408) internal successors, (1697), 1071 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1697 transitions. [2022-07-13 11:25:33,946 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1697 transitions. Word has length 121 [2022-07-13 11:25:33,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:33,947 INFO L495 AbstractCegarLoop]: Abstraction has 1072 states and 1697 transitions. [2022-07-13 11:25:33,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:33,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1697 transitions. [2022-07-13 11:25:33,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 11:25:33,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:33,949 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-13 11:25:33,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:25:33,950 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:33,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:33,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1630617934, now seen corresponding path program 1 times [2022-07-13 11:25:33,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:33,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500030760] [2022-07-13 11:25:33,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:33,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:33,974 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-13 11:25:33,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:33,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500030760] [2022-07-13 11:25:33,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500030760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:33,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:33,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:33,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027801187] [2022-07-13 11:25:33,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:33,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:33,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:33,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:33,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:33,977 INFO L87 Difference]: Start difference. First operand 1072 states and 1697 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:34,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:34,026 INFO L93 Difference]: Finished difference Result 2502 states and 3967 transitions. [2022-07-13 11:25:34,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:34,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-13 11:25:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:34,032 INFO L225 Difference]: With dead ends: 2502 [2022-07-13 11:25:34,032 INFO L226 Difference]: Without dead ends: 1438 [2022-07-13 11:25:34,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:34,034 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 153 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:34,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 539 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:25:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2022-07-13 11:25:34,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1438. [2022-07-13 11:25:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1437 states have (on average 1.5838552540013917) internal successors, (2276), 1437 states have internal predecessors, (2276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2276 transitions. [2022-07-13 11:25:34,074 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2276 transitions. Word has length 121 [2022-07-13 11:25:34,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:34,075 INFO L495 AbstractCegarLoop]: Abstraction has 1438 states and 2276 transitions. [2022-07-13 11:25:34,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:34,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2276 transitions. [2022-07-13 11:25:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 11:25:34,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:34,078 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-13 11:25:34,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:25:34,079 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:34,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:34,079 INFO L85 PathProgramCache]: Analyzing trace with hash -402776112, now seen corresponding path program 1 times [2022-07-13 11:25:34,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:34,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600113994] [2022-07-13 11:25:34,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:34,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:34,101 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-13 11:25:34,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:34,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600113994] [2022-07-13 11:25:34,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600113994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:34,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:34,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:34,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348541469] [2022-07-13 11:25:34,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:34,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:34,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:34,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:34,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:34,104 INFO L87 Difference]: Start difference. First operand 1438 states and 2276 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-13 11:25:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:34,165 INFO L93 Difference]: Finished difference Result 3216 states and 5094 transitions. [2022-07-13 11:25:34,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:34,166 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 121 [2022-07-13 11:25:34,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:34,173 INFO L225 Difference]: With dead ends: 3216 [2022-07-13 11:25:34,173 INFO L226 Difference]: Without dead ends: 1786 [2022-07-13 11:25:34,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:34,176 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 168 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:34,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 384 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:25:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2022-07-13 11:25:34,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1786. [2022-07-13 11:25:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1785 states have (on average 1.5820728291316526) internal successors, (2824), 1785 states have internal predecessors, (2824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2824 transitions. [2022-07-13 11:25:34,229 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2824 transitions. Word has length 121 [2022-07-13 11:25:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:34,229 INFO L495 AbstractCegarLoop]: Abstraction has 1786 states and 2824 transitions. [2022-07-13 11:25:34,229 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-13 11:25:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2824 transitions. [2022-07-13 11:25:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-13 11:25:34,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:34,235 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-13 11:25:34,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 11:25:34,235 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:34,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1734442991, now seen corresponding path program 1 times [2022-07-13 11:25:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:34,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082050347] [2022-07-13 11:25:34,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-13 11:25:34,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:34,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082050347] [2022-07-13 11:25:34,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082050347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:34,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:34,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:34,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243272794] [2022-07-13 11:25:34,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:34,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:34,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:34,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:34,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:34,280 INFO L87 Difference]: Start difference. First operand 1786 states and 2824 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-13 11:25:34,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:34,424 INFO L93 Difference]: Finished difference Result 3609 states and 5691 transitions. [2022-07-13 11:25:34,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:34,425 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 199 [2022-07-13 11:25:34,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:34,432 INFO L225 Difference]: With dead ends: 3609 [2022-07-13 11:25:34,432 INFO L226 Difference]: Without dead ends: 1831 [2022-07-13 11:25:34,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:34,435 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 31 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 293 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-13 11:25:34,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 293 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:34,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2022-07-13 11:25:34,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1786. [2022-07-13 11:25:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1785 states have (on average 1.5417366946778712) internal successors, (2752), 1785 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:34,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2752 transitions. [2022-07-13 11:25:34,500 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2752 transitions. Word has length 199 [2022-07-13 11:25:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:34,501 INFO L495 AbstractCegarLoop]: Abstraction has 1786 states and 2752 transitions. [2022-07-13 11:25:34,501 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-13 11:25:34,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2752 transitions. [2022-07-13 11:25:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-13 11:25:34,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:34,506 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:34,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 11:25:34,507 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:34,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:34,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1755025745, now seen corresponding path program 1 times [2022-07-13 11:25:34,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:34,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322057639] [2022-07-13 11:25:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:34,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:34,544 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-07-13 11:25:34,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:34,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322057639] [2022-07-13 11:25:34,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322057639] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:34,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:34,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:34,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776177734] [2022-07-13 11:25:34,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:34,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:34,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:34,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:34,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:34,546 INFO L87 Difference]: Start difference. First operand 1786 states and 2752 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:34,696 INFO L93 Difference]: Finished difference Result 3631 states and 5570 transitions. [2022-07-13 11:25:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:34,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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-13 11:25:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:34,704 INFO L225 Difference]: With dead ends: 3631 [2022-07-13 11:25:34,704 INFO L226 Difference]: Without dead ends: 1853 [2022-07-13 11:25:34,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:34,707 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 151 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 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-13 11:25:34,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 163 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:34,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2022-07-13 11:25:34,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1786. [2022-07-13 11:25:34,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1785 states have (on average 1.4991596638655462) internal successors, (2676), 1785 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2676 transitions. [2022-07-13 11:25:34,758 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2676 transitions. Word has length 213 [2022-07-13 11:25:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:34,758 INFO L495 AbstractCegarLoop]: Abstraction has 1786 states and 2676 transitions. [2022-07-13 11:25:34,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2676 transitions. [2022-07-13 11:25:34,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-07-13 11:25:34,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:34,771 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, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1] [2022-07-13 11:25:34,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 11:25:34,771 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:34,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:34,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1319004722, now seen corresponding path program 1 times [2022-07-13 11:25:34,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:34,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440872246] [2022-07-13 11:25:34,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:34,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-13 11:25:34,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:34,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440872246] [2022-07-13 11:25:34,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440872246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:34,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:34,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:34,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152488672] [2022-07-13 11:25:34,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:34,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:34,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:34,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:34,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:34,818 INFO L87 Difference]: Start difference. First operand 1786 states and 2676 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:34,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:34,947 INFO L93 Difference]: Finished difference Result 3564 states and 5340 transitions. [2022-07-13 11:25:34,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:34,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 242 [2022-07-13 11:25:34,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:34,954 INFO L225 Difference]: With dead ends: 3564 [2022-07-13 11:25:34,954 INFO L226 Difference]: Without dead ends: 1786 [2022-07-13 11:25:34,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:34,957 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 15 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:34,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 298 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:34,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2022-07-13 11:25:35,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1786. [2022-07-13 11:25:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1785 states have (on average 1.4683473389355741) internal successors, (2621), 1785 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2621 transitions. [2022-07-13 11:25:35,008 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2621 transitions. Word has length 242 [2022-07-13 11:25:35,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:35,009 INFO L495 AbstractCegarLoop]: Abstraction has 1786 states and 2621 transitions. [2022-07-13 11:25:35,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2621 transitions. [2022-07-13 11:25:35,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-13 11:25:35,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:35,015 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:35,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 11:25:35,015 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:35,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:35,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1829254476, now seen corresponding path program 1 times [2022-07-13 11:25:35,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:35,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072967793] [2022-07-13 11:25:35,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:35,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-07-13 11:25:35,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:35,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072967793] [2022-07-13 11:25:35,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072967793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:35,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:35,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:35,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269135694] [2022-07-13 11:25:35,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:35,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:35,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:35,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:35,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:35,078 INFO L87 Difference]: Start difference. First operand 1786 states and 2621 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-13 11:25:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:35,160 INFO L93 Difference]: Finished difference Result 5246 states and 7697 transitions. [2022-07-13 11:25:35,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:35,162 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 271 [2022-07-13 11:25:35,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:35,174 INFO L225 Difference]: With dead ends: 5246 [2022-07-13 11:25:35,175 INFO L226 Difference]: Without dead ends: 3468 [2022-07-13 11:25:35,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:35,178 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 120 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 537 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-13 11:25:35,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 537 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:25:35,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2022-07-13 11:25:35,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3466. [2022-07-13 11:25:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3466 states, 3465 states have (on average 1.4643578643578643) internal successors, (5074), 3465 states have internal predecessors, (5074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 3466 states and 5074 transitions. [2022-07-13 11:25:35,302 INFO L78 Accepts]: Start accepts. Automaton has 3466 states and 5074 transitions. Word has length 271 [2022-07-13 11:25:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:35,302 INFO L495 AbstractCegarLoop]: Abstraction has 3466 states and 5074 transitions. [2022-07-13 11:25:35,303 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-13 11:25:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3466 states and 5074 transitions. [2022-07-13 11:25:35,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-07-13 11:25:35,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:35,313 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 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] [2022-07-13 11:25:35,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 11:25:35,314 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:35,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:35,314 INFO L85 PathProgramCache]: Analyzing trace with hash -86423524, now seen corresponding path program 1 times [2022-07-13 11:25:35,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:35,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678850017] [2022-07-13 11:25:35,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:35,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 524 proven. 66 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2022-07-13 11:25:35,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:35,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678850017] [2022-07-13 11:25:35,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678850017] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:25:35,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796900808] [2022-07-13 11:25:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:35,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:25:35,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:25:35,387 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:25:35,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:25:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:35,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:25:35,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:25:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-07-13 11:25:35,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:25:35,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796900808] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:35,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:25:35,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-13 11:25:35,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467070272] [2022-07-13 11:25:35,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:35,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:35,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:35,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:35,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:25:35,618 INFO L87 Difference]: Start difference. First operand 3466 states and 5074 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:35,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:35,831 INFO L93 Difference]: Finished difference Result 7314 states and 10746 transitions. [2022-07-13 11:25:35,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:35,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 308 [2022-07-13 11:25:35,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:35,839 INFO L225 Difference]: With dead ends: 7314 [2022-07-13 11:25:35,839 INFO L226 Difference]: Without dead ends: 2093 [2022-07-13 11:25:35,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:25:35,870 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 30 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:35,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 294 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:35,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2022-07-13 11:25:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 2093. [2022-07-13 11:25:35,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 2092 states have (on average 1.4445506692160612) internal successors, (3022), 2092 states have internal predecessors, (3022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 3022 transitions. [2022-07-13 11:25:35,928 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 3022 transitions. Word has length 308 [2022-07-13 11:25:35,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:35,928 INFO L495 AbstractCegarLoop]: Abstraction has 2093 states and 3022 transitions. [2022-07-13 11:25:35,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:35,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 3022 transitions. [2022-07-13 11:25:35,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-07-13 11:25:35,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:35,934 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:35,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 11:25:36,147 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,SelfDestructingSolverStorable22 [2022-07-13 11:25:36,147 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:36,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:36,148 INFO L85 PathProgramCache]: Analyzing trace with hash 680434908, now seen corresponding path program 1 times [2022-07-13 11:25:36,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:36,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106667770] [2022-07-13 11:25:36,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:36,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2022-07-13 11:25:36,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:36,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106667770] [2022-07-13 11:25:36,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106667770] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:36,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:36,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:36,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673148658] [2022-07-13 11:25:36,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:36,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:36,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:36,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:36,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:36,190 INFO L87 Difference]: Start difference. First operand 2093 states and 3022 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-13 11:25:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:36,330 INFO L93 Difference]: Finished difference Result 4288 states and 6192 transitions. [2022-07-13 11:25:36,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:36,330 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 309 [2022-07-13 11:25:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:36,338 INFO L225 Difference]: With dead ends: 4288 [2022-07-13 11:25:36,338 INFO L226 Difference]: Without dead ends: 2203 [2022-07-13 11:25:36,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:36,341 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:36,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 303 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2022-07-13 11:25:36,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 2185. [2022-07-13 11:25:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2185 states, 2184 states have (on average 1.434981684981685) internal successors, (3134), 2184 states have internal predecessors, (3134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 3134 transitions. [2022-07-13 11:25:36,429 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 3134 transitions. Word has length 309 [2022-07-13 11:25:36,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:36,430 INFO L495 AbstractCegarLoop]: Abstraction has 2185 states and 3134 transitions. [2022-07-13 11:25:36,430 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-13 11:25:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 3134 transitions. [2022-07-13 11:25:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2022-07-13 11:25:36,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:36,438 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:36,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 11:25:36,438 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:36,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1286812022, now seen corresponding path program 1 times [2022-07-13 11:25:36,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:36,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68682938] [2022-07-13 11:25:36,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:36,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2022-07-13 11:25:36,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:36,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68682938] [2022-07-13 11:25:36,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68682938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:36,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:36,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:36,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958738888] [2022-07-13 11:25:36,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:36,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:36,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:36,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:36,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:36,487 INFO L87 Difference]: Start difference. First operand 2185 states and 3134 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:36,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:36,633 INFO L93 Difference]: Finished difference Result 4584 states and 6604 transitions. [2022-07-13 11:25:36,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:36,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 329 [2022-07-13 11:25:36,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:36,652 INFO L225 Difference]: With dead ends: 4584 [2022-07-13 11:25:36,652 INFO L226 Difference]: Without dead ends: 2407 [2022-07-13 11:25:36,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:36,656 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 28 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:36,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 303 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2022-07-13 11:25:36,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 2335. [2022-07-13 11:25:36,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2334 states have (on average 1.4198800342759212) internal successors, (3314), 2334 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3314 transitions. [2022-07-13 11:25:36,751 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3314 transitions. Word has length 329 [2022-07-13 11:25:36,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:36,752 INFO L495 AbstractCegarLoop]: Abstraction has 2335 states and 3314 transitions. [2022-07-13 11:25:36,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3314 transitions. [2022-07-13 11:25:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2022-07-13 11:25:36,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:36,760 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:36,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 11:25:36,760 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:36,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1749162466, now seen corresponding path program 1 times [2022-07-13 11:25:36,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:36,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612919877] [2022-07-13 11:25:36,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:36,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2022-07-13 11:25:36,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:36,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612919877] [2022-07-13 11:25:36,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612919877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:36,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:36,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:36,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400396955] [2022-07-13 11:25:36,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:36,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:36,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:36,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:36,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:36,810 INFO L87 Difference]: Start difference. First operand 2335 states and 3314 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:36,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:36,961 INFO L93 Difference]: Finished difference Result 4704 states and 6688 transitions. [2022-07-13 11:25:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:36,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2022-07-13 11:25:36,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:36,967 INFO L225 Difference]: With dead ends: 4704 [2022-07-13 11:25:36,967 INFO L226 Difference]: Without dead ends: 2377 [2022-07-13 11:25:36,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:36,970 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 18 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:36,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 302 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:36,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2022-07-13 11:25:37,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 2335. [2022-07-13 11:25:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2334 states have (on average 1.3941730934018852) internal successors, (3254), 2334 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3254 transitions. [2022-07-13 11:25:37,034 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3254 transitions. Word has length 355 [2022-07-13 11:25:37,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:37,035 INFO L495 AbstractCegarLoop]: Abstraction has 2335 states and 3254 transitions. [2022-07-13 11:25:37,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3254 transitions. [2022-07-13 11:25:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2022-07-13 11:25:37,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:37,054 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:37,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 11:25:37,054 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:37,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:37,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1520948552, now seen corresponding path program 1 times [2022-07-13 11:25:37,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:37,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011620295] [2022-07-13 11:25:37,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:37,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-07-13 11:25:37,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:37,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011620295] [2022-07-13 11:25:37,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011620295] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:25:37,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505210341] [2022-07-13 11:25:37,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:37,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:25:37,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:25:37,130 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-13 11:25:37,158 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-13 11:25:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:37,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:25:37,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:25:37,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-07-13 11:25:37,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:25:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-07-13 11:25:37,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505210341] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:25:37,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:25:37,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-13 11:25:37,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873186841] [2022-07-13 11:25:37,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:25:37,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:25:37,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:37,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:25:37,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:25:37,486 INFO L87 Difference]: Start difference. First operand 2335 states and 3254 transitions. Second operand has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:38,041 INFO L93 Difference]: Finished difference Result 6151 states and 8571 transitions. [2022-07-13 11:25:38,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:25:38,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 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 373 [2022-07-13 11:25:38,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:38,049 INFO L225 Difference]: With dead ends: 6151 [2022-07-13 11:25:38,050 INFO L226 Difference]: Without dead ends: 3686 [2022-07-13 11:25:38,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:25:38,054 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 652 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:38,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 609 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:25:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2022-07-13 11:25:38,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 2368. [2022-07-13 11:25:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2367 states have (on average 1.373891001267427) internal successors, (3252), 2367 states have internal predecessors, (3252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3252 transitions. [2022-07-13 11:25:38,145 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3252 transitions. Word has length 373 [2022-07-13 11:25:38,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:38,145 INFO L495 AbstractCegarLoop]: Abstraction has 2368 states and 3252 transitions. [2022-07-13 11:25:38,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3252 transitions. [2022-07-13 11:25:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-07-13 11:25:38,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:38,154 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 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, 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-13 11:25:38,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-13 11:25:38,375 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,SelfDestructingSolverStorable26 [2022-07-13 11:25:38,375 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:38,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:38,376 INFO L85 PathProgramCache]: Analyzing trace with hash 486776898, now seen corresponding path program 1 times [2022-07-13 11:25:38,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:38,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736403156] [2022-07-13 11:25:38,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:38,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2022-07-13 11:25:38,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:38,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736403156] [2022-07-13 11:25:38,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736403156] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:38,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:38,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:38,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842989258] [2022-07-13 11:25:38,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:38,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:38,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:38,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:38,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:38,437 INFO L87 Difference]: Start difference. First operand 2368 states and 3252 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:38,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:38,590 INFO L93 Difference]: Finished difference Result 4740 states and 6504 transitions. [2022-07-13 11:25:38,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:38,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 440 [2022-07-13 11:25:38,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:38,595 INFO L225 Difference]: With dead ends: 4740 [2022-07-13 11:25:38,595 INFO L226 Difference]: Without dead ends: 2380 [2022-07-13 11:25:38,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:38,598 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:38,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2022-07-13 11:25:38,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2368. [2022-07-13 11:25:38,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2367 states have (on average 1.3485424588086186) internal successors, (3192), 2367 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3192 transitions. [2022-07-13 11:25:38,665 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3192 transitions. Word has length 440 [2022-07-13 11:25:38,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:38,666 INFO L495 AbstractCegarLoop]: Abstraction has 2368 states and 3192 transitions. [2022-07-13 11:25:38,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:38,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3192 transitions. [2022-07-13 11:25:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2022-07-13 11:25:38,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:38,675 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 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, 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-13 11:25:38,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 11:25:38,676 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:38,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:38,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1777333080, now seen corresponding path program 1 times [2022-07-13 11:25:38,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:38,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355230653] [2022-07-13 11:25:38,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:38,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:38,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2339 backedges. 1324 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2022-07-13 11:25:38,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:38,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355230653] [2022-07-13 11:25:38,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355230653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:38,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:38,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:38,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901830040] [2022-07-13 11:25:38,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:38,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:38,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:38,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:38,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:38,760 INFO L87 Difference]: Start difference. First operand 2368 states and 3192 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:38,909 INFO L93 Difference]: Finished difference Result 4944 states and 6690 transitions. [2022-07-13 11:25:38,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:38,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 473 [2022-07-13 11:25:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:38,914 INFO L225 Difference]: With dead ends: 4944 [2022-07-13 11:25:38,915 INFO L226 Difference]: Without dead ends: 2584 [2022-07-13 11:25:38,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:38,918 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:38,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 291 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584 states. [2022-07-13 11:25:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584 to 2572. [2022-07-13 11:25:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 2571 states have (on average 1.3325554259043173) internal successors, (3426), 2571 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 3426 transitions. [2022-07-13 11:25:38,985 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 3426 transitions. Word has length 473 [2022-07-13 11:25:38,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:38,986 INFO L495 AbstractCegarLoop]: Abstraction has 2572 states and 3426 transitions. [2022-07-13 11:25:38,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 3426 transitions. [2022-07-13 11:25:38,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2022-07-13 11:25:38,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:38,992 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, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:38,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 11:25:38,993 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:38,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:38,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1857511408, now seen corresponding path program 1 times [2022-07-13 11:25:38,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:38,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248902101] [2022-07-13 11:25:38,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:38,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3104 backedges. 1761 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2022-07-13 11:25:39,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:39,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248902101] [2022-07-13 11:25:39,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248902101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:39,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:39,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:39,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054832109] [2022-07-13 11:25:39,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:39,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:39,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:39,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:39,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:39,066 INFO L87 Difference]: Start difference. First operand 2572 states and 3426 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:39,236 INFO L93 Difference]: Finished difference Result 5364 states and 7182 transitions. [2022-07-13 11:25:39,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:39,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 535 [2022-07-13 11:25:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:39,241 INFO L225 Difference]: With dead ends: 5364 [2022-07-13 11:25:39,241 INFO L226 Difference]: Without dead ends: 2800 [2022-07-13 11:25:39,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:39,244 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:39,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 291 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:39,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2022-07-13 11:25:39,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2788. [2022-07-13 11:25:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2788 states, 2787 states have (on average 1.317545748116254) internal successors, (3672), 2787 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3672 transitions. [2022-07-13 11:25:39,313 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3672 transitions. Word has length 535 [2022-07-13 11:25:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:39,314 INFO L495 AbstractCegarLoop]: Abstraction has 2788 states and 3672 transitions. [2022-07-13 11:25:39,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3672 transitions. [2022-07-13 11:25:39,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2022-07-13 11:25:39,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:39,323 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, 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-13 11:25:39,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-13 11:25:39,323 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:39,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:39,324 INFO L85 PathProgramCache]: Analyzing trace with hash -145524280, now seen corresponding path program 1 times [2022-07-13 11:25:39,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:39,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178654828] [2022-07-13 11:25:39,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:39,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-07-13 11:25:39,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:39,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178654828] [2022-07-13 11:25:39,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178654828] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:25:39,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411189208] [2022-07-13 11:25:39,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:39,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:25:39,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:25:39,440 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-13 11:25:39,441 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-13 11:25:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:39,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:25:39,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:25:39,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-07-13 11:25:39,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:25:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-07-13 11:25:39,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411189208] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:25:39,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:25:39,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-13 11:25:39,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884173416] [2022-07-13 11:25:39,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:25:39,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:25:39,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:39,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:25:39,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:25:39,799 INFO L87 Difference]: Start difference. First operand 2788 states and 3672 transitions. Second operand has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:40,214 INFO L93 Difference]: Finished difference Result 5137 states and 6793 transitions. [2022-07-13 11:25:40,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:25:40,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 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 601 [2022-07-13 11:25:40,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:40,216 INFO L225 Difference]: With dead ends: 5137 [2022-07-13 11:25:40,217 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 11:25:40,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1210 GetRequests, 1201 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:25:40,221 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 208 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:40,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 915 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:25:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 11:25:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 11:25:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 11:25:40,223 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 601 [2022-07-13 11:25:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:40,223 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 11:25:40,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 11:25:40,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 11:25:40,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:25:40,252 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-13 11:25:40,440 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-13 11:25:40,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 11:25:51,028 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 469) no Hoare annotation was computed. [2022-07-13 11:25:51,028 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 608) no Hoare annotation was computed. [2022-07-13 11:25:51,028 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 619) no Hoare annotation was computed. [2022-07-13 11:25:51,028 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 630) no Hoare annotation was computed. [2022-07-13 11:25:51,029 INFO L902 garLoopResultBuilder]: At program point L698(lines 689 700) the Hoare annotation is: true [2022-07-13 11:25:51,029 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2022-07-13 11:25:51,029 INFO L895 garLoopResultBuilder]: At program point L601(lines 109 669) the Hoare annotation is: (let ((.cse12 (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (let ((.cse11 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (not .cse12)) (.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))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse10 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse7 .cse9 .cse8) (and .cse4 .cse10) (and (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse11 .cse8) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse11 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse12) (and .cse11 .cse10) (and .cse13 .cse14 .cse15) (and .cse4 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse9 .cse10) (and .cse13 .cse10) (and .cse14 .cse9 .cse15)))) [2022-07-13 11:25:51,029 INFO L899 garLoopResultBuilder]: For program point L568(lines 568 572) no Hoare annotation was computed. [2022-07-13 11:25:51,029 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2022-07-13 11:25:51,030 INFO L895 garLoopResultBuilder]: At program point L370(lines 352 388) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse16 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15))) [2022-07-13 11:25:51,030 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 607) no Hoare annotation was computed. [2022-07-13 11:25:51,030 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 618) no Hoare annotation was computed. [2022-07-13 11:25:51,030 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 629) no Hoare annotation was computed. [2022-07-13 11:25:51,030 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2022-07-13 11:25:51,030 INFO L899 garLoopResultBuilder]: For program point L470(lines 470 481) no Hoare annotation was computed. [2022-07-13 11:25:51,031 INFO L899 garLoopResultBuilder]: For program point L536-2(lines 219 600) no Hoare annotation was computed. [2022-07-13 11:25:51,031 INFO L895 garLoopResultBuilder]: At program point L404(lines 395 426) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse15 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse16 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.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))) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |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))) (.cse13 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse13 .cse16) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13))) [2022-07-13 11:25:51,031 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 250) no Hoare annotation was computed. [2022-07-13 11:25:51,031 INFO L895 garLoopResultBuilder]: At program point L206(lines 202 608) 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 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.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 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (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 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse9 .cse10))) [2022-07-13 11:25:51,032 INFO L895 garLoopResultBuilder]: At program point L173(lines 169 619) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse16 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.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| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-13 11:25:51,032 INFO L899 garLoopResultBuilder]: For program point L239-2(lines 239 250) no Hoare annotation was computed. [2022-07-13 11:25:51,032 INFO L899 garLoopResultBuilder]: For program point L372(lines 372 376) no Hoare annotation was computed. [2022-07-13 11:25:51,032 INFO L902 garLoopResultBuilder]: At program point L670(lines 108 671) the Hoare annotation is: true [2022-07-13 11:25:51,032 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 412) no Hoare annotation was computed. [2022-07-13 11:25:51,032 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 246) no Hoare annotation was computed. [2022-07-13 11:25:51,033 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 606) no Hoare annotation was computed. [2022-07-13 11:25:51,033 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 617) no Hoare annotation was computed. [2022-07-13 11:25:51,034 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 628) no Hoare annotation was computed. [2022-07-13 11:25:51,035 INFO L895 garLoopResultBuilder]: At program point L109-2(lines 109 669) the Hoare annotation is: (let ((.cse12 (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (let ((.cse11 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (not .cse12)) (.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))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse10 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse7 .cse9 .cse8) (and .cse4 .cse10) (and (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse11 .cse8) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse11 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse12) (and .cse11 .cse10) (and .cse13 .cse14 .cse15) (and .cse4 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse9 .cse10) (and .cse13 .cse10) (and .cse14 .cse9 .cse15)))) [2022-07-13 11:25:51,042 INFO L895 garLoopResultBuilder]: At program point L176(lines 175 617) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse6 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse1 .cse4 .cse2) (and .cse5 .cse1 .cse2) (and .cse6 .cse1 .cse2) (and .cse6 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse1) (and .cse0 .cse1 .cse3) (and .cse5 .cse1 .cse3))) [2022-07-13 11:25:51,042 INFO L895 garLoopResultBuilder]: At program point L143(lines 136 630) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse16 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15))) [2022-07-13 11:25:51,042 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-07-13 11:25:51,042 INFO L899 garLoopResultBuilder]: For program point L639(lines 639 667) no Hoare annotation was computed. [2022-07-13 11:25:51,042 INFO L899 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2022-07-13 11:25:51,043 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 664) no Hoare annotation was computed. [2022-07-13 11:25:51,043 INFO L899 garLoopResultBuilder]: For program point L574(lines 574 578) no Hoare annotation was computed. [2022-07-13 11:25:51,043 INFO L899 garLoopResultBuilder]: For program point L508(lines 508 512) no Hoare annotation was computed. [2022-07-13 11:25:51,043 INFO L899 garLoopResultBuilder]: For program point L574-2(lines 574 578) no Hoare annotation was computed. [2022-07-13 11:25:51,043 INFO L899 garLoopResultBuilder]: For program point L508-2(lines 219 600) no Hoare annotation was computed. [2022-07-13 11:25:51,043 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 605) no Hoare annotation was computed. [2022-07-13 11:25:51,043 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 616) no Hoare annotation was computed. [2022-07-13 11:25:51,043 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 627) no Hoare annotation was computed. [2022-07-13 11:25:51,043 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 638) no Hoare annotation was computed. [2022-07-13 11:25:51,043 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 678) no Hoare annotation was computed. [2022-07-13 11:25:51,043 INFO L899 garLoopResultBuilder]: For program point L641(lines 641 650) no Hoare annotation was computed. [2022-07-13 11:25:51,043 INFO L899 garLoopResultBuilder]: For program point L674-2(lines 674 678) no Hoare annotation was computed. [2022-07-13 11:25:51,043 INFO L899 garLoopResultBuilder]: For program point L641-2(lines 640 662) no Hoare annotation was computed. [2022-07-13 11:25:51,043 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 282) no Hoare annotation was computed. [2022-07-13 11:25:51,043 INFO L895 garLoopResultBuilder]: At program point L212(lines 208 606) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1) (and .cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))))) [2022-07-13 11:25:51,044 INFO L895 garLoopResultBuilder]: At program point L113(lines 112 638) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3) (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse3))) [2022-07-13 11:25:51,044 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 316) no Hoare annotation was computed. [2022-07-13 11:25:51,044 INFO L899 garLoopResultBuilder]: For program point L312-2(lines 219 600) no Hoare annotation was computed. [2022-07-13 11:25:51,044 INFO L899 garLoopResultBuilder]: For program point L643(lines 643 647) no Hoare annotation was computed. [2022-07-13 11:25:51,044 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 604) no Hoare annotation was computed. [2022-07-13 11:25:51,044 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 615) no Hoare annotation was computed. [2022-07-13 11:25:51,044 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 626) no Hoare annotation was computed. [2022-07-13 11:25:51,044 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 637) no Hoare annotation was computed. [2022-07-13 11:25:51,044 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2022-07-13 11:25:51,044 INFO L899 garLoopResultBuilder]: For program point L347-2(lines 219 600) no Hoare annotation was computed. [2022-07-13 11:25:51,045 INFO L895 garLoopResultBuilder]: At program point L215(lines 214 604) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-13 11:25:51,045 INFO L895 garLoopResultBuilder]: At program point L182(lines 178 616) the Hoare annotation is: (let ((.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse6 .cse7 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse15 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-13 11:25:51,045 INFO L895 garLoopResultBuilder]: At program point L149(lines 145 627) the Hoare annotation is: (let ((.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse17 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8544 |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| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse13 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse11 .cse13) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14))) [2022-07-13 11:25:51,045 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 91) no Hoare annotation was computed. [2022-07-13 11:25:51,045 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 459) no Hoare annotation was computed. [2022-07-13 11:25:51,045 INFO L895 garLoopResultBuilder]: At program point L414(lines 405 425) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse15 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse16 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.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))) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |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))) (.cse13 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse13 .cse16) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13))) [2022-07-13 11:25:51,046 INFO L899 garLoopResultBuilder]: For program point L447-2(lines 447 459) no Hoare annotation was computed. [2022-07-13 11:25:51,046 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 614) no Hoare annotation was computed. [2022-07-13 11:25:51,046 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 625) no Hoare annotation was computed. [2022-07-13 11:25:51,046 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 636) no Hoare annotation was computed. [2022-07-13 11:25:51,046 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 11:25:51,046 INFO L895 garLoopResultBuilder]: At program point L218(lines 217 603) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-13 11:25:51,046 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2022-07-13 11:25:51,046 INFO L899 garLoopResultBuilder]: For program point L86-2(lines 83 91) no Hoare annotation was computed. [2022-07-13 11:25:51,046 INFO L899 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2022-07-13 11:25:51,047 INFO L899 garLoopResultBuilder]: For program point L450(lines 450 455) no Hoare annotation was computed. [2022-07-13 11:25:51,047 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2022-07-13 11:25:51,047 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 257) no Hoare annotation was computed. [2022-07-13 11:25:51,047 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 613) no Hoare annotation was computed. [2022-07-13 11:25:51,047 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 624) no Hoare annotation was computed. [2022-07-13 11:25:51,047 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 635) no Hoare annotation was computed. [2022-07-13 11:25:51,047 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 594) no Hoare annotation was computed. [2022-07-13 11:25:51,048 INFO L899 garLoopResultBuilder]: For program point L584-1(lines 584 594) no Hoare annotation was computed. [2022-07-13 11:25:51,048 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 522) no Hoare annotation was computed. [2022-07-13 11:25:51,048 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2022-07-13 11:25:51,048 INFO L895 garLoopResultBuilder]: At program point L188(lines 184 614) the Hoare annotation is: (let ((.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse6 .cse7 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse15 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-13 11:25:51,048 INFO L895 garLoopResultBuilder]: At program point L155(lines 151 625) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse16 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15))) [2022-07-13 11:25:51,048 INFO L899 garLoopResultBuilder]: For program point L486(lines 486 490) no Hoare annotation was computed. [2022-07-13 11:25:51,049 INFO L895 garLoopResultBuilder]: At program point L222(lines 115 637) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse12 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse18 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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| 8545))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse9 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse17 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse15 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse15) (and .cse18 .cse1 .cse19 .cse8 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse1 .cse7 .cse8 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse15) (and .cse18 .cse1 .cse8 .cse16 .cse17) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse17 .cse15))) [2022-07-13 11:25:51,049 INFO L902 garLoopResultBuilder]: At program point L685(lines 75 687) the Hoare annotation is: true [2022-07-13 11:25:51,049 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 658) no Hoare annotation was computed. [2022-07-13 11:25:51,049 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 387) no Hoare annotation was computed. [2022-07-13 11:25:51,049 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2022-07-13 11:25:51,049 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 11:25:51,050 INFO L899 garLoopResultBuilder]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2022-07-13 11:25:51,050 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 612) no Hoare annotation was computed. [2022-07-13 11:25:51,050 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 623) no Hoare annotation was computed. [2022-07-13 11:25:51,050 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 634) no Hoare annotation was computed. [2022-07-13 11:25:51,050 INFO L902 garLoopResultBuilder]: At program point L686(lines 20 688) the Hoare annotation is: true [2022-07-13 11:25:51,050 INFO L899 garLoopResultBuilder]: For program point L587(lines 587 591) no Hoare annotation was computed. [2022-07-13 11:25:51,050 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2022-07-13 11:25:51,051 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 75 687) no Hoare annotation was computed. [2022-07-13 11:25:51,051 INFO L899 garLoopResultBuilder]: For program point L358(lines 358 386) no Hoare annotation was computed. [2022-07-13 11:25:51,051 INFO L899 garLoopResultBuilder]: For program point L358-1(lines 358 386) no Hoare annotation was computed. [2022-07-13 11:25:51,051 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 272) no Hoare annotation was computed. [2022-07-13 11:25:51,051 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 611) no Hoare annotation was computed. [2022-07-13 11:25:51,051 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 622) no Hoare annotation was computed. [2022-07-13 11:25:51,051 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 633) no Hoare annotation was computed. [2022-07-13 11:25:51,052 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2022-07-13 11:25:51,052 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 11:25:51,052 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 383) no Hoare annotation was computed. [2022-07-13 11:25:51,052 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 231) no Hoare annotation was computed. [2022-07-13 11:25:51,052 INFO L895 garLoopResultBuilder]: At program point L194(lines 190 612) the Hoare annotation is: (let ((.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse6 .cse7 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse15 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-13 11:25:51,052 INFO L895 garLoopResultBuilder]: At program point L161(lines 157 623) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse16 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15))) [2022-07-13 11:25:51,053 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 219 600) no Hoare annotation was computed. [2022-07-13 11:25:51,053 INFO L899 garLoopResultBuilder]: For program point L261(lines 261 266) no Hoare annotation was computed. [2022-07-13 11:25:51,053 INFO L899 garLoopResultBuilder]: For program point L559(lines 559 567) no Hoare annotation was computed. [2022-07-13 11:25:51,053 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 299) no Hoare annotation was computed. [2022-07-13 11:25:51,053 INFO L899 garLoopResultBuilder]: For program point L295-2(lines 219 600) no Hoare annotation was computed. [2022-07-13 11:25:51,053 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 610) no Hoare annotation was computed. [2022-07-13 11:25:51,053 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 621) no Hoare annotation was computed. [2022-07-13 11:25:51,054 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 632) no Hoare annotation was computed. [2022-07-13 11:25:51,054 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 426) no Hoare annotation was computed. [2022-07-13 11:25:51,054 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 382) no Hoare annotation was computed. [2022-07-13 11:25:51,054 INFO L895 garLoopResultBuilder]: At program point L131(lines 127 633) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse17 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse10 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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))) (.cse15 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse12) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13))) [2022-07-13 11:25:51,054 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 11:25:51,054 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 681) no Hoare annotation was computed. [2022-07-13 11:25:51,055 INFO L899 garLoopResultBuilder]: For program point L396(lines 396 402) no Hoare annotation was computed. [2022-07-13 11:25:51,055 INFO L899 garLoopResultBuilder]: For program point L562(lines 562 566) no Hoare annotation was computed. [2022-07-13 11:25:51,055 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2022-07-13 11:25:51,055 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 368) no Hoare annotation was computed. [2022-07-13 11:25:51,055 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 331 340) no Hoare annotation was computed. [2022-07-13 11:25:51,055 INFO L899 garLoopResultBuilder]: For program point L364-2(lines 362 380) no Hoare annotation was computed. [2022-07-13 11:25:51,055 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 609) no Hoare annotation was computed. [2022-07-13 11:25:51,055 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 620) no Hoare annotation was computed. [2022-07-13 11:25:51,056 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 631) no Hoare annotation was computed. [2022-07-13 11:25:51,056 INFO L895 garLoopResultBuilder]: At program point L563(lines 75 687) the Hoare annotation is: false [2022-07-13 11:25:51,056 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2022-07-13 11:25:51,056 INFO L895 garLoopResultBuilder]: At program point L200(lines 196 610) the Hoare annotation is: (let ((.cse6 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.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 (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 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse9) (and .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse4 .cse5 .cse7 .cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse9 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)))) [2022-07-13 11:25:51,056 INFO L895 garLoopResultBuilder]: At program point L167(lines 163 621) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse15 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse16 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.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))) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |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))) (.cse13 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse13 .cse16) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13))) [2022-07-13 11:25:51,057 INFO L895 garLoopResultBuilder]: At program point L134(lines 133 631) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-13 11:25:51,059 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] [2022-07-13 11:25:51,061 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:25:51,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:25:51 BoogieIcfgContainer [2022-07-13 11:25:51,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:25:51,129 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:25:51,129 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:25:51,129 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:25:51,130 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:25:30" (3/4) ... [2022-07-13 11:25:51,132 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 11:25:51,151 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-13 11:25:51,152 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 11:25:51,152 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 11:25:51,153 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 11:25:51,246 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 11:25:51,246 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:25:51,247 INFO L158 Benchmark]: Toolchain (without parser) took 21810.79ms. Allocated memory was 96.5MB in the beginning and 329.3MB in the end (delta: 232.8MB). Free memory was 67.0MB in the beginning and 185.1MB in the end (delta: -118.1MB). Peak memory consumption was 115.2MB. Max. memory is 16.1GB. [2022-07-13 11:25:51,247 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 52.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:25:51,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.49ms. Allocated memory is still 96.5MB. Free memory was 66.8MB in the beginning and 67.6MB in the end (delta: -807.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 11:25:51,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.58ms. Allocated memory is still 96.5MB. Free memory was 67.6MB in the beginning and 64.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 11:25:51,249 INFO L158 Benchmark]: Boogie Preprocessor took 58.98ms. Allocated memory is still 96.5MB. Free memory was 64.6MB in the beginning and 62.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:25:51,252 INFO L158 Benchmark]: RCFGBuilder took 667.97ms. Allocated memory was 96.5MB in the beginning and 123.7MB in the end (delta: 27.3MB). Free memory was 62.5MB in the beginning and 86.5MB in the end (delta: -24.0MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2022-07-13 11:25:51,256 INFO L158 Benchmark]: TraceAbstraction took 20575.63ms. Allocated memory was 123.7MB in the beginning and 329.3MB in the end (delta: 205.5MB). Free memory was 85.9MB in the beginning and 194.6MB in the end (delta: -108.6MB). Peak memory consumption was 205.7MB. Max. memory is 16.1GB. [2022-07-13 11:25:51,257 INFO L158 Benchmark]: Witness Printer took 117.28ms. Allocated memory is still 329.3MB. Free memory was 194.6MB in the beginning and 185.1MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 11:25:51,258 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.20ms. Allocated memory is still 96.5MB. Free memory is still 52.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.49ms. Allocated memory is still 96.5MB. Free memory was 66.8MB in the beginning and 67.6MB in the end (delta: -807.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.58ms. Allocated memory is still 96.5MB. Free memory was 67.6MB in the beginning and 64.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.98ms. Allocated memory is still 96.5MB. Free memory was 64.6MB in the beginning and 62.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 667.97ms. Allocated memory was 96.5MB in the beginning and 123.7MB in the end (delta: 27.3MB). Free memory was 62.5MB in the beginning and 86.5MB in the end (delta: -24.0MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20575.63ms. Allocated memory was 123.7MB in the beginning and 329.3MB in the end (delta: 205.5MB). Free memory was 85.9MB in the beginning and 194.6MB in the end (delta: -108.6MB). Peak memory consumption was 205.7MB. Max. memory is 16.1GB. * Witness Printer took 117.28ms. Allocated memory is still 329.3MB. Free memory was 194.6MB in the beginning and 185.1MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. 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: 681]: 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, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.5s, OverallIterations: 31, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3907 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3907 mSDsluCounter, 8949 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3130 mSDsCounter, 979 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3605 IncrementalHoareTripleChecker+Invalid, 4584 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 979 mSolverCounterUnsat, 5819 mSDtfsCounter, 3605 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2362 GetRequests, 2314 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3466occurred in iteration=22, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 1650 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 439 NumberOfFragments, 6539 HoareAnnotationTreeSize, 29 FomulaSimplifications, 19050 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 29 FomulaSimplificationsInter, 39950 FormulaSimplificationTreeSizeReductionInter, 7.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 7625 NumberOfCodeBlocks, 7625 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 8563 ConstructedInterpolants, 0 QuantifiedInterpolants, 11985 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2048 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 36 InterpolantComputations, 29 PerfectInterpolantSequences, 31259/31481 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: 196]: Loop Invariant Derived loop invariant: ((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((8672 <= s__state && blastFlag == 1) && !(12292 == s__state)) || ((8672 <= s__state && !(12292 == s__state)) && blastFlag == 0)) || ((8672 <= s__state && 3 == blastFlag) && !(12292 == s__state))) || (((8672 <= s__state && 2 == blastFlag) && !(12292 == s__state)) && !(0 == s__hit)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((((((((((((!(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)) && !(8560 == s__state)) || ((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(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)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && s__state < 8576) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((8672 <= s__state && !(8673 == s__state)) && 3 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) || ((((8672 <= s__state && !(8673 == s__state)) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit))) || ((((8672 <= s__state && !(8673 == s__state)) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || ((((8672 <= s__state && !(8673 == s__state)) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit)) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((((blastFlag == 1 && 8448 == s__state) && !(0 == s__hit)) || ((8448 == s__state && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((8448 == s__state && blastFlag == 0) && !(0 == s__hit))) || ((2 == blastFlag && 8448 == s__state) && !(0 == s__hit))) || ((3 == blastFlag && 8448 == s__state) && !(0 == s__hit))) || ((3 == blastFlag && 3 == s__s3__tmp__next_state___0) && 8448 == s__state)) || ((blastFlag == 1 && 8448 == s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && 8448 == s__state) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((((((!(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)) && !(8560 == s__state)) || ((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(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)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: (((((((((((((((!(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)) && !(8560 == s__state)) || ((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(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)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 395]: 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)) && !(8496 == s__state)) && !(12292 == s__state)) && !(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)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(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)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(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)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state))) || ((((8672 <= s__state && !(8673 == s__state)) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit))) || (((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(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 == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((8672 <= s__state && !(8673 == s__state)) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == 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)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((8672 <= s__state && !(8673 == s__state)) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) && s__state <= 8672 - InvariantResult [Line: 163]: 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)) && !(8496 == s__state)) && !(12292 == s__state)) && !(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)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(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)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) - InvariantResult [Line: 405]: 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)) && !(8496 == s__state)) && !(12292 == s__state)) && !(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)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(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)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && s__state <= 8672)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0)) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && s__state <= 8672)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8480)) && s__state <= 8672) || (((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && s__state <= 8672)) || (2 == blastFlag && !(0 == s__hit))) || ((8672 <= s__state && 3 == blastFlag) && s__state <= 8672)) || s__state <= 3) || ((3 == blastFlag && 3 == s__s3__tmp__next_state___0) && 8448 == s__state)) || (3 == blastFlag && !(0 == s__hit))) || ((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && s__state <= 8672)) || (blastFlag == 0 && !(0 == s__hit))) || (blastFlag == 1 && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(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)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(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)) && !(8560 == s__state))) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(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)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8480)) && s__state <= 8672) || (((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && s__state <= 8672)) || (2 == blastFlag && !(0 == s__hit))) || ((8672 <= s__state && 3 == blastFlag) && s__state <= 8672)) || s__state <= 3) || ((3 == blastFlag && 3 == s__s3__tmp__next_state___0) && 8448 == s__state)) || (3 == blastFlag && !(0 == s__hit))) || ((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && s__state <= 8672)) || (blastFlag == 0 && !(0 == s__hit))) || (blastFlag == 1 && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576) - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((((((((((((((!(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)) && !(8560 == s__state)) || ((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(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)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) && s__state <= 8672) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) RESULT: Ultimate proved your program to be correct! [2022-07-13 11:25:51,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE