./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 e8d55036 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-?-e8d5503-m [2023-02-15 19:21:17,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:21:17,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:21:17,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:21:17,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:21:17,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:21:17,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:21:17,304 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:21:17,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:21:17,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:21:17,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:21:17,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:21:17,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:21:17,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:21:17,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:21:17,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:21:17,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:21:17,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:21:17,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:21:17,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:21:17,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:21:17,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:21:17,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:21:17,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:21:17,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:21:17,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:21:17,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:21:17,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:21:17,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:21:17,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:21:17,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:21:17,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:21:17,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:21:17,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:21:17,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:21:17,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:21:17,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:21:17,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:21:17,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:21:17,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:21:17,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:21:17,331 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:21:17,345 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:21:17,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:21:17,345 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:21:17,345 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:21:17,346 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:21:17,346 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:21:17,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:21:17,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:21:17,347 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:21:17,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:21:17,347 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:21:17,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:21:17,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:21:17,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:21:17,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:21:17,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:21:17,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:21:17,348 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:21:17,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:21:17,348 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:21:17,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:21:17,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:21:17,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:21:17,349 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:21:17,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:21:17,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:21:17,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:21:17,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:21:17,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:21:17,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:21:17,351 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:21:17,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:21:17,351 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:21:17,351 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:21:17,352 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:21:17,352 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-02-15 19:21:17,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:21:17,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:21:17,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:21:17,573 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:21:17,573 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:21:17,575 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 [2023-02-15 19:21:18,509 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:21:18,707 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:21:18,708 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2023-02-15 19:21:18,726 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3f552810/e65934f8c0cb419482cbc0d160c30251/FLAG74a3824e7 [2023-02-15 19:21:19,101 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3f552810/e65934f8c0cb419482cbc0d160c30251 [2023-02-15 19:21:19,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:21:19,106 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:21:19,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:21:19,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:21:19,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:21:19,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:21:19" (1/1) ... [2023-02-15 19:21:19,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e84b276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:19, skipping insertion in model container [2023-02-15 19:21:19,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:21:19" (1/1) ... [2023-02-15 19:21:19,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:21:19,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:21:19,356 WARN L237 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] [2023-02-15 19:21:19,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:21:19,378 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:21:19,430 WARN L237 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] [2023-02-15 19:21:19,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:21:19,445 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:21:19,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:19 WrapperNode [2023-02-15 19:21:19,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:21:19,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:21:19,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:21:19,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:21:19,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:19" (1/1) ... [2023-02-15 19:21:19,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:19" (1/1) ... [2023-02-15 19:21:19,484 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 521 [2023-02-15 19:21:19,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:21:19,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:21:19,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:21:19,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:21:19,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:19" (1/1) ... [2023-02-15 19:21:19,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:19" (1/1) ... [2023-02-15 19:21:19,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:19" (1/1) ... [2023-02-15 19:21:19,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:19" (1/1) ... [2023-02-15 19:21:19,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:19" (1/1) ... [2023-02-15 19:21:19,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:19" (1/1) ... [2023-02-15 19:21:19,525 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:19" (1/1) ... [2023-02-15 19:21:19,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:19" (1/1) ... [2023-02-15 19:21:19,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:21:19,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:21:19,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:21:19,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:21:19,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:19" (1/1) ... [2023-02-15 19:21:19,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:21:19,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:21:19,562 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) [2023-02-15 19:21:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:21:19,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:21:19,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:21:19,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:21:19,608 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 [2023-02-15 19:21:19,673 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:21:19,675 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:21:19,691 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-02-15 19:21:20,100 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2023-02-15 19:21:20,100 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2023-02-15 19:21:20,100 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:21:20,105 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:21:20,105 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 19:21:20,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:21:20 BoogieIcfgContainer [2023-02-15 19:21:20,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:21:20,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:21:20,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:21:20,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:21:20,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:21:19" (1/3) ... [2023-02-15 19:21:20,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301abf81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:21:20, skipping insertion in model container [2023-02-15 19:21:20,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:19" (2/3) ... [2023-02-15 19:21:20,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301abf81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:21:20, skipping insertion in model container [2023-02-15 19:21:20,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:21:20" (3/3) ... [2023-02-15 19:21:20,112 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2023-02-15 19:21:20,122 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:21:20,123 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:21:20,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:21:20,164 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e4c3ae6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:21:20,164 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:21:20,167 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) [2023-02-15 19:21:20,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 19:21:20,174 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:20,175 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] [2023-02-15 19:21:20,176 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:20,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:20,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1632000041, now seen corresponding path program 1 times [2023-02-15 19:21:20,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:20,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116228639] [2023-02-15 19:21:20,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:20,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:21:20,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:20,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116228639] [2023-02-15 19:21:20,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116228639] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:20,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:20,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:20,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090908541] [2023-02-15 19:21:20,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:20,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:20,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:20,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:20,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:20,497 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) [2023-02-15 19:21:20,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:20,661 INFO L93 Difference]: Finished difference Result 301 states and 513 transitions. [2023-02-15 19:21:20,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:20,663 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 [2023-02-15 19:21:20,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:20,672 INFO L225 Difference]: With dead ends: 301 [2023-02-15 19:21:20,672 INFO L226 Difference]: Without dead ends: 147 [2023-02-15 19:21:20,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:20,678 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 32 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:20,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 364 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-15 19:21:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2023-02-15 19:21:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 218 transitions. [2023-02-15 19:21:20,716 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 218 transitions. Word has length 44 [2023-02-15 19:21:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:20,717 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 218 transitions. [2023-02-15 19:21:20,717 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) [2023-02-15 19:21:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 218 transitions. [2023-02-15 19:21:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 19:21:20,719 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:20,719 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 19:21:20,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:21:20,720 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:20,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:20,720 INFO L85 PathProgramCache]: Analyzing trace with hash -193922812, now seen corresponding path program 1 times [2023-02-15 19:21:20,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:20,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492290201] [2023-02-15 19:21:20,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:20,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:21:20,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:20,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492290201] [2023-02-15 19:21:20,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492290201] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:20,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:20,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:20,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367169539] [2023-02-15 19:21:20,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:20,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:20,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:20,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:20,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:20,829 INFO L87 Difference]: Start difference. First operand 144 states and 218 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) [2023-02-15 19:21:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:20,958 INFO L93 Difference]: Finished difference Result 305 states and 468 transitions. [2023-02-15 19:21:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:20,959 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 60 [2023-02-15 19:21:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:20,960 INFO L225 Difference]: With dead ends: 305 [2023-02-15 19:21:20,960 INFO L226 Difference]: Without dead ends: 169 [2023-02-15 19:21:20,961 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 [2023-02-15 19:21:20,962 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 14 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:20,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 290 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:20,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-15 19:21:20,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2023-02-15 19:21:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 164 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) [2023-02-15 19:21:20,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2023-02-15 19:21:20,978 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 60 [2023-02-15 19:21:20,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:20,978 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2023-02-15 19:21:20,979 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) [2023-02-15 19:21:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2023-02-15 19:21:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-15 19:21:20,980 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:20,981 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:20,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:21:20,981 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:20,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash -751274889, now seen corresponding path program 1 times [2023-02-15 19:21:20,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:20,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351029203] [2023-02-15 19:21:20,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:20,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 19:21:21,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:21,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351029203] [2023-02-15 19:21:21,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351029203] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:21,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:21,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:21,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276248718] [2023-02-15 19:21:21,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:21,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:21,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:21,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:21,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:21,085 INFO L87 Difference]: Start difference. First operand 165 states and 244 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) [2023-02-15 19:21:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:21,221 INFO L93 Difference]: Finished difference Result 368 states and 559 transitions. [2023-02-15 19:21:21,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:21,222 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 81 [2023-02-15 19:21:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:21,223 INFO L225 Difference]: With dead ends: 368 [2023-02-15 19:21:21,223 INFO L226 Difference]: Without dead ends: 211 [2023-02-15 19:21:21,224 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 [2023-02-15 19:21:21,225 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 15 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:21,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 287 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-15 19:21:21,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2023-02-15 19:21:21,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.412621359223301) internal successors, (291), 206 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 291 transitions. [2023-02-15 19:21:21,233 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 291 transitions. Word has length 81 [2023-02-15 19:21:21,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:21,234 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 291 transitions. [2023-02-15 19:21:21,234 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) [2023-02-15 19:21:21,234 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 291 transitions. [2023-02-15 19:21:21,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-15 19:21:21,236 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:21,236 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:21,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 19:21:21,237 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:21,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:21,237 INFO L85 PathProgramCache]: Analyzing trace with hash -503128395, now seen corresponding path program 1 times [2023-02-15 19:21:21,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:21,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138821812] [2023-02-15 19:21:21,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:21,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 19:21:21,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:21,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138821812] [2023-02-15 19:21:21,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138821812] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:21,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:21,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:21,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599306362] [2023-02-15 19:21:21,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:21,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:21,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:21,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:21,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:21,300 INFO L87 Difference]: Start difference. First operand 207 states and 291 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) [2023-02-15 19:21:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:21,399 INFO L93 Difference]: Finished difference Result 432 states and 616 transitions. [2023-02-15 19:21:21,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:21,399 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 81 [2023-02-15 19:21:21,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:21,400 INFO L225 Difference]: With dead ends: 432 [2023-02-15 19:21:21,400 INFO L226 Difference]: Without dead ends: 233 [2023-02-15 19:21:21,401 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 [2023-02-15 19:21:21,402 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:21,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 306 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-02-15 19:21:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2023-02-15 19:21:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.3930131004366813) internal successors, (319), 229 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 319 transitions. [2023-02-15 19:21:21,410 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 319 transitions. Word has length 81 [2023-02-15 19:21:21,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:21,410 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 319 transitions. [2023-02-15 19:21:21,411 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) [2023-02-15 19:21:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 319 transitions. [2023-02-15 19:21:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-15 19:21:21,412 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:21,413 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2023-02-15 19:21:21,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 19:21:21,413 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:21,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:21,414 INFO L85 PathProgramCache]: Analyzing trace with hash 356294499, now seen corresponding path program 1 times [2023-02-15 19:21:21,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:21,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093638991] [2023-02-15 19:21:21,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:21,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-02-15 19:21:21,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:21,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093638991] [2023-02-15 19:21:21,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093638991] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:21,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:21,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543112483] [2023-02-15 19:21:21,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:21,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:21,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:21,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:21,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:21,464 INFO L87 Difference]: Start difference. First operand 230 states and 319 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) [2023-02-15 19:21:21,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:21,547 INFO L93 Difference]: Finished difference Result 489 states and 692 transitions. [2023-02-15 19:21:21,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:21,547 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 [2023-02-15 19:21:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:21,548 INFO L225 Difference]: With dead ends: 489 [2023-02-15 19:21:21,548 INFO L226 Difference]: Without dead ends: 267 [2023-02-15 19:21:21,549 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 [2023-02-15 19:21:21,550 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 29 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:21,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 305 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-02-15 19:21:21,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 255. [2023-02-15 19:21:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.374015748031496) internal successors, (349), 254 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 349 transitions. [2023-02-15 19:21:21,557 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 349 transitions. Word has length 101 [2023-02-15 19:21:21,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:21,557 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 349 transitions. [2023-02-15 19:21:21,558 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) [2023-02-15 19:21:21,558 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 349 transitions. [2023-02-15 19:21:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-15 19:21:21,559 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:21,559 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] [2023-02-15 19:21:21,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 19:21:21,559 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:21,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:21,560 INFO L85 PathProgramCache]: Analyzing trace with hash 112174862, now seen corresponding path program 1 times [2023-02-15 19:21:21,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:21,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910562972] [2023-02-15 19:21:21,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:21,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-02-15 19:21:21,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:21,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910562972] [2023-02-15 19:21:21,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910562972] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:21,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:21,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:21,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818318008] [2023-02-15 19:21:21,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:21,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:21,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:21,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:21,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:21,649 INFO L87 Difference]: Start difference. First operand 255 states and 349 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) [2023-02-15 19:21:21,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:21,670 INFO L93 Difference]: Finished difference Result 743 states and 1017 transitions. [2023-02-15 19:21:21,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:21,671 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 [2023-02-15 19:21:21,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:21,674 INFO L225 Difference]: With dead ends: 743 [2023-02-15 19:21:21,674 INFO L226 Difference]: Without dead ends: 496 [2023-02-15 19:21:21,674 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 [2023-02-15 19:21:21,679 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 131 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 456 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 [2023-02-15 19:21:21,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 456 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:21:21,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2023-02-15 19:21:21,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2023-02-15 19:21:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 1.3616161616161617) internal successors, (674), 495 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 674 transitions. [2023-02-15 19:21:21,700 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 674 transitions. Word has length 121 [2023-02-15 19:21:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:21,701 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 674 transitions. [2023-02-15 19:21:21,702 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) [2023-02-15 19:21:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 674 transitions. [2023-02-15 19:21:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-15 19:21:21,707 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:21,707 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] [2023-02-15 19:21:21,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 19:21:21,707 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:21,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:21,709 INFO L85 PathProgramCache]: Analyzing trace with hash -785218416, now seen corresponding path program 1 times [2023-02-15 19:21:21,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:21,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676865683] [2023-02-15 19:21:21,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:21,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 19:21:21,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:21,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676865683] [2023-02-15 19:21:21,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676865683] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:21,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:21,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:21,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120405530] [2023-02-15 19:21:21,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:21,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:21,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:21,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:21,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:21,816 INFO L87 Difference]: Start difference. First operand 496 states and 674 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) [2023-02-15 19:21:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:21,842 INFO L93 Difference]: Finished difference Result 1227 states and 1670 transitions. [2023-02-15 19:21:21,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:21,842 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 [2023-02-15 19:21:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:21,846 INFO L225 Difference]: With dead ends: 1227 [2023-02-15 19:21:21,846 INFO L226 Difference]: Without dead ends: 739 [2023-02-15 19:21:21,847 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 [2023-02-15 19:21:21,848 INFO L413 NwaCegarLoop]: 310 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, 492 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 [2023-02-15 19:21:21,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 492 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:21:21,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2023-02-15 19:21:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2023-02-15 19:21:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 1.3577235772357723) internal successors, (1002), 738 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1002 transitions. [2023-02-15 19:21:21,862 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1002 transitions. Word has length 121 [2023-02-15 19:21:21,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:21,862 INFO L495 AbstractCegarLoop]: Abstraction has 739 states and 1002 transitions. [2023-02-15 19:21:21,862 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) [2023-02-15 19:21:21,862 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1002 transitions. [2023-02-15 19:21:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-15 19:21:21,864 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:21,864 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] [2023-02-15 19:21:21,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 19:21:21,864 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:21,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:21,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1630617934, now seen corresponding path program 1 times [2023-02-15 19:21:21,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:21,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806443571] [2023-02-15 19:21:21,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:21,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-15 19:21:21,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:21,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806443571] [2023-02-15 19:21:21,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806443571] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:21,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:21,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:21,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517269705] [2023-02-15 19:21:21,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:21,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:21,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:21,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:21,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:21,896 INFO L87 Difference]: Start difference. First operand 739 states and 1002 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) [2023-02-15 19:21:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:21,912 INFO L93 Difference]: Finished difference Result 1494 states and 2022 transitions. [2023-02-15 19:21:21,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:21,913 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 [2023-02-15 19:21:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:21,915 INFO L225 Difference]: With dead ends: 1494 [2023-02-15 19:21:21,915 INFO L226 Difference]: Without dead ends: 763 [2023-02-15 19:21:21,916 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 [2023-02-15 19:21:21,916 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 10 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:21,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 386 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:21:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2023-02-15 19:21:21,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 763. [2023-02-15 19:21:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 762 states have (on average 1.353018372703412) internal successors, (1031), 762 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1031 transitions. [2023-02-15 19:21:21,927 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1031 transitions. Word has length 121 [2023-02-15 19:21:21,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:21,928 INFO L495 AbstractCegarLoop]: Abstraction has 763 states and 1031 transitions. [2023-02-15 19:21:21,928 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) [2023-02-15 19:21:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1031 transitions. [2023-02-15 19:21:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-15 19:21:21,929 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:21,930 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] [2023-02-15 19:21:21,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 19:21:21,930 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:21,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:21,930 INFO L85 PathProgramCache]: Analyzing trace with hash -402776112, now seen corresponding path program 1 times [2023-02-15 19:21:21,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:21,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031414916] [2023-02-15 19:21:21,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:21,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-02-15 19:21:21,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:21,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031414916] [2023-02-15 19:21:21,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031414916] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:21,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:21,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:21,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943101443] [2023-02-15 19:21:21,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:21,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:21,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:21,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:21,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:21,973 INFO L87 Difference]: Start difference. First operand 763 states and 1031 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) [2023-02-15 19:21:21,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:21,989 INFO L93 Difference]: Finished difference Result 1531 states and 2064 transitions. [2023-02-15 19:21:21,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:21,989 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 [2023-02-15 19:21:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:21,991 INFO L225 Difference]: With dead ends: 1531 [2023-02-15 19:21:21,991 INFO L226 Difference]: Without dead ends: 776 [2023-02-15 19:21:21,992 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 [2023-02-15 19:21:21,993 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:21,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 366 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:21:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-02-15 19:21:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2023-02-15 19:21:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 775 states have (on average 1.3470967741935485) internal successors, (1044), 775 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1044 transitions. [2023-02-15 19:21:22,004 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1044 transitions. Word has length 121 [2023-02-15 19:21:22,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:22,004 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 1044 transitions. [2023-02-15 19:21:22,004 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) [2023-02-15 19:21:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1044 transitions. [2023-02-15 19:21:22,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-02-15 19:21:22,006 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:22,006 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 19:21:22,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 19:21:22,007 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:22,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:22,007 INFO L85 PathProgramCache]: Analyzing trace with hash -541828422, now seen corresponding path program 1 times [2023-02-15 19:21:22,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:22,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657312757] [2023-02-15 19:21:22,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:22,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-02-15 19:21:22,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:22,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657312757] [2023-02-15 19:21:22,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657312757] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:22,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:22,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:22,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258712324] [2023-02-15 19:21:22,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:22,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:22,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:22,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:22,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:22,079 INFO L87 Difference]: Start difference. First operand 776 states and 1044 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:22,191 INFO L93 Difference]: Finished difference Result 1644 states and 2261 transitions. [2023-02-15 19:21:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:22,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2023-02-15 19:21:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:22,194 INFO L225 Difference]: With dead ends: 1644 [2023-02-15 19:21:22,194 INFO L226 Difference]: Without dead ends: 889 [2023-02-15 19:21:22,195 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 [2023-02-15 19:21:22,195 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 36 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:22,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 288 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:22,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2023-02-15 19:21:22,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 858. [2023-02-15 19:21:22,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 857 states have (on average 1.3325554259043173) internal successors, (1142), 857 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1142 transitions. [2023-02-15 19:21:22,211 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1142 transitions. Word has length 159 [2023-02-15 19:21:22,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:22,211 INFO L495 AbstractCegarLoop]: Abstraction has 858 states and 1142 transitions. [2023-02-15 19:21:22,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1142 transitions. [2023-02-15 19:21:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-02-15 19:21:22,213 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:22,213 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 19:21:22,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 19:21:22,214 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:22,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:22,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1280398319, now seen corresponding path program 1 times [2023-02-15 19:21:22,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:22,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209994228] [2023-02-15 19:21:22,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:22,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-02-15 19:21:22,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:22,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209994228] [2023-02-15 19:21:22,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209994228] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:22,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:22,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:22,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182376617] [2023-02-15 19:21:22,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:22,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:22,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:22,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:22,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:22,264 INFO L87 Difference]: Start difference. First operand 858 states and 1142 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:22,379 INFO L93 Difference]: Finished difference Result 1865 states and 2553 transitions. [2023-02-15 19:21:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:22,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2023-02-15 19:21:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:22,383 INFO L225 Difference]: With dead ends: 1865 [2023-02-15 19:21:22,384 INFO L226 Difference]: Without dead ends: 1025 [2023-02-15 19:21:22,385 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 [2023-02-15 19:21:22,385 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 159 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:22,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 156 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2023-02-15 19:21:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1008. [2023-02-15 19:21:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1007 states have (on average 1.384309831181728) internal successors, (1394), 1007 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1394 transitions. [2023-02-15 19:21:22,402 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1394 transitions. Word has length 172 [2023-02-15 19:21:22,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:22,402 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1394 transitions. [2023-02-15 19:21:22,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:22,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1394 transitions. [2023-02-15 19:21:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2023-02-15 19:21:22,405 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:22,405 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:22,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 19:21:22,405 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:22,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:22,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2093330807, now seen corresponding path program 1 times [2023-02-15 19:21:22,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:22,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190151307] [2023-02-15 19:21:22,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:22,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2023-02-15 19:21:22,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:22,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190151307] [2023-02-15 19:21:22,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190151307] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:22,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:22,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:22,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948452026] [2023-02-15 19:21:22,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:22,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:22,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:22,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:22,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:22,463 INFO L87 Difference]: Start difference. First operand 1008 states and 1394 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:22,569 INFO L93 Difference]: Finished difference Result 2088 states and 2928 transitions. [2023-02-15 19:21:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:22,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 202 [2023-02-15 19:21:22,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:22,572 INFO L225 Difference]: With dead ends: 2088 [2023-02-15 19:21:22,572 INFO L226 Difference]: Without dead ends: 1101 [2023-02-15 19:21:22,573 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 [2023-02-15 19:21:22,573 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 14 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:22,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 299 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:22,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2023-02-15 19:21:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1101. [2023-02-15 19:21:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1100 states have (on average 1.3654545454545455) internal successors, (1502), 1100 states have internal predecessors, (1502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1502 transitions. [2023-02-15 19:21:22,592 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1502 transitions. Word has length 202 [2023-02-15 19:21:22,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:22,592 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1502 transitions. [2023-02-15 19:21:22,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1502 transitions. [2023-02-15 19:21:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-02-15 19:21:22,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:22,595 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:22,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 19:21:22,595 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:22,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:22,596 INFO L85 PathProgramCache]: Analyzing trace with hash -890289059, now seen corresponding path program 1 times [2023-02-15 19:21:22,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:22,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093541229] [2023-02-15 19:21:22,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:22,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2023-02-15 19:21:22,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:22,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093541229] [2023-02-15 19:21:22,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093541229] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:22,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:22,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:22,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439042407] [2023-02-15 19:21:22,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:22,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:22,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:22,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:22,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:22,677 INFO L87 Difference]: Start difference. First operand 1101 states and 1502 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:22,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:22,787 INFO L93 Difference]: Finished difference Result 2307 states and 3207 transitions. [2023-02-15 19:21:22,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:22,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2023-02-15 19:21:22,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:22,790 INFO L225 Difference]: With dead ends: 2307 [2023-02-15 19:21:22,791 INFO L226 Difference]: Without dead ends: 1096 [2023-02-15 19:21:22,792 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 [2023-02-15 19:21:22,792 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 9 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:22,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 306 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:22,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2023-02-15 19:21:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1096. [2023-02-15 19:21:22,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1095 states have (on average 1.3598173515981735) internal successors, (1489), 1095 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1489 transitions. [2023-02-15 19:21:22,809 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1489 transitions. Word has length 231 [2023-02-15 19:21:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:22,810 INFO L495 AbstractCegarLoop]: Abstraction has 1096 states and 1489 transitions. [2023-02-15 19:21:22,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:22,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1489 transitions. [2023-02-15 19:21:22,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2023-02-15 19:21:22,812 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:22,812 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] [2023-02-15 19:21:22,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 19:21:22,813 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:22,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:22,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1829254476, now seen corresponding path program 1 times [2023-02-15 19:21:22,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:22,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363307404] [2023-02-15 19:21:22,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:22,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-02-15 19:21:22,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:22,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363307404] [2023-02-15 19:21:22,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363307404] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:22,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:22,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:22,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267774933] [2023-02-15 19:21:22,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:22,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:22,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:22,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:22,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:22,888 INFO L87 Difference]: Start difference. First operand 1096 states and 1489 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) [2023-02-15 19:21:22,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:22,916 INFO L93 Difference]: Finished difference Result 3129 states and 4280 transitions. [2023-02-15 19:21:22,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:22,917 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 [2023-02-15 19:21:22,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:22,920 INFO L225 Difference]: With dead ends: 3129 [2023-02-15 19:21:22,920 INFO L226 Difference]: Without dead ends: 1391 [2023-02-15 19:21:22,922 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 [2023-02-15 19:21:22,922 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 117 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:22,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 515 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:21:22,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-02-15 19:21:22,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1389. [2023-02-15 19:21:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1388 states have (on average 1.3631123919308357) internal successors, (1892), 1388 states have internal predecessors, (1892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1892 transitions. [2023-02-15 19:21:22,948 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1892 transitions. Word has length 271 [2023-02-15 19:21:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:22,948 INFO L495 AbstractCegarLoop]: Abstraction has 1389 states and 1892 transitions. [2023-02-15 19:21:22,948 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) [2023-02-15 19:21:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1892 transitions. [2023-02-15 19:21:22,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2023-02-15 19:21:22,951 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:22,951 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:22,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 19:21:22,952 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:22,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:22,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1891635766, now seen corresponding path program 1 times [2023-02-15 19:21:22,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:22,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112676012] [2023-02-15 19:21:22,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:22,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2023-02-15 19:21:23,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:23,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112676012] [2023-02-15 19:21:23,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112676012] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:23,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:23,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:23,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549169733] [2023-02-15 19:21:23,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:23,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:23,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:23,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:23,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:23,014 INFO L87 Difference]: Start difference. First operand 1389 states and 1892 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:23,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:23,106 INFO L93 Difference]: Finished difference Result 2893 states and 3991 transitions. [2023-02-15 19:21:23,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:23,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 317 [2023-02-15 19:21:23,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:23,110 INFO L225 Difference]: With dead ends: 2893 [2023-02-15 19:21:23,110 INFO L226 Difference]: Without dead ends: 1525 [2023-02-15 19:21:23,112 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 [2023-02-15 19:21:23,113 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 18 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:23,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 300 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2023-02-15 19:21:23,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1497. [2023-02-15 19:21:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1496 states have (on average 1.3502673796791445) internal successors, (2020), 1496 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:23,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2020 transitions. [2023-02-15 19:21:23,137 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2020 transitions. Word has length 317 [2023-02-15 19:21:23,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:23,137 INFO L495 AbstractCegarLoop]: Abstraction has 1497 states and 2020 transitions. [2023-02-15 19:21:23,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:23,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2020 transitions. [2023-02-15 19:21:23,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2023-02-15 19:21:23,140 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:23,141 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:23,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 19:21:23,141 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:23,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:23,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1795423714, now seen corresponding path program 1 times [2023-02-15 19:21:23,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:23,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927276200] [2023-02-15 19:21:23,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:23,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2023-02-15 19:21:23,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:23,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927276200] [2023-02-15 19:21:23,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927276200] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:23,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:23,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:23,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117108012] [2023-02-15 19:21:23,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:23,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:23,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:23,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:23,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:23,222 INFO L87 Difference]: Start difference. First operand 1497 states and 2020 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:23,317 INFO L93 Difference]: Finished difference Result 3097 states and 4223 transitions. [2023-02-15 19:21:23,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:23,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2023-02-15 19:21:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:23,321 INFO L225 Difference]: With dead ends: 3097 [2023-02-15 19:21:23,321 INFO L226 Difference]: Without dead ends: 1621 [2023-02-15 19:21:23,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:23,324 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:23,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 300 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:23,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2023-02-15 19:21:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1613. [2023-02-15 19:21:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1612 states have (on average 1.337468982630273) internal successors, (2156), 1612 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2156 transitions. [2023-02-15 19:21:23,351 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2156 transitions. Word has length 340 [2023-02-15 19:21:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:23,352 INFO L495 AbstractCegarLoop]: Abstraction has 1613 states and 2156 transitions. [2023-02-15 19:21:23,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2156 transitions. [2023-02-15 19:21:23,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2023-02-15 19:21:23,355 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:23,355 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] [2023-02-15 19:21:23,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 19:21:23,356 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1520948552, now seen corresponding path program 1 times [2023-02-15 19:21:23,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:23,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509018485] [2023-02-15 19:21:23,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:23,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2023-02-15 19:21:23,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:23,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509018485] [2023-02-15 19:21:23,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509018485] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:21:23,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023170623] [2023-02-15 19:21:23,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:23,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:21:23,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:21:23,463 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) [2023-02-15 19:21:23,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 19:21:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:23,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 19:21:23,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:21:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2023-02-15 19:21:23,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:21:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2023-02-15 19:21:23,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023170623] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:21:23,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:21:23,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-15 19:21:23,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009663222] [2023-02-15 19:21:23,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:21:23,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:21:23,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:23,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:21:23,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:21:23,774 INFO L87 Difference]: Start difference. First operand 1613 states and 2156 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) [2023-02-15 19:21:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:24,083 INFO L93 Difference]: Finished difference Result 3933 states and 5333 transitions. [2023-02-15 19:21:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:21:24,083 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 [2023-02-15 19:21:24,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:24,088 INFO L225 Difference]: With dead ends: 3933 [2023-02-15 19:21:24,089 INFO L226 Difference]: Without dead ends: 2222 [2023-02-15 19:21:24,090 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 [2023-02-15 19:21:24,091 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 911 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:24,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 385 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:21:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2023-02-15 19:21:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 1625. [2023-02-15 19:21:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1624 states have (on average 1.3226600985221675) internal successors, (2148), 1624 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2148 transitions. [2023-02-15 19:21:24,120 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2148 transitions. Word has length 373 [2023-02-15 19:21:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:24,121 INFO L495 AbstractCegarLoop]: Abstraction has 1625 states and 2148 transitions. [2023-02-15 19:21:24,121 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) [2023-02-15 19:21:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2148 transitions. [2023-02-15 19:21:24,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2023-02-15 19:21:24,125 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:24,125 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] [2023-02-15 19:21:24,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 19:21:24,331 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,SelfDestructingSolverStorable16 [2023-02-15 19:21:24,331 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:24,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:24,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1777333080, now seen corresponding path program 1 times [2023-02-15 19:21:24,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:24,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112092075] [2023-02-15 19:21:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:24,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2339 backedges. 1324 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2023-02-15 19:21:24,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:24,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112092075] [2023-02-15 19:21:24,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112092075] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:24,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:24,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:24,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789579420] [2023-02-15 19:21:24,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:24,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:24,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:24,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:24,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:24,435 INFO L87 Difference]: Start difference. First operand 1625 states and 2148 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) [2023-02-15 19:21:24,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:24,539 INFO L93 Difference]: Finished difference Result 3409 states and 4581 transitions. [2023-02-15 19:21:24,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:24,540 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 [2023-02-15 19:21:24,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:24,544 INFO L225 Difference]: With dead ends: 3409 [2023-02-15 19:21:24,544 INFO L226 Difference]: Without dead ends: 1805 [2023-02-15 19:21:24,546 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 [2023-02-15 19:21:24,546 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:24,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 291 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2023-02-15 19:21:24,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1795. [2023-02-15 19:21:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1794 states have (on average 1.306020066889632) internal successors, (2343), 1794 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2343 transitions. [2023-02-15 19:21:24,579 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2343 transitions. Word has length 473 [2023-02-15 19:21:24,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:24,579 INFO L495 AbstractCegarLoop]: Abstraction has 1795 states and 2343 transitions. [2023-02-15 19:21:24,579 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) [2023-02-15 19:21:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2343 transitions. [2023-02-15 19:21:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2023-02-15 19:21:24,584 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:24,585 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] [2023-02-15 19:21:24,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 19:21:24,585 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:24,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:24,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1857511408, now seen corresponding path program 1 times [2023-02-15 19:21:24,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:24,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964966561] [2023-02-15 19:21:24,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:24,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3104 backedges. 1761 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2023-02-15 19:21:24,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:24,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964966561] [2023-02-15 19:21:24,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964966561] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:24,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:24,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:24,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400391280] [2023-02-15 19:21:24,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:24,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:24,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:24,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:24,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:24,687 INFO L87 Difference]: Start difference. First operand 1795 states and 2343 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) [2023-02-15 19:21:24,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:24,802 INFO L93 Difference]: Finished difference Result 3759 states and 4991 transitions. [2023-02-15 19:21:24,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:24,802 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 [2023-02-15 19:21:24,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:24,807 INFO L225 Difference]: With dead ends: 3759 [2023-02-15 19:21:24,807 INFO L226 Difference]: Without dead ends: 1985 [2023-02-15 19:21:24,809 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 [2023-02-15 19:21:24,810 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:24,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 291 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2023-02-15 19:21:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1975. [2023-02-15 19:21:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1974 states have (on average 1.2907801418439717) internal successors, (2548), 1974 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2548 transitions. [2023-02-15 19:21:24,850 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2548 transitions. Word has length 535 [2023-02-15 19:21:24,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:24,850 INFO L495 AbstractCegarLoop]: Abstraction has 1975 states and 2548 transitions. [2023-02-15 19:21:24,850 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) [2023-02-15 19:21:24,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2548 transitions. [2023-02-15 19:21:24,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2023-02-15 19:21:24,857 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:24,858 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] [2023-02-15 19:21:24,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 19:21:24,858 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:24,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:24,859 INFO L85 PathProgramCache]: Analyzing trace with hash -145524280, now seen corresponding path program 1 times [2023-02-15 19:21:24,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:24,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430352411] [2023-02-15 19:21:24,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:24,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:25,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2023-02-15 19:21:25,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:25,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430352411] [2023-02-15 19:21:25,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430352411] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:21:25,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272617751] [2023-02-15 19:21:25,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:25,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:21:25,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:21:25,072 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) [2023-02-15 19:21:25,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 19:21:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:25,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 19:21:25,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:21:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2023-02-15 19:21:25,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:21:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2023-02-15 19:21:25,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272617751] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:21:25,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:21:25,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-02-15 19:21:25,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024189799] [2023-02-15 19:21:25,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:21:25,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 19:21:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:25,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 19:21:25,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 19:21:25,380 INFO L87 Difference]: Start difference. First operand 1975 states and 2548 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) [2023-02-15 19:21:25,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:25,743 INFO L93 Difference]: Finished difference Result 2819 states and 3650 transitions. [2023-02-15 19:21:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 19:21:25,744 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 [2023-02-15 19:21:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:25,744 INFO L225 Difference]: With dead ends: 2819 [2023-02-15 19:21:25,745 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 19:21:25,747 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 [2023-02-15 19:21:25,747 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 192 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:25,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 994 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 19:21:25,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 19:21:25,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 19:21:25,748 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) [2023-02-15 19:21:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 19:21:25,748 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 601 [2023-02-15 19:21:25,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:25,748 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 19:21:25,749 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) [2023-02-15 19:21:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 19:21:25,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 19:21:25,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 19:21:25,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 19:21:25,972 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,SelfDestructingSolverStorable19 [2023-02-15 19:21:25,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 19:21:27,113 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 469) no Hoare annotation was computed. [2023-02-15 19:21:27,113 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8593#1(lines 184 614) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (and .cse1 .cse0 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-15 19:21:27,113 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8529#1(lines 157 623) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-15 19:21:27,113 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 608) no Hoare annotation was computed. [2023-02-15 19:21:27,113 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 619) no Hoare annotation was computed. [2023-02-15 19:21:27,113 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 630) no Hoare annotation was computed. [2023-02-15 19:21:27,114 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8497#1(lines 145 627) the Hoare annotation is: (let ((.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse2 (= 1 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (or (and .cse0 .cse1 .cse2) (and .cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse0 .cse3 .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and .cse2 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))))) [2023-02-15 19:21:27,114 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2023-02-15 19:21:27,114 INFO L899 garLoopResultBuilder]: For program point L568(lines 568 572) no Hoare annotation was computed. [2023-02-15 19:21:27,114 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2023-02-15 19:21:27,114 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8482#1(lines 133 631) the Hoare annotation is: (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672) [2023-02-15 19:21:27,114 INFO L895 garLoopResultBuilder]: At program point L370(lines 352 388) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-15 19:21:27,114 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 607) no Hoare annotation was computed. [2023-02-15 19:21:27,114 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 618) no Hoare annotation was computed. [2023-02-15 19:21:27,114 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 629) no Hoare annotation was computed. [2023-02-15 19:21:27,114 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2023-02-15 19:21:27,114 INFO L899 garLoopResultBuilder]: For program point L470(lines 470 481) no Hoare annotation was computed. [2023-02-15 19:21:27,114 INFO L899 garLoopResultBuilder]: For program point L536-2(lines 219 600) no Hoare annotation was computed. [2023-02-15 19:21:27,114 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 250) no Hoare annotation was computed. [2023-02-15 19:21:27,114 INFO L899 garLoopResultBuilder]: For program point L239-2(lines 239 250) no Hoare annotation was computed. [2023-02-15 19:21:27,114 INFO L899 garLoopResultBuilder]: For program point L372(lines 372 376) no Hoare annotation was computed. [2023-02-15 19:21:27,114 INFO L902 garLoopResultBuilder]: At program point L670(lines 75 687) the Hoare annotation is: true [2023-02-15 19:21:27,115 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 412) no Hoare annotation was computed. [2023-02-15 19:21:27,115 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 246) no Hoare annotation was computed. [2023-02-15 19:21:27,115 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 606) no Hoare annotation was computed. [2023-02-15 19:21:27,115 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 617) no Hoare annotation was computed. [2023-02-15 19:21:27,115 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 628) no Hoare annotation was computed. [2023-02-15 19:21:27,115 INFO L895 garLoopResultBuilder]: At program point L109-2(lines 109 669) the Hoare annotation is: (let ((.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3))) (or (and (= 0 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8464)) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse1) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8560)) (and (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse0 .cse1) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3) .cse3) (and .cse0 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8544) .cse0) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496) (= 1 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (and (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672) (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse1 .cse3))) [2023-02-15 19:21:27,115 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2023-02-15 19:21:27,115 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 689 700) the Hoare annotation is: true [2023-02-15 19:21:27,115 INFO L899 garLoopResultBuilder]: For program point L639(lines 639 667) no Hoare annotation was computed. [2023-02-15 19:21:27,115 INFO L899 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2023-02-15 19:21:27,115 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 664) no Hoare annotation was computed. [2023-02-15 19:21:27,115 INFO L899 garLoopResultBuilder]: For program point L574(lines 574 578) no Hoare annotation was computed. [2023-02-15 19:21:27,115 INFO L899 garLoopResultBuilder]: For program point L508(lines 508 512) no Hoare annotation was computed. [2023-02-15 19:21:27,115 INFO L899 garLoopResultBuilder]: For program point L574-2(lines 574 578) no Hoare annotation was computed. [2023-02-15 19:21:27,115 INFO L899 garLoopResultBuilder]: For program point L508-2(lines 219 600) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8481#1(lines 127 633) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse1 .cse0 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 605) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 616) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 627) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 638) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 678) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L641(lines 641 650) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L674-2(lines 674 678) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L641-2(lines 640 662) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 282) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 316) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L312-2(lines 219 600) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L643(lines 643 647) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 604) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 615) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 626) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 637) no Hoare annotation was computed. [2023-02-15 19:21:27,116 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8448#1(lines 175 617) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse2 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448))) (or (and .cse0 .cse1 .cse2) (and .cse2 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3) .cse3) (and .cse0 .cse2 .cse3) (and .cse1 .cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)))) [2023-02-15 19:21:27,116 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L347-2(lines 219 600) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 91) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 459) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L895 garLoopResultBuilder]: At program point L414(lines 405 425) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L447-2(lines 447 459) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8657#1(lines 202 608) the Hoare annotation is: (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 614) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 625) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 636) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L86-2(lines 83 91) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L450(lines 450 455) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 257) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 613) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 624) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 635) no Hoare annotation was computed. [2023-02-15 19:21:27,117 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_switch_1_3#1(lines 214 604) the Hoare annotation is: true [2023-02-15 19:21:27,117 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 594) no Hoare annotation was computed. [2023-02-15 19:21:27,118 INFO L899 garLoopResultBuilder]: For program point L584-1(lines 584 594) no Hoare annotation was computed. [2023-02-15 19:21:27,118 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 522) no Hoare annotation was computed. [2023-02-15 19:21:27,118 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2023-02-15 19:21:27,118 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_switch_1_default#1(lines 217 603) the Hoare annotation is: true [2023-02-15 19:21:27,118 INFO L899 garLoopResultBuilder]: For program point L486(lines 486 490) no Hoare annotation was computed. [2023-02-15 19:21:27,118 INFO L895 garLoopResultBuilder]: At program point L222(lines 115 637) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and .cse0 .cse1) (and .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)))) [2023-02-15 19:21:27,118 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8577#1(lines 178 616) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (and .cse1 .cse0 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-15 19:21:27,118 INFO L902 garLoopResultBuilder]: At program point L685(lines 75 687) the Hoare annotation is: true [2023-02-15 19:21:27,118 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 658) no Hoare annotation was computed. [2023-02-15 19:21:27,118 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 387) no Hoare annotation was computed. [2023-02-15 19:21:27,118 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2023-02-15 19:21:27,118 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 19:21:27,118 INFO L899 garLoopResultBuilder]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2023-02-15 19:21:27,118 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 612) no Hoare annotation was computed. [2023-02-15 19:21:27,118 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 623) no Hoare annotation was computed. [2023-02-15 19:21:27,118 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 634) no Hoare annotation was computed. [2023-02-15 19:21:27,118 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8641#1(lines 196 610) the Hoare annotation is: (or (and (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672) (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (and (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576))) [2023-02-15 19:21:27,118 INFO L899 garLoopResultBuilder]: For program point L587(lines 587 591) no Hoare annotation was computed. [2023-02-15 19:21:27,119 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_ERROR#1(lines 75 687) the Hoare annotation is: false [2023-02-15 19:21:27,119 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_returnLabel#1(lines 20 688) the Hoare annotation is: true [2023-02-15 19:21:27,119 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2023-02-15 19:21:27,119 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 75 687) no Hoare annotation was computed. [2023-02-15 19:21:27,119 INFO L899 garLoopResultBuilder]: For program point L358(lines 358 386) no Hoare annotation was computed. [2023-02-15 19:21:27,119 INFO L899 garLoopResultBuilder]: For program point L358-1(lines 358 386) no Hoare annotation was computed. [2023-02-15 19:21:27,119 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 272) no Hoare annotation was computed. [2023-02-15 19:21:27,119 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 611) no Hoare annotation was computed. [2023-02-15 19:21:27,119 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 622) no Hoare annotation was computed. [2023-02-15 19:21:27,119 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 633) no Hoare annotation was computed. [2023-02-15 19:21:27,119 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2023-02-15 19:21:27,119 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 19:21:27,119 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8673#1(lines 208 606) the Hoare annotation is: (let ((.cse1 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3))) (or (and .cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1) (and .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2) (and .cse1 .cse0 .cse2))) [2023-02-15 19:21:27,119 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 383) no Hoare annotation was computed. [2023-02-15 19:21:27,119 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 231) no Hoare annotation was computed. [2023-02-15 19:21:27,119 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 219 600) no Hoare annotation was computed. [2023-02-15 19:21:27,119 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8609#1(lines 190 612) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (and .cse1 .cse0 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-15 19:21:27,119 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 19:21:27,119 INFO L895 garLoopResultBuilder]: At program point $Ultimate##153(lines 394 431) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-15 19:21:27,119 INFO L899 garLoopResultBuilder]: For program point L261(lines 261 266) no Hoare annotation was computed. [2023-02-15 19:21:27,120 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8466#1(lines 136 630) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and (= 0 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0) (and .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse0) (and .cse2 .cse1 .cse3) (and .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-15 19:21:27,120 INFO L899 garLoopResultBuilder]: For program point L559(lines 559 567) no Hoare annotation was computed. [2023-02-15 19:21:27,120 INFO L895 garLoopResultBuilder]: At program point $Ultimate##161(lines 405 425) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-15 19:21:27,120 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_12292#1(lines 112 638) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-15 19:21:27,120 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 299) no Hoare annotation was computed. [2023-02-15 19:21:27,120 INFO L899 garLoopResultBuilder]: For program point L295-2(lines 219 600) no Hoare annotation was computed. [2023-02-15 19:21:27,120 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 610) no Hoare annotation was computed. [2023-02-15 19:21:27,120 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 621) no Hoare annotation was computed. [2023-02-15 19:21:27,120 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 632) no Hoare annotation was computed. [2023-02-15 19:21:27,120 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 426) no Hoare annotation was computed. [2023-02-15 19:21:27,120 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 382) no Hoare annotation was computed. [2023-02-15 19:21:27,120 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 19:21:27,120 INFO L895 garLoopResultBuilder]: At program point $Ultimate##219(lines 639 667) the Hoare annotation is: (let ((.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse1 .cse2) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8560)) (and (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse0 .cse3) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3) .cse2) (and .cse0 .cse1) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8544) .cse0) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496) (= 1 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse3) (and (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672) (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse3 .cse2))) [2023-02-15 19:21:27,120 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 681) no Hoare annotation was computed. [2023-02-15 19:21:27,120 INFO L899 garLoopResultBuilder]: For program point L396(lines 396 402) no Hoare annotation was computed. [2023-02-15 19:21:27,120 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8561#1(lines 169 619) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-15 19:21:27,121 INFO L899 garLoopResultBuilder]: For program point L562(lines 562 566) no Hoare annotation was computed. [2023-02-15 19:21:27,121 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2023-02-15 19:21:27,121 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 368) no Hoare annotation was computed. [2023-02-15 19:21:27,121 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 331 340) no Hoare annotation was computed. [2023-02-15 19:21:27,121 INFO L899 garLoopResultBuilder]: For program point L364-2(lines 362 380) no Hoare annotation was computed. [2023-02-15 19:21:27,121 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 609) no Hoare annotation was computed. [2023-02-15 19:21:27,121 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 620) no Hoare annotation was computed. [2023-02-15 19:21:27,121 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 631) no Hoare annotation was computed. [2023-02-15 19:21:27,121 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2023-02-15 19:21:27,121 INFO L895 garLoopResultBuilder]: At program point $Ultimate##125(lines 331 340) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2023-02-15 19:21:27,123 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:27,124 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 19:21:27,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 07:21:27 BoogieIcfgContainer [2023-02-15 19:21:27,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 19:21:27,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 19:21:27,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 19:21:27,160 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 19:21:27,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:21:20" (3/4) ... [2023-02-15 19:21:27,174 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 19:21:27,183 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-15 19:21:27,184 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-15 19:21:27,184 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 19:21:27,185 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 19:21:27,224 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 19:21:27,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 19:21:27,225 INFO L158 Benchmark]: Toolchain (without parser) took 8119.25ms. Allocated memory was 167.8MB in the beginning and 295.7MB in the end (delta: 127.9MB). Free memory was 130.4MB in the beginning and 208.7MB in the end (delta: -78.3MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2023-02-15 19:21:27,225 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 127.9MB. Free memory is still 70.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 19:21:27,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.61ms. Allocated memory is still 167.8MB. Free memory was 130.4MB in the beginning and 115.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 19:21:27,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.66ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 111.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 19:21:27,226 INFO L158 Benchmark]: Boogie Preprocessor took 43.93ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 109.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 19:21:27,226 INFO L158 Benchmark]: RCFGBuilder took 577.42ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 76.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-02-15 19:21:27,226 INFO L158 Benchmark]: TraceAbstraction took 7051.37ms. Allocated memory was 167.8MB in the beginning and 295.7MB in the end (delta: 127.9MB). Free memory was 75.2MB in the beginning and 216.0MB in the end (delta: -140.8MB). Peak memory consumption was 130.5MB. Max. memory is 16.1GB. [2023-02-15 19:21:27,226 INFO L158 Benchmark]: Witness Printer took 65.01ms. Allocated memory is still 295.7MB. Free memory was 216.0MB in the beginning and 208.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-15 19:21:27,227 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.18ms. Allocated memory is still 127.9MB. Free memory is still 70.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.61ms. Allocated memory is still 167.8MB. Free memory was 130.4MB in the beginning and 115.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.66ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 111.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.93ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 109.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 577.42ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 76.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7051.37ms. Allocated memory was 167.8MB in the beginning and 295.7MB in the end (delta: 127.9MB). Free memory was 75.2MB in the beginning and 216.0MB in the end (delta: -140.8MB). Peak memory consumption was 130.5MB. Max. memory is 16.1GB. * Witness Printer took 65.01ms. Allocated memory is still 295.7MB. Free memory was 216.0MB in the beginning and 208.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 7.0s, OverallIterations: 20, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1872 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1872 mSDsluCounter, 7377 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3098 mSDsCounter, 508 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2547 IncrementalHoareTripleChecker+Invalid, 3055 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 508 mSolverCounterUnsat, 4279 mSDtfsCounter, 2547 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2020 GetRequests, 1985 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1975occurred in iteration=19, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 729 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 206 NumberOfFragments, 832 HoareAnnotationTreeSize, 29 FomulaSimplifications, 1015 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 29 FomulaSimplificationsInter, 1560 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 5499 NumberOfCodeBlocks, 5499 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6449 ConstructedInterpolants, 0 QuantifiedInterpolants, 8559 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1526 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 26034/26190 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: 112]: Loop Invariant Derived loop invariant: ((2 == blastFlag && 8672 <= s__state) && !(s__hit == 0)) || ((8672 <= s__state && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((!(s__hit == 0) && 2 == blastFlag) && s__state == 8448) || ((s__state == 8448 && s__s3__tmp__next_state___0 == 3) && blastFlag == 3)) || ((!(s__hit == 0) && s__state == 8448) && blastFlag == 3)) || ((2 == blastFlag && s__state == 8448) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((2 == blastFlag && !(8576 <= s__state)) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((2 == blastFlag && !(8576 <= s__state)) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && !(s__hit == 0)) && 1 == blastFlag) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state < 8576)) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3)) || (1 == blastFlag && !(8576 <= s__state)) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: (((s__state < 8656 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: ((2 == blastFlag && !(8576 <= s__state)) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((s__state < 8656 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((0 == blastFlag && s__state < 8576) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state < 8576)) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((s__state < 8656 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((!(s__hit == 0) && 2 == blastFlag) && 8672 <= s__state) || ((8672 <= s__state && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 3)) || ((8672 <= s__state && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state < 8576) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 639]: Loop Invariant Derived loop invariant: (((((((((((2 == blastFlag && s__state == 8528) || s__state == 3) || (!(s__hit == 0) && blastFlag == 3)) || (2 == blastFlag && s__state == 8560)) || ((s__state < 8656 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state == 8448 && s__s3__tmp__next_state___0 == 3) && blastFlag == 3)) || (2 == blastFlag && !(s__hit == 0))) || (s__state == 8544 && 2 == blastFlag)) || (2 == blastFlag && s__state == 8512)) || (s__state == 8496 && 1 == blastFlag)) || ((2 == blastFlag && s__state == 8656) && s__s3__tmp__next_state___0 <= 8576)) || (((s__state <= 8672 && 8672 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 3) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (s__state <= 8672 && !(s__hit == 0)) || ((s__state < 8656 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((!(s__hit == 0) && blastFlag == 3) || (!(s__hit == 0) && 2 == blastFlag)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state < 8576) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((2 == blastFlag && !(8576 <= s__state)) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: s__state <= 8672 - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((2 == blastFlag && !(8576 <= s__state)) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: ((2 == blastFlag && !(8576 <= s__state)) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((s__state <= 8672 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((0 == blastFlag && s__state == 8464) || ((2 == blastFlag && s__state == 8656) && s__s3__tmp__next_state___0 <= 8576)) || (2 == blastFlag && s__state == 8528)) || s__state == 3) || (!(s__hit == 0) && blastFlag == 3)) || (2 == blastFlag && s__state == 8560)) || ((s__state < 8656 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state == 8448 && s__s3__tmp__next_state___0 == 3) && blastFlag == 3)) || (2 == blastFlag && !(s__hit == 0))) || (s__state == 8544 && 2 == blastFlag)) || (2 == blastFlag && s__state == 8512)) || (s__state == 8496 && 1 == blastFlag)) || (((s__state <= 8672 && 8672 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 3) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: ((2 == blastFlag && !(8576 <= s__state)) || ((s__state <= 8672 && 2 == blastFlag) && !(s__hit == 0))) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) RESULT: Ultimate proved your program to be correct! [2023-02-15 19:21:27,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE