./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 112291a0afbd95f38753698288bc21e678f8fc599868e66751c5bf984ca2e210 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 21:48:21,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 21:48:21,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 21:48:21,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 21:48:21,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 21:48:21,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 21:48:21,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 21:48:21,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 21:48:21,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 21:48:21,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 21:48:21,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 21:48:21,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 21:48:21,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 21:48:21,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 21:48:21,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 21:48:21,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 21:48:21,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 21:48:21,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 21:48:21,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 21:48:21,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 21:48:21,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 21:48:21,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 21:48:21,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 21:48:21,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 21:48:21,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 21:48:21,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 21:48:21,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 21:48:21,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 21:48:21,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 21:48:21,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 21:48:21,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 21:48:21,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 21:48:21,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 21:48:21,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 21:48:21,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 21:48:21,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 21:48:21,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 21:48:21,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 21:48:21,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 21:48:21,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 21:48:21,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 21:48:21,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 21:48:21,413 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 21:48:21,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 21:48:21,414 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 21:48:21,414 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 21:48:21,416 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 21:48:21,416 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 21:48:21,416 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 21:48:21,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 21:48:21,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 21:48:21,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 21:48:21,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 21:48:21,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 21:48:21,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 21:48:21,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 21:48:21,419 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 21:48:21,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 21:48:21,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 21:48:21,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 21:48:21,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 21:48:21,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:48:21,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 21:48:21,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 21:48:21,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 21:48:21,420 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 21:48:21,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 21:48:21,421 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 21:48:21,421 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 21:48:21,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 21:48:21,421 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 21:48:21,421 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 112291a0afbd95f38753698288bc21e678f8fc599868e66751c5bf984ca2e210 [2021-11-06 21:48:21,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 21:48:21,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 21:48:21,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 21:48:21,649 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 21:48:21,649 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 21:48:21,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i [2021-11-06 21:48:21,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02f02d91/f22eeeca3ac24e87b383f6a1d04408ea/FLAG027b127a0 [2021-11-06 21:48:22,396 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 21:48:22,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i [2021-11-06 21:48:22,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02f02d91/f22eeeca3ac24e87b383f6a1d04408ea/FLAG027b127a0 [2021-11-06 21:48:22,468 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02f02d91/f22eeeca3ac24e87b383f6a1d04408ea [2021-11-06 21:48:22,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 21:48:22,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 21:48:22,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 21:48:22,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 21:48:22,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 21:48:22,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:48:22" (1/1) ... [2021-11-06 21:48:22,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bf511d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:22, skipping insertion in model container [2021-11-06 21:48:22,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:48:22" (1/1) ... [2021-11-06 21:48:22,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 21:48:22,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 21:48:25,721 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[399219,399232] [2021-11-06 21:48:25,724 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[399364,399377] [2021-11-06 21:48:25,724 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[399510,399523] [2021-11-06 21:48:25,725 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[399675,399688] [2021-11-06 21:48:25,725 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[399833,399846] [2021-11-06 21:48:25,726 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[399991,400004] [2021-11-06 21:48:25,727 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[400149,400162] [2021-11-06 21:48:25,727 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[400309,400322] [2021-11-06 21:48:25,728 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[400468,400481] [2021-11-06 21:48:25,728 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[400607,400620] [2021-11-06 21:48:25,728 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[400749,400762] [2021-11-06 21:48:25,733 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[400898,400911] [2021-11-06 21:48:25,757 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[401037,401050] [2021-11-06 21:48:25,758 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[401192,401205] [2021-11-06 21:48:25,758 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[401352,401365] [2021-11-06 21:48:25,758 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[401503,401516] [2021-11-06 21:48:25,758 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[401654,401667] [2021-11-06 21:48:25,759 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[401806,401819] [2021-11-06 21:48:25,759 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[401955,401968] [2021-11-06 21:48:25,759 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[402103,402116] [2021-11-06 21:48:25,760 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[402260,402273] [2021-11-06 21:48:25,760 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[402409,402422] [2021-11-06 21:48:25,760 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[402565,402578] [2021-11-06 21:48:25,760 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[402718,402731] [2021-11-06 21:48:25,761 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[402864,402877] [2021-11-06 21:48:25,761 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[403007,403020] [2021-11-06 21:48:25,761 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[403159,403172] [2021-11-06 21:48:25,762 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[403305,403318] [2021-11-06 21:48:25,762 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[403450,403463] [2021-11-06 21:48:25,762 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[403604,403617] [2021-11-06 21:48:25,762 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[403755,403768] [2021-11-06 21:48:25,763 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[403910,403923] [2021-11-06 21:48:25,764 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[404062,404075] [2021-11-06 21:48:25,766 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[404217,404230] [2021-11-06 21:48:25,766 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[404381,404394] [2021-11-06 21:48:25,767 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[404537,404550] [2021-11-06 21:48:25,767 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[404701,404714] [2021-11-06 21:48:25,767 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[404843,404856] [2021-11-06 21:48:25,767 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[405001,405014] [2021-11-06 21:48:25,768 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[405168,405181] [2021-11-06 21:48:25,768 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[405327,405340] [2021-11-06 21:48:25,768 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[405486,405499] [2021-11-06 21:48:25,769 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[405635,405648] [2021-11-06 21:48:25,769 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[405782,405795] [2021-11-06 21:48:25,769 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[405921,405934] [2021-11-06 21:48:25,770 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[406084,406097] [2021-11-06 21:48:25,770 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[406250,406263] [2021-11-06 21:48:25,771 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[406414,406427] [2021-11-06 21:48:25,771 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[406579,406592] [2021-11-06 21:48:25,771 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[406744,406757] [2021-11-06 21:48:25,772 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[406910,406923] [2021-11-06 21:48:25,772 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[407075,407088] [2021-11-06 21:48:25,772 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[407242,407255] [2021-11-06 21:48:25,773 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[407402,407415] [2021-11-06 21:48:25,773 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[407564,407577] [2021-11-06 21:48:25,773 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[407723,407736] [2021-11-06 21:48:25,774 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[407869,407882] [2021-11-06 21:48:25,774 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[408012,408025] [2021-11-06 21:48:25,774 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[408156,408169] [2021-11-06 21:48:25,775 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[408299,408312] [2021-11-06 21:48:25,775 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[408443,408456] [2021-11-06 21:48:25,776 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[408584,408597] [2021-11-06 21:48:25,776 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[408722,408735] [2021-11-06 21:48:25,777 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[408880,408893] [2021-11-06 21:48:25,777 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[409039,409052] [2021-11-06 21:48:25,777 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[409195,409208] [2021-11-06 21:48:25,778 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[409344,409357] [2021-11-06 21:48:25,778 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[409496,409509] [2021-11-06 21:48:25,778 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[409647,409660] [2021-11-06 21:48:25,779 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[409796,409809] [2021-11-06 21:48:25,779 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[409948,409961] [2021-11-06 21:48:25,779 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[410096,410109] [2021-11-06 21:48:25,780 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[410249,410262] [2021-11-06 21:48:25,780 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[410400,410413] [2021-11-06 21:48:25,780 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[410550,410563] [2021-11-06 21:48:25,781 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[410697,410710] [2021-11-06 21:48:25,781 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[410848,410861] [2021-11-06 21:48:25,781 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[410999,411012] [2021-11-06 21:48:25,782 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[411147,411160] [2021-11-06 21:48:25,782 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[411313,411326] [2021-11-06 21:48:25,782 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[411482,411495] [2021-11-06 21:48:25,783 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[411649,411662] [2021-11-06 21:48:25,783 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[411817,411830] [2021-11-06 21:48:25,783 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[411967,411980] [2021-11-06 21:48:25,784 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[412114,412127] [2021-11-06 21:48:25,784 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[412275,412288] [2021-11-06 21:48:25,784 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[412445,412458] [2021-11-06 21:48:25,785 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[412607,412620] [2021-11-06 21:48:25,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:48:25,834 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 21:48:26,087 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[399219,399232] [2021-11-06 21:48:26,087 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[399364,399377] [2021-11-06 21:48:26,088 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[399510,399523] [2021-11-06 21:48:26,088 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[399675,399688] [2021-11-06 21:48:26,089 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[399833,399846] [2021-11-06 21:48:26,089 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[399991,400004] [2021-11-06 21:48:26,089 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[400149,400162] [2021-11-06 21:48:26,090 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[400309,400322] [2021-11-06 21:48:26,090 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[400468,400481] [2021-11-06 21:48:26,090 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[400607,400620] [2021-11-06 21:48:26,091 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[400749,400762] [2021-11-06 21:48:26,091 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[400898,400911] [2021-11-06 21:48:26,092 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[401037,401050] [2021-11-06 21:48:26,092 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[401192,401205] [2021-11-06 21:48:26,092 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[401352,401365] [2021-11-06 21:48:26,093 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[401503,401516] [2021-11-06 21:48:26,093 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[401654,401667] [2021-11-06 21:48:26,093 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[401806,401819] [2021-11-06 21:48:26,094 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[401955,401968] [2021-11-06 21:48:26,094 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[402103,402116] [2021-11-06 21:48:26,094 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[402260,402273] [2021-11-06 21:48:26,095 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[402409,402422] [2021-11-06 21:48:26,095 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[402565,402578] [2021-11-06 21:48:26,095 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[402718,402731] [2021-11-06 21:48:26,096 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[402864,402877] [2021-11-06 21:48:26,096 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[403007,403020] [2021-11-06 21:48:26,096 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[403159,403172] [2021-11-06 21:48:26,097 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[403305,403318] [2021-11-06 21:48:26,097 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[403450,403463] [2021-11-06 21:48:26,097 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[403604,403617] [2021-11-06 21:48:26,098 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[403755,403768] [2021-11-06 21:48:26,098 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[403910,403923] [2021-11-06 21:48:26,099 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[404062,404075] [2021-11-06 21:48:26,099 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[404217,404230] [2021-11-06 21:48:26,099 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[404381,404394] [2021-11-06 21:48:26,100 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[404537,404550] [2021-11-06 21:48:26,100 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[404701,404714] [2021-11-06 21:48:26,100 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[404843,404856] [2021-11-06 21:48:26,101 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[405001,405014] [2021-11-06 21:48:26,101 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[405168,405181] [2021-11-06 21:48:26,101 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[405327,405340] [2021-11-06 21:48:26,102 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[405486,405499] [2021-11-06 21:48:26,102 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[405635,405648] [2021-11-06 21:48:26,102 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[405782,405795] [2021-11-06 21:48:26,103 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[405921,405934] [2021-11-06 21:48:26,103 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[406084,406097] [2021-11-06 21:48:26,103 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[406250,406263] [2021-11-06 21:48:26,104 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[406414,406427] [2021-11-06 21:48:26,104 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[406579,406592] [2021-11-06 21:48:26,104 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[406744,406757] [2021-11-06 21:48:26,105 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[406910,406923] [2021-11-06 21:48:26,105 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[407075,407088] [2021-11-06 21:48:26,106 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[407242,407255] [2021-11-06 21:48:26,106 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[407402,407415] [2021-11-06 21:48:26,106 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[407564,407577] [2021-11-06 21:48:26,107 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[407723,407736] [2021-11-06 21:48:26,107 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[407869,407882] [2021-11-06 21:48:26,107 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[408012,408025] [2021-11-06 21:48:26,108 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[408156,408169] [2021-11-06 21:48:26,108 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[408299,408312] [2021-11-06 21:48:26,108 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[408443,408456] [2021-11-06 21:48:26,109 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[408584,408597] [2021-11-06 21:48:26,110 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[408722,408735] [2021-11-06 21:48:26,110 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[408880,408893] [2021-11-06 21:48:26,111 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[409039,409052] [2021-11-06 21:48:26,111 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[409195,409208] [2021-11-06 21:48:26,111 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[409344,409357] [2021-11-06 21:48:26,112 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[409496,409509] [2021-11-06 21:48:26,112 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[409647,409660] [2021-11-06 21:48:26,112 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[409796,409809] [2021-11-06 21:48:26,113 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[409948,409961] [2021-11-06 21:48:26,113 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[410096,410109] [2021-11-06 21:48:26,113 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[410249,410262] [2021-11-06 21:48:26,114 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[410400,410413] [2021-11-06 21:48:26,114 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[410550,410563] [2021-11-06 21:48:26,115 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[410697,410710] [2021-11-06 21:48:26,115 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[410848,410861] [2021-11-06 21:48:26,115 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[410999,411012] [2021-11-06 21:48:26,116 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[411147,411160] [2021-11-06 21:48:26,116 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[411313,411326] [2021-11-06 21:48:26,148 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[411482,411495] [2021-11-06 21:48:26,149 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[411649,411662] [2021-11-06 21:48:26,149 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[411817,411830] [2021-11-06 21:48:26,149 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[411967,411980] [2021-11-06 21:48:26,149 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[412114,412127] [2021-11-06 21:48:26,150 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[412275,412288] [2021-11-06 21:48:26,150 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[412445,412458] [2021-11-06 21:48:26,150 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i[412607,412620] [2021-11-06 21:48:26,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:48:26,329 INFO L208 MainTranslator]: Completed translation [2021-11-06 21:48:26,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:26 WrapperNode [2021-11-06 21:48:26,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 21:48:26,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 21:48:26,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 21:48:26,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 21:48:26,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:26" (1/1) ... [2021-11-06 21:48:26,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:26" (1/1) ... [2021-11-06 21:48:28,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 21:48:28,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 21:48:28,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 21:48:28,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 21:48:28,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:26" (1/1) ... [2021-11-06 21:48:28,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:26" (1/1) ... [2021-11-06 21:48:29,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:26" (1/1) ... [2021-11-06 21:48:29,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:26" (1/1) ... [2021-11-06 21:48:29,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:26" (1/1) ... [2021-11-06 21:48:29,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:26" (1/1) ... [2021-11-06 21:48:29,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:26" (1/1) ... [2021-11-06 21:48:30,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 21:48:30,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 21:48:30,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 21:48:30,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 21:48:30,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:26" (1/1) ... [2021-11-06 21:48:30,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:48:30,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:48:30,200 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) [2021-11-06 21:48:30,224 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 [2021-11-06 21:48:30,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 21:48:30,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 21:48:30,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 21:48:30,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 21:48:30,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 21:48:30,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 21:48:30,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 21:48:30,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 21:48:30,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 21:48:30,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 21:48:30,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 21:48:30,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 21:48:30,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 21:48:30,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 21:48:30,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 21:48:49,537 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_14_returnLabel: main_#res := 0; [2021-11-06 21:48:49,538 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_pci_pci_instance_2_switch_break: call ULTIMATE.dealloc(ldv_pci_pci_instance_2_~#ldv_2_resource_pm_message~0.base, ldv_pci_pci_instance_2_~#ldv_2_resource_pm_message~0.offset);havoc ldv_pci_pci_instance_2_~#ldv_2_resource_pm_message~0.base, ldv_pci_pci_instance_2_~#ldv_2_resource_pm_message~0.offset; [2021-11-06 21:48:49,542 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 21:48:49,542 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L10059: #t~ret1239 := main_#res; [2021-11-06 21:48:49,588 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 21:48:49,588 INFO L299 CfgBuilder]: Removed 19338 assume(true) statements. [2021-11-06 21:48:49,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:48:49 BoogieIcfgContainer [2021-11-06 21:48:49,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 21:48:49,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 21:48:49,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 21:48:49,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 21:48:49,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:48:22" (1/3) ... [2021-11-06 21:48:49,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1242105c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:48:49, skipping insertion in model container [2021-11-06 21:48:49,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:48:26" (2/3) ... [2021-11-06 21:48:49,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1242105c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:48:49, skipping insertion in model container [2021-11-06 21:48:49,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:48:49" (3/3) ... [2021-11-06 21:48:49,632 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--dec--tulip--dmfe.ko.cil.i [2021-11-06 21:48:49,636 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 21:48:49,636 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 101 error locations. [2021-11-06 21:48:49,706 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 21:48:49,710 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 21:48:49,711 INFO L340 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2021-11-06 21:48:49,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 11774 states, 11673 states have (on average 1.1842713955281419) internal successors, (13824), 11773 states have internal predecessors, (13824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:49,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-06 21:48:49,857 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:48:49,857 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:48:49,859 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:48:49,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:48:49,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1800134205, now seen corresponding path program 1 times [2021-11-06 21:48:49,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:48:49,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305760225] [2021-11-06 21:48:49,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:48:49,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:48:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:48:50,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:48:50,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:48:50,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305760225] [2021-11-06 21:48:50,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305760225] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:48:50,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:48:50,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 21:48:50,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053813149] [2021-11-06 21:48:50,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:48:50,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:48:50,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:48:50,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:48:50,567 INFO L87 Difference]: Start difference. First operand has 11774 states, 11673 states have (on average 1.1842713955281419) internal successors, (13824), 11773 states have internal predecessors, (13824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:51,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:48:51,014 INFO L93 Difference]: Finished difference Result 23541 states and 27638 transitions. [2021-11-06 21:48:51,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:48:51,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-11-06 21:48:51,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:48:51,077 INFO L225 Difference]: With dead ends: 23541 [2021-11-06 21:48:51,077 INFO L226 Difference]: Without dead ends: 11668 [2021-11-06 21:48:51,109 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:48:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11668 states. [2021-11-06 21:48:51,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11668 to 11668. [2021-11-06 21:48:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11668 states, 11567 states have (on average 1.1649520186738134) internal successors, (13475), 11667 states have internal predecessors, (13475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11668 states to 11668 states and 13475 transitions. [2021-11-06 21:48:51,532 INFO L78 Accepts]: Start accepts. Automaton has 11668 states and 13475 transitions. Word has length 37 [2021-11-06 21:48:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:48:51,533 INFO L470 AbstractCegarLoop]: Abstraction has 11668 states and 13475 transitions. [2021-11-06 21:48:51,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 11668 states and 13475 transitions. [2021-11-06 21:48:51,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-06 21:48:51,539 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:48:51,539 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:48:51,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 21:48:51,540 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:48:51,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:48:51,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1525374591, now seen corresponding path program 1 times [2021-11-06 21:48:51,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:48:51,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789626736] [2021-11-06 21:48:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:48:51,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:48:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:48:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:48:51,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:48:51,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789626736] [2021-11-06 21:48:51,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789626736] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:48:51,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:48:51,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:48:51,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556014100] [2021-11-06 21:48:51,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:48:51,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:48:51,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:48:51,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:48:51,802 INFO L87 Difference]: Start difference. First operand 11668 states and 13475 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:52,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:48:52,370 INFO L93 Difference]: Finished difference Result 11668 states and 13475 transitions. [2021-11-06 21:48:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:48:52,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-11-06 21:48:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:48:52,414 INFO L225 Difference]: With dead ends: 11668 [2021-11-06 21:48:52,414 INFO L226 Difference]: Without dead ends: 11664 [2021-11-06 21:48:52,421 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:48:52,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11664 states. [2021-11-06 21:48:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11664 to 11664. [2021-11-06 21:48:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11664 states, 11565 states have (on average 1.164807609165586) internal successors, (13471), 11663 states have internal predecessors, (13471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11664 states to 11664 states and 13471 transitions. [2021-11-06 21:48:52,794 INFO L78 Accepts]: Start accepts. Automaton has 11664 states and 13471 transitions. Word has length 37 [2021-11-06 21:48:52,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:48:52,796 INFO L470 AbstractCegarLoop]: Abstraction has 11664 states and 13471 transitions. [2021-11-06 21:48:52,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 11664 states and 13471 transitions. [2021-11-06 21:48:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 21:48:52,799 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:48:52,799 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:48:52,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 21:48:52,800 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:48:52,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:48:52,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1300231355, now seen corresponding path program 1 times [2021-11-06 21:48:52,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:48:52,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464600776] [2021-11-06 21:48:52,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:48:52,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:48:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:48:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:48:53,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:48:53,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464600776] [2021-11-06 21:48:53,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464600776] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:48:53,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:48:53,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:48:53,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556765626] [2021-11-06 21:48:53,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:48:53,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:48:53,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:48:53,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:48:53,018 INFO L87 Difference]: Start difference. First operand 11664 states and 13471 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:48:53,340 INFO L93 Difference]: Finished difference Result 11664 states and 13471 transitions. [2021-11-06 21:48:53,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:48:53,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2021-11-06 21:48:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:48:53,394 INFO L225 Difference]: With dead ends: 11664 [2021-11-06 21:48:53,395 INFO L226 Difference]: Without dead ends: 11660 [2021-11-06 21:48:53,403 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:48:53,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11660 states. [2021-11-06 21:48:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11660 to 11660. [2021-11-06 21:48:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11660 states, 11563 states have (on average 1.1646631497016344) internal successors, (13467), 11659 states have internal predecessors, (13467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11660 states to 11660 states and 13467 transitions. [2021-11-06 21:48:53,847 INFO L78 Accepts]: Start accepts. Automaton has 11660 states and 13467 transitions. Word has length 39 [2021-11-06 21:48:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:48:53,847 INFO L470 AbstractCegarLoop]: Abstraction has 11660 states and 13467 transitions. [2021-11-06 21:48:53,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 11660 states and 13467 transitions. [2021-11-06 21:48:53,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 21:48:53,853 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:48:53,853 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:48:53,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 21:48:53,853 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:48:53,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:48:53,854 INFO L85 PathProgramCache]: Analyzing trace with hash 314053993, now seen corresponding path program 1 times [2021-11-06 21:48:53,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:48:53,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407239517] [2021-11-06 21:48:53,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:48:53,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:48:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:48:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:48:54,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:48:54,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407239517] [2021-11-06 21:48:54,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407239517] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:48:54,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:48:54,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:48:54,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623051722] [2021-11-06 21:48:54,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:48:54,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:48:54,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:48:54,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:48:54,068 INFO L87 Difference]: Start difference. First operand 11660 states and 13467 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:48:54,417 INFO L93 Difference]: Finished difference Result 11660 states and 13467 transitions. [2021-11-06 21:48:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:48:54,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-11-06 21:48:54,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:48:54,450 INFO L225 Difference]: With dead ends: 11660 [2021-11-06 21:48:54,450 INFO L226 Difference]: Without dead ends: 11656 [2021-11-06 21:48:54,456 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:48:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11656 states. [2021-11-06 21:48:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11656 to 11656. [2021-11-06 21:48:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11656 states, 11561 states have (on average 1.1645186402560332) internal successors, (13463), 11655 states have internal predecessors, (13463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11656 states to 11656 states and 13463 transitions. [2021-11-06 21:48:54,884 INFO L78 Accepts]: Start accepts. Automaton has 11656 states and 13463 transitions. Word has length 41 [2021-11-06 21:48:54,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:48:54,886 INFO L470 AbstractCegarLoop]: Abstraction has 11656 states and 13463 transitions. [2021-11-06 21:48:54,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 11656 states and 13463 transitions. [2021-11-06 21:48:54,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 21:48:54,888 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:48:54,889 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:48:54,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 21:48:54,890 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:48:54,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:48:54,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1159079917, now seen corresponding path program 1 times [2021-11-06 21:48:54,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:48:54,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184387060] [2021-11-06 21:48:54,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:48:54,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:48:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:48:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:48:55,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:48:55,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184387060] [2021-11-06 21:48:55,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184387060] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:48:55,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:48:55,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:48:55,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518381096] [2021-11-06 21:48:55,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:48:55,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:48:55,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:48:55,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:48:55,066 INFO L87 Difference]: Start difference. First operand 11656 states and 13463 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:55,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:48:55,389 INFO L93 Difference]: Finished difference Result 11656 states and 13463 transitions. [2021-11-06 21:48:55,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:48:55,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-06 21:48:55,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:48:55,416 INFO L225 Difference]: With dead ends: 11656 [2021-11-06 21:48:55,416 INFO L226 Difference]: Without dead ends: 11652 [2021-11-06 21:48:55,423 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:48:55,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11652 states. [2021-11-06 21:48:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11652 to 11652. [2021-11-06 21:48:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11652 states, 11559 states have (on average 1.1643740808028376) internal successors, (13459), 11651 states have internal predecessors, (13459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11652 states to 11652 states and 13459 transitions. [2021-11-06 21:48:55,820 INFO L78 Accepts]: Start accepts. Automaton has 11652 states and 13459 transitions. Word has length 43 [2021-11-06 21:48:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:48:55,820 INFO L470 AbstractCegarLoop]: Abstraction has 11652 states and 13459 transitions. [2021-11-06 21:48:55,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:55,821 INFO L276 IsEmpty]: Start isEmpty. Operand 11652 states and 13459 transitions. [2021-11-06 21:48:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-06 21:48:55,822 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:48:55,822 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:48:55,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 21:48:55,822 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:48:55,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:48:55,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1480174289, now seen corresponding path program 1 times [2021-11-06 21:48:55,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:48:55,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113540750] [2021-11-06 21:48:55,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:48:55,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:48:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:48:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:48:55,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:48:55,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113540750] [2021-11-06 21:48:55,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113540750] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:48:55,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:48:55,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:48:55,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218887160] [2021-11-06 21:48:55,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:48:55,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:48:55,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:48:55,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:48:55,966 INFO L87 Difference]: Start difference. First operand 11652 states and 13459 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:56,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:48:56,305 INFO L93 Difference]: Finished difference Result 11652 states and 13459 transitions. [2021-11-06 21:48:56,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:48:56,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-06 21:48:56,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:48:56,333 INFO L225 Difference]: With dead ends: 11652 [2021-11-06 21:48:56,334 INFO L226 Difference]: Without dead ends: 11648 [2021-11-06 21:48:56,340 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:48:56,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11648 states. [2021-11-06 21:48:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11648 to 11648. [2021-11-06 21:48:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11648 states, 11557 states have (on average 1.1642294713160855) internal successors, (13455), 11647 states have internal predecessors, (13455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11648 states to 11648 states and 13455 transitions. [2021-11-06 21:48:56,763 INFO L78 Accepts]: Start accepts. Automaton has 11648 states and 13455 transitions. Word has length 45 [2021-11-06 21:48:56,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:48:56,763 INFO L470 AbstractCegarLoop]: Abstraction has 11648 states and 13455 transitions. [2021-11-06 21:48:56,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand 11648 states and 13455 transitions. [2021-11-06 21:48:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 21:48:56,765 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:48:56,765 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:48:56,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 21:48:56,765 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:48:56,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:48:56,766 INFO L85 PathProgramCache]: Analyzing trace with hash 814220821, now seen corresponding path program 1 times [2021-11-06 21:48:56,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:48:56,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49338793] [2021-11-06 21:48:56,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:48:56,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:48:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:48:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:48:56,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:48:56,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49338793] [2021-11-06 21:48:56,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49338793] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:48:56,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:48:56,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:48:56,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543406633] [2021-11-06 21:48:56,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:48:56,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:48:56,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:48:56,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:48:56,931 INFO L87 Difference]: Start difference. First operand 11648 states and 13455 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:57,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:48:57,398 INFO L93 Difference]: Finished difference Result 11648 states and 13455 transitions. [2021-11-06 21:48:57,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:48:57,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-06 21:48:57,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:48:57,423 INFO L225 Difference]: With dead ends: 11648 [2021-11-06 21:48:57,423 INFO L226 Difference]: Without dead ends: 11644 [2021-11-06 21:48:57,430 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:48:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11644 states. [2021-11-06 21:48:57,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11644 to 11644. [2021-11-06 21:48:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11644 states, 11555 states have (on average 1.1640848117697966) internal successors, (13451), 11643 states have internal predecessors, (13451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11644 states to 11644 states and 13451 transitions. [2021-11-06 21:48:57,896 INFO L78 Accepts]: Start accepts. Automaton has 11644 states and 13451 transitions. Word has length 47 [2021-11-06 21:48:57,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:48:57,896 INFO L470 AbstractCegarLoop]: Abstraction has 11644 states and 13451 transitions. [2021-11-06 21:48:57,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:57,897 INFO L276 IsEmpty]: Start isEmpty. Operand 11644 states and 13451 transitions. [2021-11-06 21:48:57,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 21:48:57,897 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:48:57,897 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:48:57,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 21:48:57,898 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:48:57,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:48:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash 783065529, now seen corresponding path program 1 times [2021-11-06 21:48:57,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:48:57,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613806684] [2021-11-06 21:48:57,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:48:57,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:48:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:48:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:48:58,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:48:58,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613806684] [2021-11-06 21:48:58,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613806684] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:48:58,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:48:58,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:48:58,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561961875] [2021-11-06 21:48:58,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:48:58,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:48:58,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:48:58,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:48:58,042 INFO L87 Difference]: Start difference. First operand 11644 states and 13451 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:48:58,443 INFO L93 Difference]: Finished difference Result 11644 states and 13451 transitions. [2021-11-06 21:48:58,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:48:58,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-06 21:48:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:48:58,471 INFO L225 Difference]: With dead ends: 11644 [2021-11-06 21:48:58,471 INFO L226 Difference]: Without dead ends: 11640 [2021-11-06 21:48:58,478 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:48:58,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11640 states. [2021-11-06 21:48:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11640 to 11640. [2021-11-06 21:48:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11640 states, 11553 states have (on average 1.1639401021379727) internal successors, (13447), 11639 states have internal predecessors, (13447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11640 states to 11640 states and 13447 transitions. [2021-11-06 21:48:59,006 INFO L78 Accepts]: Start accepts. Automaton has 11640 states and 13447 transitions. Word has length 49 [2021-11-06 21:48:59,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:48:59,006 INFO L470 AbstractCegarLoop]: Abstraction has 11640 states and 13447 transitions. [2021-11-06 21:48:59,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 11640 states and 13447 transitions. [2021-11-06 21:48:59,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 21:48:59,007 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:48:59,007 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:48:59,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 21:48:59,007 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:48:59,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:48:59,008 INFO L85 PathProgramCache]: Analyzing trace with hash 907601341, now seen corresponding path program 1 times [2021-11-06 21:48:59,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:48:59,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019373415] [2021-11-06 21:48:59,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:48:59,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:48:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:48:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:48:59,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:48:59,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019373415] [2021-11-06 21:48:59,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019373415] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:48:59,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:48:59,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:48:59,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388557161] [2021-11-06 21:48:59,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:48:59,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:48:59,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:48:59,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:48:59,136 INFO L87 Difference]: Start difference. First operand 11640 states and 13447 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:48:59,455 INFO L93 Difference]: Finished difference Result 11640 states and 13447 transitions. [2021-11-06 21:48:59,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:48:59,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-06 21:48:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:48:59,477 INFO L225 Difference]: With dead ends: 11640 [2021-11-06 21:48:59,477 INFO L226 Difference]: Without dead ends: 11636 [2021-11-06 21:48:59,483 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:48:59,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11636 states. [2021-11-06 21:48:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11636 to 11636. [2021-11-06 21:48:59,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11636 states, 11551 states have (on average 1.163795342394598) internal successors, (13443), 11635 states have internal predecessors, (13443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11636 states to 11636 states and 13443 transitions. [2021-11-06 21:48:59,903 INFO L78 Accepts]: Start accepts. Automaton has 11636 states and 13443 transitions. Word has length 51 [2021-11-06 21:48:59,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:48:59,904 INFO L470 AbstractCegarLoop]: Abstraction has 11636 states and 13443 transitions. [2021-11-06 21:48:59,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:48:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 11636 states and 13443 transitions. [2021-11-06 21:48:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 21:48:59,904 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:48:59,904 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:48:59,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 21:48:59,905 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:48:59,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:48:59,905 INFO L85 PathProgramCache]: Analyzing trace with hash 327431744, now seen corresponding path program 1 times [2021-11-06 21:48:59,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:48:59,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760570198] [2021-11-06 21:48:59,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:48:59,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:48:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:00,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:00,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760570198] [2021-11-06 21:49:00,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760570198] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:00,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:00,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:49:00,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306971880] [2021-11-06 21:49:00,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:49:00,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:00,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:49:00,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:49:00,056 INFO L87 Difference]: Start difference. First operand 11636 states and 13443 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:00,490 INFO L93 Difference]: Finished difference Result 11636 states and 13443 transitions. [2021-11-06 21:49:00,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:49:00,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-11-06 21:49:00,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:00,510 INFO L225 Difference]: With dead ends: 11636 [2021-11-06 21:49:00,511 INFO L226 Difference]: Without dead ends: 11632 [2021-11-06 21:49:00,519 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:49:00,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11632 states. [2021-11-06 21:49:00,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11632 to 11632. [2021-11-06 21:49:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11632 states, 11549 states have (on average 1.1636505325136375) internal successors, (13439), 11631 states have internal predecessors, (13439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11632 states to 11632 states and 13439 transitions. [2021-11-06 21:49:00,935 INFO L78 Accepts]: Start accepts. Automaton has 11632 states and 13439 transitions. Word has length 53 [2021-11-06 21:49:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:00,935 INFO L470 AbstractCegarLoop]: Abstraction has 11632 states and 13439 transitions. [2021-11-06 21:49:00,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:00,936 INFO L276 IsEmpty]: Start isEmpty. Operand 11632 states and 13439 transitions. [2021-11-06 21:49:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 21:49:00,936 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:00,936 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:00,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 21:49:00,936 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:00,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:00,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1130198820, now seen corresponding path program 1 times [2021-11-06 21:49:00,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:00,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982684878] [2021-11-06 21:49:00,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:00,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:01,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:01,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982684878] [2021-11-06 21:49:01,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982684878] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:01,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:01,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:49:01,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111494515] [2021-11-06 21:49:01,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:49:01,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:01,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:49:01,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:49:01,061 INFO L87 Difference]: Start difference. First operand 11632 states and 13439 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:01,525 INFO L93 Difference]: Finished difference Result 11632 states and 13439 transitions. [2021-11-06 21:49:01,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:49:01,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-11-06 21:49:01,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:01,547 INFO L225 Difference]: With dead ends: 11632 [2021-11-06 21:49:01,547 INFO L226 Difference]: Without dead ends: 11628 [2021-11-06 21:49:01,554 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:49:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11628 states. [2021-11-06 21:49:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11628 to 11628. [2021-11-06 21:49:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11628 states, 11547 states have (on average 1.1635056724690396) internal successors, (13435), 11627 states have internal predecessors, (13435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11628 states to 11628 states and 13435 transitions. [2021-11-06 21:49:01,989 INFO L78 Accepts]: Start accepts. Automaton has 11628 states and 13435 transitions. Word has length 55 [2021-11-06 21:49:01,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:01,989 INFO L470 AbstractCegarLoop]: Abstraction has 11628 states and 13435 transitions. [2021-11-06 21:49:01,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 11628 states and 13435 transitions. [2021-11-06 21:49:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 21:49:01,989 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:01,990 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:01,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 21:49:01,990 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:01,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:01,990 INFO L85 PathProgramCache]: Analyzing trace with hash -504754072, now seen corresponding path program 1 times [2021-11-06 21:49:01,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:01,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322578245] [2021-11-06 21:49:01,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:01,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:02,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:02,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322578245] [2021-11-06 21:49:02,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322578245] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:02,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:02,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:49:02,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874933478] [2021-11-06 21:49:02,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:49:02,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:02,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:49:02,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:49:02,117 INFO L87 Difference]: Start difference. First operand 11628 states and 13435 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:02,528 INFO L93 Difference]: Finished difference Result 11628 states and 13435 transitions. [2021-11-06 21:49:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:49:02,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-11-06 21:49:02,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:02,544 INFO L225 Difference]: With dead ends: 11628 [2021-11-06 21:49:02,544 INFO L226 Difference]: Without dead ends: 11624 [2021-11-06 21:49:02,549 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:49:02,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11624 states. [2021-11-06 21:49:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11624 to 11624. [2021-11-06 21:49:03,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11624 states, 11545 states have (on average 1.1633607622347337) internal successors, (13431), 11623 states have internal predecessors, (13431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11624 states to 11624 states and 13431 transitions. [2021-11-06 21:49:03,019 INFO L78 Accepts]: Start accepts. Automaton has 11624 states and 13431 transitions. Word has length 57 [2021-11-06 21:49:03,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:03,020 INFO L470 AbstractCegarLoop]: Abstraction has 11624 states and 13431 transitions. [2021-11-06 21:49:03,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:03,020 INFO L276 IsEmpty]: Start isEmpty. Operand 11624 states and 13431 transitions. [2021-11-06 21:49:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 21:49:03,020 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:03,020 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:03,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 21:49:03,021 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:03,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:03,021 INFO L85 PathProgramCache]: Analyzing trace with hash 725546566, now seen corresponding path program 1 times [2021-11-06 21:49:03,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:03,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407928763] [2021-11-06 21:49:03,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:03,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:03,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:03,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407928763] [2021-11-06 21:49:03,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407928763] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:03,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:03,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 21:49:03,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138944098] [2021-11-06 21:49:03,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:49:03,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:03,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:49:03,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:49:03,148 INFO L87 Difference]: Start difference. First operand 11624 states and 13431 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:03,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:03,928 INFO L93 Difference]: Finished difference Result 23243 states and 26856 transitions. [2021-11-06 21:49:03,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:49:03,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2021-11-06 21:49:03,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:03,950 INFO L225 Difference]: With dead ends: 23243 [2021-11-06 21:49:03,950 INFO L226 Difference]: Without dead ends: 11624 [2021-11-06 21:49:03,974 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:49:03,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11624 states. [2021-11-06 21:49:04,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11624 to 11624. [2021-11-06 21:49:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11624 states, 11545 states have (on average 1.1561715028150714) internal successors, (13348), 11623 states have internal predecessors, (13348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11624 states to 11624 states and 13348 transitions. [2021-11-06 21:49:04,419 INFO L78 Accepts]: Start accepts. Automaton has 11624 states and 13348 transitions. Word has length 58 [2021-11-06 21:49:04,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:04,420 INFO L470 AbstractCegarLoop]: Abstraction has 11624 states and 13348 transitions. [2021-11-06 21:49:04,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand 11624 states and 13348 transitions. [2021-11-06 21:49:04,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 21:49:04,420 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:04,420 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:04,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 21:49:04,421 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:04,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:04,421 INFO L85 PathProgramCache]: Analyzing trace with hash 725606148, now seen corresponding path program 1 times [2021-11-06 21:49:04,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:04,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307499113] [2021-11-06 21:49:04,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:04,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:04,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:04,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307499113] [2021-11-06 21:49:04,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307499113] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:04,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:04,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:49:04,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113616218] [2021-11-06 21:49:04,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:49:04,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:04,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:49:04,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:49:04,567 INFO L87 Difference]: Start difference. First operand 11624 states and 13348 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:05,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:05,688 INFO L93 Difference]: Finished difference Result 19172 states and 21936 transitions. [2021-11-06 21:49:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:49:05,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2021-11-06 21:49:05,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:05,723 INFO L225 Difference]: With dead ends: 19172 [2021-11-06 21:49:05,724 INFO L226 Difference]: Without dead ends: 19156 [2021-11-06 21:49:05,734 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:49:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19156 states. [2021-11-06 21:49:06,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19156 to 11608. [2021-11-06 21:49:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11608 states, 11537 states have (on average 1.1555863742740746) internal successors, (13332), 11607 states have internal predecessors, (13332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11608 states to 11608 states and 13332 transitions. [2021-11-06 21:49:06,503 INFO L78 Accepts]: Start accepts. Automaton has 11608 states and 13332 transitions. Word has length 58 [2021-11-06 21:49:06,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:06,503 INFO L470 AbstractCegarLoop]: Abstraction has 11608 states and 13332 transitions. [2021-11-06 21:49:06,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:06,504 INFO L276 IsEmpty]: Start isEmpty. Operand 11608 states and 13332 transitions. [2021-11-06 21:49:06,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 21:49:06,504 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:06,504 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:06,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 21:49:06,505 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:06,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:06,505 INFO L85 PathProgramCache]: Analyzing trace with hash 263547404, now seen corresponding path program 1 times [2021-11-06 21:49:06,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:06,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136822646] [2021-11-06 21:49:06,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:06,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:06,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:06,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136822646] [2021-11-06 21:49:06,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136822646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:06,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:06,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:49:06,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547250933] [2021-11-06 21:49:06,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:49:06,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:06,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:49:06,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:49:06,630 INFO L87 Difference]: Start difference. First operand 11608 states and 13332 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:07,121 INFO L93 Difference]: Finished difference Result 11608 states and 13332 transitions. [2021-11-06 21:49:07,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:49:07,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-06 21:49:07,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:07,140 INFO L225 Difference]: With dead ends: 11608 [2021-11-06 21:49:07,140 INFO L226 Difference]: Without dead ends: 11604 [2021-11-06 21:49:07,146 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:49:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11604 states. [2021-11-06 21:49:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11604 to 11604. [2021-11-06 21:49:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11604 states, 11535 states have (on average 1.1554399653229301) internal successors, (13328), 11603 states have internal predecessors, (13328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11604 states to 11604 states and 13328 transitions. [2021-11-06 21:49:07,672 INFO L78 Accepts]: Start accepts. Automaton has 11604 states and 13328 transitions. Word has length 59 [2021-11-06 21:49:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:07,672 INFO L470 AbstractCegarLoop]: Abstraction has 11604 states and 13328 transitions. [2021-11-06 21:49:07,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 11604 states and 13328 transitions. [2021-11-06 21:49:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 21:49:07,673 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:07,673 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:07,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 21:49:07,674 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:07,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:07,674 INFO L85 PathProgramCache]: Analyzing trace with hash -133108720, now seen corresponding path program 1 times [2021-11-06 21:49:07,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:07,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445452764] [2021-11-06 21:49:07,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:07,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:07,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:07,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445452764] [2021-11-06 21:49:07,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445452764] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:07,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:07,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:49:07,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220310939] [2021-11-06 21:49:07,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:49:07,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:07,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:49:07,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:49:07,798 INFO L87 Difference]: Start difference. First operand 11604 states and 13328 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:08,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:08,388 INFO L93 Difference]: Finished difference Result 11604 states and 13328 transitions. [2021-11-06 21:49:08,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:49:08,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-06 21:49:08,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:08,401 INFO L225 Difference]: With dead ends: 11604 [2021-11-06 21:49:08,401 INFO L226 Difference]: Without dead ends: 11600 [2021-11-06 21:49:08,404 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:49:08,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11600 states. [2021-11-06 21:49:09,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11600 to 11600. [2021-11-06 21:49:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11600 states, 11533 states have (on average 1.1552935055926472) internal successors, (13324), 11599 states have internal predecessors, (13324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11600 states to 11600 states and 13324 transitions. [2021-11-06 21:49:09,037 INFO L78 Accepts]: Start accepts. Automaton has 11600 states and 13324 transitions. Word has length 61 [2021-11-06 21:49:09,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:09,037 INFO L470 AbstractCegarLoop]: Abstraction has 11600 states and 13324 transitions. [2021-11-06 21:49:09,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:09,037 INFO L276 IsEmpty]: Start isEmpty. Operand 11600 states and 13324 transitions. [2021-11-06 21:49:09,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 21:49:09,038 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:09,038 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:09,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 21:49:09,038 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:09,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:09,039 INFO L85 PathProgramCache]: Analyzing trace with hash 922203071, now seen corresponding path program 1 times [2021-11-06 21:49:09,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:09,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445846866] [2021-11-06 21:49:09,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:09,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:09,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:09,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445846866] [2021-11-06 21:49:09,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445846866] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:09,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:09,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 21:49:09,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607453241] [2021-11-06 21:49:09,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 21:49:09,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:09,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 21:49:09,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:49:09,196 INFO L87 Difference]: Start difference. First operand 11600 states and 13324 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:12,881 INFO L93 Difference]: Finished difference Result 40053 states and 45983 transitions. [2021-11-06 21:49:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 21:49:12,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-11-06 21:49:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:12,932 INFO L225 Difference]: With dead ends: 40053 [2021-11-06 21:49:12,932 INFO L226 Difference]: Without dead ends: 28499 [2021-11-06 21:49:12,958 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:49:12,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28499 states. [2021-11-06 21:49:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28499 to 14029. [2021-11-06 21:49:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14029 states, 13962 states have (on average 1.159146254118321) internal successors, (16184), 14028 states have internal predecessors, (16184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14029 states to 14029 states and 16184 transitions. [2021-11-06 21:49:14,137 INFO L78 Accepts]: Start accepts. Automaton has 14029 states and 16184 transitions. Word has length 62 [2021-11-06 21:49:14,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:14,137 INFO L470 AbstractCegarLoop]: Abstraction has 14029 states and 16184 transitions. [2021-11-06 21:49:14,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 14029 states and 16184 transitions. [2021-11-06 21:49:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 21:49:14,138 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:14,138 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:14,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 21:49:14,138 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:14,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:14,138 INFO L85 PathProgramCache]: Analyzing trace with hash 932445812, now seen corresponding path program 1 times [2021-11-06 21:49:14,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:14,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058915378] [2021-11-06 21:49:14,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:14,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:14,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:14,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058915378] [2021-11-06 21:49:14,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058915378] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:14,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:14,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:49:14,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054107184] [2021-11-06 21:49:14,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:49:14,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:14,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:49:14,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:49:14,255 INFO L87 Difference]: Start difference. First operand 14029 states and 16184 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:15,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:15,009 INFO L93 Difference]: Finished difference Result 14029 states and 16184 transitions. [2021-11-06 21:49:15,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:49:15,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-06 21:49:15,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:15,030 INFO L225 Difference]: With dead ends: 14029 [2021-11-06 21:49:15,030 INFO L226 Difference]: Without dead ends: 14025 [2021-11-06 21:49:15,037 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:49:15,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14025 states. [2021-11-06 21:49:15,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14025 to 14025. [2021-11-06 21:49:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14025 states, 13960 states have (on average 1.159025787965616) internal successors, (16180), 14024 states have internal predecessors, (16180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14025 states to 14025 states and 16180 transitions. [2021-11-06 21:49:15,933 INFO L78 Accepts]: Start accepts. Automaton has 14025 states and 16180 transitions. Word has length 63 [2021-11-06 21:49:15,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:15,933 INFO L470 AbstractCegarLoop]: Abstraction has 14025 states and 16180 transitions. [2021-11-06 21:49:15,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 14025 states and 16180 transitions. [2021-11-06 21:49:15,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 21:49:15,934 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:15,935 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:15,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 21:49:15,935 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:15,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:15,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1566832328, now seen corresponding path program 1 times [2021-11-06 21:49:15,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:15,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787678094] [2021-11-06 21:49:15,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:15,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:16,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:16,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787678094] [2021-11-06 21:49:16,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787678094] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:16,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:16,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:49:16,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493277792] [2021-11-06 21:49:16,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:49:16,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:16,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:49:16,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:49:16,115 INFO L87 Difference]: Start difference. First operand 14025 states and 16180 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:17,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:17,018 INFO L93 Difference]: Finished difference Result 14025 states and 16180 transitions. [2021-11-06 21:49:17,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:49:17,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2021-11-06 21:49:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:17,039 INFO L225 Difference]: With dead ends: 14025 [2021-11-06 21:49:17,039 INFO L226 Difference]: Without dead ends: 14021 [2021-11-06 21:49:17,045 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:49:17,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14021 states. [2021-11-06 21:49:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14021 to 14021. [2021-11-06 21:49:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14021 states, 13958 states have (on average 1.1589052872904428) internal successors, (16176), 14020 states have internal predecessors, (16176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:17,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14021 states to 14021 states and 16176 transitions. [2021-11-06 21:49:17,992 INFO L78 Accepts]: Start accepts. Automaton has 14021 states and 16176 transitions. Word has length 65 [2021-11-06 21:49:17,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:17,992 INFO L470 AbstractCegarLoop]: Abstraction has 14021 states and 16176 transitions. [2021-11-06 21:49:17,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:17,992 INFO L276 IsEmpty]: Start isEmpty. Operand 14021 states and 16176 transitions. [2021-11-06 21:49:17,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 21:49:17,993 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:17,993 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:17,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 21:49:17,994 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:17,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:17,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1221895141, now seen corresponding path program 1 times [2021-11-06 21:49:17,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:17,995 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569007139] [2021-11-06 21:49:17,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:17,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:18,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:18,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569007139] [2021-11-06 21:49:18,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569007139] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:18,158 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:18,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 21:49:18,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212763902] [2021-11-06 21:49:18,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 21:49:18,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:18,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 21:49:18,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:49:18,159 INFO L87 Difference]: Start difference. First operand 14021 states and 16176 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:24,485 INFO L93 Difference]: Finished difference Result 44817 states and 51626 transitions. [2021-11-06 21:49:24,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 21:49:24,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2021-11-06 21:49:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:24,534 INFO L225 Difference]: With dead ends: 44817 [2021-11-06 21:49:24,534 INFO L226 Difference]: Without dead ends: 30850 [2021-11-06 21:49:24,557 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:49:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30850 states. [2021-11-06 21:49:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30850 to 14018. [2021-11-06 21:49:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14018 states, 13956 states have (on average 1.1587847520779593) internal successors, (16172), 14017 states have internal predecessors, (16172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:25,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14018 states to 14018 states and 16172 transitions. [2021-11-06 21:49:25,589 INFO L78 Accepts]: Start accepts. Automaton has 14018 states and 16172 transitions. Word has length 65 [2021-11-06 21:49:25,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:25,589 INFO L470 AbstractCegarLoop]: Abstraction has 14018 states and 16172 transitions. [2021-11-06 21:49:25,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:25,589 INFO L276 IsEmpty]: Start isEmpty. Operand 14018 states and 16172 transitions. [2021-11-06 21:49:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 21:49:25,590 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:25,590 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:25,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 21:49:25,590 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:25,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:25,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1808561244, now seen corresponding path program 1 times [2021-11-06 21:49:25,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:25,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920675433] [2021-11-06 21:49:25,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:25,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:25,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:25,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920675433] [2021-11-06 21:49:25,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920675433] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:25,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:25,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 21:49:25,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87506950] [2021-11-06 21:49:25,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:49:25,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:25,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:49:25,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:49:25,737 INFO L87 Difference]: Start difference. First operand 14018 states and 16172 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:26,954 INFO L93 Difference]: Finished difference Result 28029 states and 32336 transitions. [2021-11-06 21:49:26,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:49:26,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-11-06 21:49:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:26,976 INFO L225 Difference]: With dead ends: 28029 [2021-11-06 21:49:26,977 INFO L226 Difference]: Without dead ends: 14018 [2021-11-06 21:49:26,998 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:49:27,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14018 states. [2021-11-06 21:49:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14018 to 14018. [2021-11-06 21:49:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14018 states, 13956 states have (on average 1.158713098308971) internal successors, (16171), 14017 states have internal predecessors, (16171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14018 states to 14018 states and 16171 transitions. [2021-11-06 21:49:27,966 INFO L78 Accepts]: Start accepts. Automaton has 14018 states and 16171 transitions. Word has length 67 [2021-11-06 21:49:27,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:27,966 INFO L470 AbstractCegarLoop]: Abstraction has 14018 states and 16171 transitions. [2021-11-06 21:49:27,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 14018 states and 16171 transitions. [2021-11-06 21:49:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 21:49:27,968 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:27,968 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:27,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 21:49:27,968 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:27,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:27,968 INFO L85 PathProgramCache]: Analyzing trace with hash -524831394, now seen corresponding path program 1 times [2021-11-06 21:49:27,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:27,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052758250] [2021-11-06 21:49:27,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:27,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:28,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:28,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052758250] [2021-11-06 21:49:28,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052758250] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:28,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:28,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 21:49:28,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948479250] [2021-11-06 21:49:28,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:49:28,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:28,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:49:28,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:49:28,105 INFO L87 Difference]: Start difference. First operand 14018 states and 16171 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:29,469 INFO L93 Difference]: Finished difference Result 28023 states and 32324 transitions. [2021-11-06 21:49:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:49:29,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-11-06 21:49:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:29,488 INFO L225 Difference]: With dead ends: 28023 [2021-11-06 21:49:29,489 INFO L226 Difference]: Without dead ends: 14018 [2021-11-06 21:49:29,504 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:49:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14018 states. [2021-11-06 21:49:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14018 to 14018. [2021-11-06 21:49:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14018 states, 13956 states have (on average 1.158426483233018) internal successors, (16167), 14017 states have internal predecessors, (16167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14018 states to 14018 states and 16167 transitions. [2021-11-06 21:49:30,527 INFO L78 Accepts]: Start accepts. Automaton has 14018 states and 16167 transitions. Word has length 67 [2021-11-06 21:49:30,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:30,527 INFO L470 AbstractCegarLoop]: Abstraction has 14018 states and 16167 transitions. [2021-11-06 21:49:30,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 14018 states and 16167 transitions. [2021-11-06 21:49:30,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 21:49:30,528 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:30,528 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:30,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 21:49:30,528 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:30,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:30,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2073453932, now seen corresponding path program 1 times [2021-11-06 21:49:30,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:30,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288757587] [2021-11-06 21:49:30,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:30,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:30,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:30,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288757587] [2021-11-06 21:49:30,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288757587] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:30,660 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:30,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 21:49:30,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315635144] [2021-11-06 21:49:30,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:49:30,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:30,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:49:30,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:49:30,661 INFO L87 Difference]: Start difference. First operand 14018 states and 16167 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 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) [2021-11-06 21:49:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:31,991 INFO L93 Difference]: Finished difference Result 28022 states and 32319 transitions. [2021-11-06 21:49:31,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:49:31,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 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 71 [2021-11-06 21:49:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:32,008 INFO L225 Difference]: With dead ends: 28022 [2021-11-06 21:49:32,009 INFO L226 Difference]: Without dead ends: 14017 [2021-11-06 21:49:32,024 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:49:32,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14017 states. [2021-11-06 21:49:33,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14017 to 14017. [2021-11-06 21:49:33,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14017 states, 13955 states have (on average 1.158366176997492) internal successors, (16165), 14016 states have internal predecessors, (16165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14017 states to 14017 states and 16165 transitions. [2021-11-06 21:49:33,116 INFO L78 Accepts]: Start accepts. Automaton has 14017 states and 16165 transitions. Word has length 71 [2021-11-06 21:49:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:33,117 INFO L470 AbstractCegarLoop]: Abstraction has 14017 states and 16165 transitions. [2021-11-06 21:49:33,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 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) [2021-11-06 21:49:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 14017 states and 16165 transitions. [2021-11-06 21:49:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 21:49:33,118 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:33,118 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:33,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 21:49:33,118 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:33,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:33,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1310930220, now seen corresponding path program 1 times [2021-11-06 21:49:33,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:33,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913241037] [2021-11-06 21:49:33,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:33,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:33,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:33,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913241037] [2021-11-06 21:49:33,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913241037] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:33,223 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:33,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 21:49:33,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602875237] [2021-11-06 21:49:33,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:49:33,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:33,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:49:33,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:49:33,225 INFO L87 Difference]: Start difference. First operand 14017 states and 16165 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 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) [2021-11-06 21:49:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:34,536 INFO L93 Difference]: Finished difference Result 28019 states and 32313 transitions. [2021-11-06 21:49:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:49:34,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 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 71 [2021-11-06 21:49:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:34,555 INFO L225 Difference]: With dead ends: 28019 [2021-11-06 21:49:34,555 INFO L226 Difference]: Without dead ends: 14017 [2021-11-06 21:49:34,574 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:49:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14017 states. [2021-11-06 21:49:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14017 to 14017. [2021-11-06 21:49:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14017 states, 13955 states have (on average 1.1578645646721606) internal successors, (16158), 14016 states have internal predecessors, (16158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14017 states to 14017 states and 16158 transitions. [2021-11-06 21:49:35,700 INFO L78 Accepts]: Start accepts. Automaton has 14017 states and 16158 transitions. Word has length 71 [2021-11-06 21:49:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:35,700 INFO L470 AbstractCegarLoop]: Abstraction has 14017 states and 16158 transitions. [2021-11-06 21:49:35,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 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) [2021-11-06 21:49:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 14017 states and 16158 transitions. [2021-11-06 21:49:35,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 21:49:35,701 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:35,701 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:35,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 21:49:35,701 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:35,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:35,702 INFO L85 PathProgramCache]: Analyzing trace with hash -50012970, now seen corresponding path program 1 times [2021-11-06 21:49:35,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:35,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989606527] [2021-11-06 21:49:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:35,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:35,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:35,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989606527] [2021-11-06 21:49:35,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989606527] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:35,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:35,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 21:49:35,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620879820] [2021-11-06 21:49:35,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:49:35,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:35,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:49:35,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:49:35,804 INFO L87 Difference]: Start difference. First operand 14017 states and 16158 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 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) [2021-11-06 21:49:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:37,256 INFO L93 Difference]: Finished difference Result 27970 states and 32226 transitions. [2021-11-06 21:49:37,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:49:37,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 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 71 [2021-11-06 21:49:37,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:37,278 INFO L225 Difference]: With dead ends: 27970 [2021-11-06 21:49:37,278 INFO L226 Difference]: Without dead ends: 13969 [2021-11-06 21:49:37,301 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:49:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13969 states. [2021-11-06 21:49:38,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13969 to 13969. [2021-11-06 21:49:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13969 states, 13907 states have (on average 1.1561803408355504) internal successors, (16079), 13968 states have internal predecessors, (16079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13969 states to 13969 states and 16079 transitions. [2021-11-06 21:49:38,470 INFO L78 Accepts]: Start accepts. Automaton has 13969 states and 16079 transitions. Word has length 71 [2021-11-06 21:49:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:38,470 INFO L470 AbstractCegarLoop]: Abstraction has 13969 states and 16079 transitions. [2021-11-06 21:49:38,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 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) [2021-11-06 21:49:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 13969 states and 16079 transitions. [2021-11-06 21:49:38,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 21:49:38,471 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:38,471 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:38,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 21:49:38,471 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:38,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:38,472 INFO L85 PathProgramCache]: Analyzing trace with hash -9338220, now seen corresponding path program 1 times [2021-11-06 21:49:38,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:38,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407400878] [2021-11-06 21:49:38,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:38,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:38,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:38,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407400878] [2021-11-06 21:49:38,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407400878] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:38,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:38,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 21:49:38,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387056487] [2021-11-06 21:49:38,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:49:38,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:38,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:49:38,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:49:38,580 INFO L87 Difference]: Start difference. First operand 13969 states and 16079 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 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) [2021-11-06 21:49:40,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:40,709 INFO L93 Difference]: Finished difference Result 36737 states and 42502 transitions. [2021-11-06 21:49:40,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:49:40,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 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 71 [2021-11-06 21:49:40,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:40,757 INFO L225 Difference]: With dead ends: 36737 [2021-11-06 21:49:40,757 INFO L226 Difference]: Without dead ends: 22785 [2021-11-06 21:49:40,781 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:49:40,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22785 states. [2021-11-06 21:49:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22785 to 20970. [2021-11-06 21:49:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20970 states, 20908 states have (on average 1.1691218672278554) internal successors, (24444), 20969 states have internal predecessors, (24444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20970 states to 20970 states and 24444 transitions. [2021-11-06 21:49:42,740 INFO L78 Accepts]: Start accepts. Automaton has 20970 states and 24444 transitions. Word has length 71 [2021-11-06 21:49:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:42,740 INFO L470 AbstractCegarLoop]: Abstraction has 20970 states and 24444 transitions. [2021-11-06 21:49:42,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 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) [2021-11-06 21:49:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 20970 states and 24444 transitions. [2021-11-06 21:49:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 21:49:42,741 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:42,741 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:42,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-06 21:49:42,741 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:42,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:42,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1377447190, now seen corresponding path program 1 times [2021-11-06 21:49:42,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:42,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121044520] [2021-11-06 21:49:42,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:42,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:42,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:42,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121044520] [2021-11-06 21:49:42,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121044520] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:42,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:42,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:49:42,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155105549] [2021-11-06 21:49:42,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:49:42,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:42,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:49:42,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:49:42,878 INFO L87 Difference]: Start difference. First operand 20970 states and 24444 transitions. Second operand has 4 states, 4 states have (on average 17.75) 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) [2021-11-06 21:49:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:44,753 INFO L93 Difference]: Finished difference Result 20970 states and 24444 transitions. [2021-11-06 21:49:44,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:49:44,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) 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 71 [2021-11-06 21:49:44,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:44,795 INFO L225 Difference]: With dead ends: 20970 [2021-11-06 21:49:44,795 INFO L226 Difference]: Without dead ends: 20966 [2021-11-06 21:49:44,806 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:49:44,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20966 states. [2021-11-06 21:49:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20966 to 20966. [2021-11-06 21:49:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20966 states, 20906 states have (on average 1.1690423801779393) internal successors, (24440), 20965 states have internal predecessors, (24440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20966 states to 20966 states and 24440 transitions. [2021-11-06 21:49:46,581 INFO L78 Accepts]: Start accepts. Automaton has 20966 states and 24440 transitions. Word has length 71 [2021-11-06 21:49:46,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:46,581 INFO L470 AbstractCegarLoop]: Abstraction has 20966 states and 24440 transitions. [2021-11-06 21:49:46,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) 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) [2021-11-06 21:49:46,581 INFO L276 IsEmpty]: Start isEmpty. Operand 20966 states and 24440 transitions. [2021-11-06 21:49:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 21:49:46,582 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:46,582 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:46,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 21:49:46,582 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:46,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:46,583 INFO L85 PathProgramCache]: Analyzing trace with hash 877730330, now seen corresponding path program 1 times [2021-11-06 21:49:46,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:46,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856259555] [2021-11-06 21:49:46,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:46,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:46,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:46,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856259555] [2021-11-06 21:49:46,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856259555] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:46,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:46,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:49:46,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648929005] [2021-11-06 21:49:46,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:49:46,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:46,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:49:46,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:49:46,788 INFO L87 Difference]: Start difference. First operand 20966 states and 24440 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:48,533 INFO L93 Difference]: Finished difference Result 20966 states and 24440 transitions. [2021-11-06 21:49:48,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:49:48,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-06 21:49:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:48,573 INFO L225 Difference]: With dead ends: 20966 [2021-11-06 21:49:48,574 INFO L226 Difference]: Without dead ends: 20962 [2021-11-06 21:49:48,588 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:49:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20962 states. [2021-11-06 21:49:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20962 to 20962. [2021-11-06 21:49:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20962 states, 20904 states have (on average 1.1689628779181018) internal successors, (24436), 20961 states have internal predecessors, (24436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20962 states to 20962 states and 24436 transitions. [2021-11-06 21:49:50,509 INFO L78 Accepts]: Start accepts. Automaton has 20962 states and 24436 transitions. Word has length 73 [2021-11-06 21:49:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:50,509 INFO L470 AbstractCegarLoop]: Abstraction has 20962 states and 24436 transitions. [2021-11-06 21:49:50,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 20962 states and 24436 transitions. [2021-11-06 21:49:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 21:49:50,510 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:50,510 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:50,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 21:49:50,510 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:50,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:50,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1686165374, now seen corresponding path program 1 times [2021-11-06 21:49:50,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:50,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533729301] [2021-11-06 21:49:50,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:50,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:50,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:50,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:50,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533729301] [2021-11-06 21:49:50,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533729301] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:50,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:50,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:49:50,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305977452] [2021-11-06 21:49:50,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:49:50,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:50,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:49:50,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:49:50,627 INFO L87 Difference]: Start difference. First operand 20962 states and 24436 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:52,469 INFO L93 Difference]: Finished difference Result 20962 states and 24436 transitions. [2021-11-06 21:49:52,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:49:52,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-06 21:49:52,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:52,502 INFO L225 Difference]: With dead ends: 20962 [2021-11-06 21:49:52,502 INFO L226 Difference]: Without dead ends: 20958 [2021-11-06 21:49:52,512 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:49:52,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20958 states. [2021-11-06 21:49:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20958 to 20958. [2021-11-06 21:49:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20958 states, 20902 states have (on average 1.1688833604439766) internal successors, (24432), 20957 states have internal predecessors, (24432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20958 states to 20958 states and 24432 transitions. [2021-11-06 21:49:54,480 INFO L78 Accepts]: Start accepts. Automaton has 20958 states and 24432 transitions. Word has length 75 [2021-11-06 21:49:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:54,480 INFO L470 AbstractCegarLoop]: Abstraction has 20958 states and 24432 transitions. [2021-11-06 21:49:54,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 20958 states and 24432 transitions. [2021-11-06 21:49:54,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-06 21:49:54,481 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:54,481 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:54,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 21:49:54,482 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:54,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:54,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1203162434, now seen corresponding path program 1 times [2021-11-06 21:49:54,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:54,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860035165] [2021-11-06 21:49:54,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:54,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:54,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:54,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860035165] [2021-11-06 21:49:54,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860035165] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:54,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:54,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:49:54,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207167595] [2021-11-06 21:49:54,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:49:54,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:54,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:49:54,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:49:54,603 INFO L87 Difference]: Start difference. First operand 20958 states and 24432 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:56,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:49:56,613 INFO L93 Difference]: Finished difference Result 20958 states and 24432 transitions. [2021-11-06 21:49:56,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:49:56,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2021-11-06 21:49:56,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:49:56,642 INFO L225 Difference]: With dead ends: 20958 [2021-11-06 21:49:56,642 INFO L226 Difference]: Without dead ends: 20954 [2021-11-06 21:49:56,649 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:49:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20954 states. [2021-11-06 21:49:58,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20954 to 20954. [2021-11-06 21:49:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20954 states, 20900 states have (on average 1.168803827751196) internal successors, (24428), 20953 states have internal predecessors, (24428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20954 states to 20954 states and 24428 transitions. [2021-11-06 21:49:58,672 INFO L78 Accepts]: Start accepts. Automaton has 20954 states and 24428 transitions. Word has length 77 [2021-11-06 21:49:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:49:58,672 INFO L470 AbstractCegarLoop]: Abstraction has 20954 states and 24428 transitions. [2021-11-06 21:49:58,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:49:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 20954 states and 24428 transitions. [2021-11-06 21:49:58,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 21:49:58,674 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:49:58,674 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:49:58,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 21:49:58,674 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:49:58,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:49:58,675 INFO L85 PathProgramCache]: Analyzing trace with hash 893805414, now seen corresponding path program 1 times [2021-11-06 21:49:58,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:49:58,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805031898] [2021-11-06 21:49:58,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:49:58,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:49:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:49:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:49:58,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:49:58,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805031898] [2021-11-06 21:49:58,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805031898] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:49:58,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:49:58,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:49:58,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364473063] [2021-11-06 21:49:58,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:49:58,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:49:58,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:49:58,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:49:58,799 INFO L87 Difference]: Start difference. First operand 20954 states and 24428 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:50:00,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:00,623 INFO L93 Difference]: Finished difference Result 20954 states and 24428 transitions. [2021-11-06 21:50:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:50:00,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-06 21:50:00,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:00,657 INFO L225 Difference]: With dead ends: 20954 [2021-11-06 21:50:00,657 INFO L226 Difference]: Without dead ends: 20950 [2021-11-06 21:50:00,668 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:50:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20950 states. [2021-11-06 21:50:02,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20950 to 20950. [2021-11-06 21:50:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20950 states, 20898 states have (on average 1.168724279835391) internal successors, (24424), 20949 states have internal predecessors, (24424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:50:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20950 states to 20950 states and 24424 transitions. [2021-11-06 21:50:02,712 INFO L78 Accepts]: Start accepts. Automaton has 20950 states and 24424 transitions. Word has length 79 [2021-11-06 21:50:02,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:50:02,712 INFO L470 AbstractCegarLoop]: Abstraction has 20950 states and 24424 transitions. [2021-11-06 21:50:02,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:50:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 20950 states and 24424 transitions. [2021-11-06 21:50:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 21:50:02,713 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:50:02,713 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:50:02,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 21:50:02,714 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:50:02,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:50:02,714 INFO L85 PathProgramCache]: Analyzing trace with hash -45547030, now seen corresponding path program 1 times [2021-11-06 21:50:02,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:50:02,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841859510] [2021-11-06 21:50:02,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:50:02,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:50:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:50:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:50:02,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:50:02,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841859510] [2021-11-06 21:50:02,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841859510] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:50:02,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:50:02,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:50:02,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583094649] [2021-11-06 21:50:02,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:50:02,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:50:02,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:50:02,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:50:02,828 INFO L87 Difference]: Start difference. First operand 20950 states and 24424 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:50:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:04,917 INFO L93 Difference]: Finished difference Result 20950 states and 24424 transitions. [2021-11-06 21:50:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:50:04,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 [2021-11-06 21:50:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:04,950 INFO L225 Difference]: With dead ends: 20950 [2021-11-06 21:50:04,950 INFO L226 Difference]: Without dead ends: 20843 [2021-11-06 21:50:04,959 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:50:04,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20843 states. [2021-11-06 21:50:06,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20843 to 20843. [2021-11-06 21:50:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20843 states, 20793 states have (on average 1.1691434617419323) internal successors, (24310), 20842 states have internal predecessors, (24310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:50:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20843 states to 20843 states and 24310 transitions. [2021-11-06 21:50:06,998 INFO L78 Accepts]: Start accepts. Automaton has 20843 states and 24310 transitions. Word has length 81 [2021-11-06 21:50:06,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:50:06,998 INFO L470 AbstractCegarLoop]: Abstraction has 20843 states and 24310 transitions. [2021-11-06 21:50:06,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:50:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand 20843 states and 24310 transitions. [2021-11-06 21:50:06,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-06 21:50:06,999 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:50:06,999 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:50:06,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-06 21:50:06,999 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:50:07,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:50:07,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1432063170, now seen corresponding path program 1 times [2021-11-06 21:50:07,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:50:07,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46997271] [2021-11-06 21:50:07,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:50:07,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:50:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:50:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:50:07,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:50:07,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46997271] [2021-11-06 21:50:07,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46997271] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:50:07,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:50:07,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:50:07,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836858472] [2021-11-06 21:50:07,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:50:07,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:50:07,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:50:07,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:50:07,118 INFO L87 Difference]: Start difference. First operand 20843 states and 24310 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:50:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:13,492 INFO L93 Difference]: Finished difference Result 41156 states and 48035 transitions. [2021-11-06 21:50:13,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:50:13,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-06 21:50:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:13,555 INFO L225 Difference]: With dead ends: 41156 [2021-11-06 21:50:13,555 INFO L226 Difference]: Without dead ends: 38963 [2021-11-06 21:50:13,570 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:50:13,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38963 states. [2021-11-06 21:50:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38963 to 19722. [2021-11-06 21:50:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19722 states, 19695 states have (on average 1.1677075399847676) internal successors, (22998), 19721 states have internal predecessors, (22998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:50:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19722 states to 19722 states and 22998 transitions. [2021-11-06 21:50:15,852 INFO L78 Accepts]: Start accepts. Automaton has 19722 states and 22998 transitions. Word has length 82 [2021-11-06 21:50:15,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:50:15,853 INFO L470 AbstractCegarLoop]: Abstraction has 19722 states and 22998 transitions. [2021-11-06 21:50:15,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:50:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 19722 states and 22998 transitions. [2021-11-06 21:50:15,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-06 21:50:15,855 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:50:15,855 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:50:15,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-06 21:50:15,855 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:50:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:50:15,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1236170861, now seen corresponding path program 1 times [2021-11-06 21:50:15,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:50:15,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954989253] [2021-11-06 21:50:15,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:50:15,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:50:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:50:16,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:50:16,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:50:16,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954989253] [2021-11-06 21:50:16,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954989253] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:50:16,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:50:16,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:50:16,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330241997] [2021-11-06 21:50:16,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:50:16,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:50:16,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:50:16,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:50:16,101 INFO L87 Difference]: Start difference. First operand 19722 states and 22998 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 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) [2021-11-06 21:50:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:20,413 INFO L93 Difference]: Finished difference Result 57628 states and 67124 transitions. [2021-11-06 21:50:20,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 21:50:20,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 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 115 [2021-11-06 21:50:20,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:20,473 INFO L225 Difference]: With dead ends: 57628 [2021-11-06 21:50:20,473 INFO L226 Difference]: Without dead ends: 37959 [2021-11-06 21:50:20,509 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 21:50:20,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37959 states. [2021-11-06 21:50:22,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37959 to 19722. [2021-11-06 21:50:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19722 states, 19695 states have (on average 1.1665905052043666) internal successors, (22976), 19721 states have internal predecessors, (22976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:50:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19722 states to 19722 states and 22976 transitions. [2021-11-06 21:50:22,917 INFO L78 Accepts]: Start accepts. Automaton has 19722 states and 22976 transitions. Word has length 115 [2021-11-06 21:50:22,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:50:22,917 INFO L470 AbstractCegarLoop]: Abstraction has 19722 states and 22976 transitions. [2021-11-06 21:50:22,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 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) [2021-11-06 21:50:22,918 INFO L276 IsEmpty]: Start isEmpty. Operand 19722 states and 22976 transitions. [2021-11-06 21:50:22,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-06 21:50:22,919 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:50:22,919 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:50:22,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-06 21:50:22,919 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:50:22,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:50:22,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1236230443, now seen corresponding path program 1 times [2021-11-06 21:50:22,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:50:22,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250392361] [2021-11-06 21:50:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:50:22,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:50:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:50:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:50:23,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:50:23,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250392361] [2021-11-06 21:50:23,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250392361] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:50:23,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:50:23,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 21:50:23,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994628381] [2021-11-06 21:50:23,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 21:50:23,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:50:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 21:50:23,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:50:23,067 INFO L87 Difference]: Start difference. First operand 19722 states and 22976 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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) [2021-11-06 21:50:39,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:39,881 INFO L93 Difference]: Finished difference Result 111417 states and 129231 transitions. [2021-11-06 21:50:39,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 21:50:39,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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 115 [2021-11-06 21:50:39,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:40,162 INFO L225 Difference]: With dead ends: 111417 [2021-11-06 21:50:40,162 INFO L226 Difference]: Without dead ends: 111391 [2021-11-06 21:50:40,201 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-11-06 21:50:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111391 states. [2021-11-06 21:50:43,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111391 to 19732. [2021-11-06 21:50:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19732 states, 19713 states have (on average 1.1653223760969917) internal successors, (22972), 19731 states have internal predecessors, (22972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:50:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19732 states to 19732 states and 22972 transitions. [2021-11-06 21:50:43,536 INFO L78 Accepts]: Start accepts. Automaton has 19732 states and 22972 transitions. Word has length 115 [2021-11-06 21:50:43,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:50:43,536 INFO L470 AbstractCegarLoop]: Abstraction has 19732 states and 22972 transitions. [2021-11-06 21:50:43,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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) [2021-11-06 21:50:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 19732 states and 22972 transitions. [2021-11-06 21:50:43,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-06 21:50:43,538 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:50:43,538 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:50:43,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-06 21:50:43,538 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-06 21:50:43,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:50:43,540 INFO L85 PathProgramCache]: Analyzing trace with hash -776454756, now seen corresponding path program 1 times [2021-11-06 21:50:43,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:50:43,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892180543] [2021-11-06 21:50:43,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:50:43,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:50:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:50:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:50:43,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:50:43,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892180543] [2021-11-06 21:50:43,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892180543] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:50:43,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:50:43,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 21:50:43,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021814920] [2021-11-06 21:50:43,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:50:43,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:50:43,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:50:43,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:50:43,694 INFO L87 Difference]: Start difference. First operand 19732 states and 22972 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:50:46,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:46,937 INFO L93 Difference]: Finished difference Result 39350 states and 45804 transitions. [2021-11-06 21:50:46,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:50:46,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2021-11-06 21:50:46,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:46,961 INFO L225 Difference]: With dead ends: 39350 [2021-11-06 21:50:46,961 INFO L226 Difference]: Without dead ends: 19671 [2021-11-06 21:50:46,987 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:50:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19671 states.