./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--usb--class--cdc-wdm.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--usb--class--cdc-wdm.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 6fbcf05da5228307460c10a1ab2d8431ff74359811f7e2c9b55e8eaa9db8f14c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 22:01:43,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 22:01:43,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 22:01:43,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 22:01:43,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 22:01:43,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 22:01:43,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 22:01:43,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 22:01:43,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 22:01:43,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 22:01:43,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 22:01:43,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 22:01:43,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 22:01:43,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 22:01:43,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 22:01:43,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 22:01:43,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 22:01:43,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 22:01:43,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 22:01:43,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 22:01:43,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 22:01:43,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 22:01:43,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 22:01:43,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 22:01:43,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 22:01:43,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 22:01:43,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 22:01:43,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 22:01:43,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 22:01:43,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 22:01:43,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 22:01:43,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 22:01:43,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 22:01:43,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 22:01:43,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 22:01:43,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 22:01:43,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 22:01:43,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 22:01:43,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 22:01:43,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 22:01:43,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 22:01:43,429 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 22:01:43,457 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 22:01:43,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 22:01:43,458 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 22:01:43,458 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 22:01:43,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 22:01:43,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 22:01:43,459 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 22:01:43,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 22:01:43,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 22:01:43,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 22:01:43,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 22:01:43,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 22:01:43,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 22:01:43,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 22:01:43,461 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 22:01:43,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 22:01:43,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 22:01:43,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 22:01:43,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 22:01:43,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 22:01:43,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 22:01:43,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 22:01:43,463 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 22:01:43,463 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 22:01:43,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 22:01:43,463 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 22:01:43,463 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 22:01:43,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 22:01:43,465 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 22:01:43,465 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 -> 6fbcf05da5228307460c10a1ab2d8431ff74359811f7e2c9b55e8eaa9db8f14c [2021-11-06 22:01:43,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 22:01:43,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 22:01:43,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 22:01:43,705 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 22:01:43,706 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 22:01:43,707 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--usb--class--cdc-wdm.ko.cil.i [2021-11-06 22:01:43,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58e22cab/eaf95c66fb604815ad60aecba3f7fc8b/FLAG54f42421d [2021-11-06 22:01:44,380 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 22:01:44,381 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2021-11-06 22:01:44,437 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58e22cab/eaf95c66fb604815ad60aecba3f7fc8b/FLAG54f42421d [2021-11-06 22:01:44,550 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58e22cab/eaf95c66fb604815ad60aecba3f7fc8b [2021-11-06 22:01:44,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 22:01:44,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 22:01:44,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 22:01:44,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 22:01:44,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 22:01:44,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:01:44" (1/1) ... [2021-11-06 22:01:44,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3695abe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:44, skipping insertion in model container [2021-11-06 22:01:44,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:01:44" (1/1) ... [2021-11-06 22:01:44,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 22:01:44,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 22:01:46,801 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--usb--class--cdc-wdm.ko.cil.i[307309,307322] [2021-11-06 22:01:46,804 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--usb--class--cdc-wdm.ko.cil.i[307454,307467] [2021-11-06 22:01:46,805 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--usb--class--cdc-wdm.ko.cil.i[307600,307613] [2021-11-06 22:01:46,805 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--usb--class--cdc-wdm.ko.cil.i[307765,307778] [2021-11-06 22:01:46,806 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--usb--class--cdc-wdm.ko.cil.i[307923,307936] [2021-11-06 22:01:46,806 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--usb--class--cdc-wdm.ko.cil.i[308081,308094] [2021-11-06 22:01:46,807 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--usb--class--cdc-wdm.ko.cil.i[308239,308252] [2021-11-06 22:01:46,807 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--usb--class--cdc-wdm.ko.cil.i[308399,308412] [2021-11-06 22:01:46,807 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--usb--class--cdc-wdm.ko.cil.i[308558,308571] [2021-11-06 22:01:46,808 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--usb--class--cdc-wdm.ko.cil.i[308697,308710] [2021-11-06 22:01:46,808 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--usb--class--cdc-wdm.ko.cil.i[308839,308852] [2021-11-06 22:01:46,809 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--usb--class--cdc-wdm.ko.cil.i[308988,309001] [2021-11-06 22:01:46,809 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--usb--class--cdc-wdm.ko.cil.i[309127,309140] [2021-11-06 22:01:46,809 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--usb--class--cdc-wdm.ko.cil.i[309282,309295] [2021-11-06 22:01:46,809 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--usb--class--cdc-wdm.ko.cil.i[309442,309455] [2021-11-06 22:01:46,810 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--usb--class--cdc-wdm.ko.cil.i[309593,309606] [2021-11-06 22:01:46,810 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--usb--class--cdc-wdm.ko.cil.i[309744,309757] [2021-11-06 22:01:46,810 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--usb--class--cdc-wdm.ko.cil.i[309896,309909] [2021-11-06 22:01:46,811 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--usb--class--cdc-wdm.ko.cil.i[310045,310058] [2021-11-06 22:01:46,811 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--usb--class--cdc-wdm.ko.cil.i[310193,310206] [2021-11-06 22:01:46,812 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--usb--class--cdc-wdm.ko.cil.i[310350,310363] [2021-11-06 22:01:46,812 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--usb--class--cdc-wdm.ko.cil.i[310499,310512] [2021-11-06 22:01:46,812 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--usb--class--cdc-wdm.ko.cil.i[310655,310668] [2021-11-06 22:01:46,812 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--usb--class--cdc-wdm.ko.cil.i[310808,310821] [2021-11-06 22:01:46,813 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--usb--class--cdc-wdm.ko.cil.i[310954,310967] [2021-11-06 22:01:46,814 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--usb--class--cdc-wdm.ko.cil.i[311097,311110] [2021-11-06 22:01:46,814 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--usb--class--cdc-wdm.ko.cil.i[311249,311262] [2021-11-06 22:01:46,815 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--usb--class--cdc-wdm.ko.cil.i[311395,311408] [2021-11-06 22:01:46,815 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--usb--class--cdc-wdm.ko.cil.i[311540,311553] [2021-11-06 22:01:46,816 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--usb--class--cdc-wdm.ko.cil.i[311694,311707] [2021-11-06 22:01:46,816 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--usb--class--cdc-wdm.ko.cil.i[311845,311858] [2021-11-06 22:01:46,817 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--usb--class--cdc-wdm.ko.cil.i[312000,312013] [2021-11-06 22:01:46,817 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--usb--class--cdc-wdm.ko.cil.i[312152,312165] [2021-11-06 22:01:46,818 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--usb--class--cdc-wdm.ko.cil.i[312307,312320] [2021-11-06 22:01:46,818 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--usb--class--cdc-wdm.ko.cil.i[312471,312484] [2021-11-06 22:01:46,818 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--usb--class--cdc-wdm.ko.cil.i[312627,312640] [2021-11-06 22:01:46,819 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--usb--class--cdc-wdm.ko.cil.i[312791,312804] [2021-11-06 22:01:46,819 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--usb--class--cdc-wdm.ko.cil.i[312933,312946] [2021-11-06 22:01:46,819 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--usb--class--cdc-wdm.ko.cil.i[313091,313104] [2021-11-06 22:01:46,820 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--usb--class--cdc-wdm.ko.cil.i[313258,313271] [2021-11-06 22:01:46,820 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--usb--class--cdc-wdm.ko.cil.i[313417,313430] [2021-11-06 22:01:46,821 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--usb--class--cdc-wdm.ko.cil.i[313576,313589] [2021-11-06 22:01:46,821 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--usb--class--cdc-wdm.ko.cil.i[313725,313738] [2021-11-06 22:01:46,821 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--usb--class--cdc-wdm.ko.cil.i[313872,313885] [2021-11-06 22:01:46,821 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--usb--class--cdc-wdm.ko.cil.i[314011,314024] [2021-11-06 22:01:46,822 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--usb--class--cdc-wdm.ko.cil.i[314174,314187] [2021-11-06 22:01:46,822 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--usb--class--cdc-wdm.ko.cil.i[314340,314353] [2021-11-06 22:01:46,822 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--usb--class--cdc-wdm.ko.cil.i[314504,314517] [2021-11-06 22:01:46,822 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--usb--class--cdc-wdm.ko.cil.i[314669,314682] [2021-11-06 22:01:46,823 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--usb--class--cdc-wdm.ko.cil.i[314834,314847] [2021-11-06 22:01:46,824 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--usb--class--cdc-wdm.ko.cil.i[315000,315013] [2021-11-06 22:01:46,824 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--usb--class--cdc-wdm.ko.cil.i[315165,315178] [2021-11-06 22:01:46,825 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--usb--class--cdc-wdm.ko.cil.i[315332,315345] [2021-11-06 22:01:46,825 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--usb--class--cdc-wdm.ko.cil.i[315492,315505] [2021-11-06 22:01:46,825 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--usb--class--cdc-wdm.ko.cil.i[315654,315667] [2021-11-06 22:01:46,826 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--usb--class--cdc-wdm.ko.cil.i[315813,315826] [2021-11-06 22:01:46,826 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--usb--class--cdc-wdm.ko.cil.i[315959,315972] [2021-11-06 22:01:46,827 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--usb--class--cdc-wdm.ko.cil.i[316102,316115] [2021-11-06 22:01:46,827 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--usb--class--cdc-wdm.ko.cil.i[316246,316259] [2021-11-06 22:01:46,828 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--usb--class--cdc-wdm.ko.cil.i[316389,316402] [2021-11-06 22:01:46,828 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--usb--class--cdc-wdm.ko.cil.i[316533,316546] [2021-11-06 22:01:46,829 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--usb--class--cdc-wdm.ko.cil.i[316674,316687] [2021-11-06 22:01:46,830 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--usb--class--cdc-wdm.ko.cil.i[316812,316825] [2021-11-06 22:01:46,830 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--usb--class--cdc-wdm.ko.cil.i[316970,316983] [2021-11-06 22:01:46,830 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--usb--class--cdc-wdm.ko.cil.i[317129,317142] [2021-11-06 22:01:46,833 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--usb--class--cdc-wdm.ko.cil.i[317285,317298] [2021-11-06 22:01:46,833 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--usb--class--cdc-wdm.ko.cil.i[317434,317447] [2021-11-06 22:01:46,834 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--usb--class--cdc-wdm.ko.cil.i[317586,317599] [2021-11-06 22:01:46,834 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--usb--class--cdc-wdm.ko.cil.i[317737,317750] [2021-11-06 22:01:46,834 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--usb--class--cdc-wdm.ko.cil.i[317886,317899] [2021-11-06 22:01:46,834 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--usb--class--cdc-wdm.ko.cil.i[318038,318051] [2021-11-06 22:01:46,835 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--usb--class--cdc-wdm.ko.cil.i[318186,318199] [2021-11-06 22:01:46,836 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--usb--class--cdc-wdm.ko.cil.i[318339,318352] [2021-11-06 22:01:46,836 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--usb--class--cdc-wdm.ko.cil.i[318490,318503] [2021-11-06 22:01:46,836 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--usb--class--cdc-wdm.ko.cil.i[318640,318653] [2021-11-06 22:01:46,837 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--usb--class--cdc-wdm.ko.cil.i[318787,318800] [2021-11-06 22:01:46,837 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--usb--class--cdc-wdm.ko.cil.i[318938,318951] [2021-11-06 22:01:46,837 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--usb--class--cdc-wdm.ko.cil.i[319089,319102] [2021-11-06 22:01:46,837 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--usb--class--cdc-wdm.ko.cil.i[319237,319250] [2021-11-06 22:01:46,838 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--usb--class--cdc-wdm.ko.cil.i[319403,319416] [2021-11-06 22:01:46,838 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--usb--class--cdc-wdm.ko.cil.i[319572,319585] [2021-11-06 22:01:46,838 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--usb--class--cdc-wdm.ko.cil.i[319739,319752] [2021-11-06 22:01:46,839 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--usb--class--cdc-wdm.ko.cil.i[319907,319920] [2021-11-06 22:01:46,839 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--usb--class--cdc-wdm.ko.cil.i[320057,320070] [2021-11-06 22:01:46,839 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--usb--class--cdc-wdm.ko.cil.i[320204,320217] [2021-11-06 22:01:46,839 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--usb--class--cdc-wdm.ko.cil.i[320365,320378] [2021-11-06 22:01:46,840 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--usb--class--cdc-wdm.ko.cil.i[320535,320548] [2021-11-06 22:01:46,840 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--usb--class--cdc-wdm.ko.cil.i[320697,320710] [2021-11-06 22:01:46,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 22:01:46,875 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 22:01:47,046 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--usb--class--cdc-wdm.ko.cil.i[307309,307322] [2021-11-06 22:01:47,047 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--usb--class--cdc-wdm.ko.cil.i[307454,307467] [2021-11-06 22:01:47,047 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--usb--class--cdc-wdm.ko.cil.i[307600,307613] [2021-11-06 22:01:47,048 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--usb--class--cdc-wdm.ko.cil.i[307765,307778] [2021-11-06 22:01:47,049 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--usb--class--cdc-wdm.ko.cil.i[307923,307936] [2021-11-06 22:01:47,051 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--usb--class--cdc-wdm.ko.cil.i[308081,308094] [2021-11-06 22:01:47,052 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--usb--class--cdc-wdm.ko.cil.i[308239,308252] [2021-11-06 22:01:47,053 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--usb--class--cdc-wdm.ko.cil.i[308399,308412] [2021-11-06 22:01:47,053 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--usb--class--cdc-wdm.ko.cil.i[308558,308571] [2021-11-06 22:01:47,054 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--usb--class--cdc-wdm.ko.cil.i[308697,308710] [2021-11-06 22:01:47,054 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--usb--class--cdc-wdm.ko.cil.i[308839,308852] [2021-11-06 22:01:47,055 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--usb--class--cdc-wdm.ko.cil.i[308988,309001] [2021-11-06 22:01:47,055 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--usb--class--cdc-wdm.ko.cil.i[309127,309140] [2021-11-06 22:01:47,055 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--usb--class--cdc-wdm.ko.cil.i[309282,309295] [2021-11-06 22:01:47,055 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--usb--class--cdc-wdm.ko.cil.i[309442,309455] [2021-11-06 22:01:47,056 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--usb--class--cdc-wdm.ko.cil.i[309593,309606] [2021-11-06 22:01:47,056 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--usb--class--cdc-wdm.ko.cil.i[309744,309757] [2021-11-06 22:01:47,056 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--usb--class--cdc-wdm.ko.cil.i[309896,309909] [2021-11-06 22:01:47,057 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--usb--class--cdc-wdm.ko.cil.i[310045,310058] [2021-11-06 22:01:47,057 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--usb--class--cdc-wdm.ko.cil.i[310193,310206] [2021-11-06 22:01:47,057 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--usb--class--cdc-wdm.ko.cil.i[310350,310363] [2021-11-06 22:01:47,057 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--usb--class--cdc-wdm.ko.cil.i[310499,310512] [2021-11-06 22:01:47,058 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--usb--class--cdc-wdm.ko.cil.i[310655,310668] [2021-11-06 22:01:47,058 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--usb--class--cdc-wdm.ko.cil.i[310808,310821] [2021-11-06 22:01:47,059 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--usb--class--cdc-wdm.ko.cil.i[310954,310967] [2021-11-06 22:01:47,060 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--usb--class--cdc-wdm.ko.cil.i[311097,311110] [2021-11-06 22:01:47,060 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--usb--class--cdc-wdm.ko.cil.i[311249,311262] [2021-11-06 22:01:47,060 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--usb--class--cdc-wdm.ko.cil.i[311395,311408] [2021-11-06 22:01:47,060 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--usb--class--cdc-wdm.ko.cil.i[311540,311553] [2021-11-06 22:01:47,063 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--usb--class--cdc-wdm.ko.cil.i[311694,311707] [2021-11-06 22:01:47,064 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--usb--class--cdc-wdm.ko.cil.i[311845,311858] [2021-11-06 22:01:47,064 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--usb--class--cdc-wdm.ko.cil.i[312000,312013] [2021-11-06 22:01:47,065 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--usb--class--cdc-wdm.ko.cil.i[312152,312165] [2021-11-06 22:01:47,065 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--usb--class--cdc-wdm.ko.cil.i[312307,312320] [2021-11-06 22:01:47,065 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--usb--class--cdc-wdm.ko.cil.i[312471,312484] [2021-11-06 22:01:47,065 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--usb--class--cdc-wdm.ko.cil.i[312627,312640] [2021-11-06 22:01:47,066 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--usb--class--cdc-wdm.ko.cil.i[312791,312804] [2021-11-06 22:01:47,066 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--usb--class--cdc-wdm.ko.cil.i[312933,312946] [2021-11-06 22:01:47,066 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--usb--class--cdc-wdm.ko.cil.i[313091,313104] [2021-11-06 22:01:47,067 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--usb--class--cdc-wdm.ko.cil.i[313258,313271] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[313417,313430] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[313576,313589] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[313725,313738] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[313872,313885] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[314011,314024] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[314174,314187] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[314340,314353] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[314504,314517] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[314669,314682] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[314834,314847] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[315000,315013] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[315165,315178] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[315332,315345] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[315492,315505] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[315654,315667] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[315813,315826] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[315959,315972] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[316102,316115] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[316246,316259] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[316389,316402] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[316533,316546] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[316674,316687] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[316812,316825] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[316970,316983] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[317129,317142] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[317285,317298] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[317434,317447] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[317586,317599] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[317737,317750] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[317886,317899] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[318038,318051] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[318186,318199] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[318339,318352] [2021-11-06 22:01:47,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--usb--class--cdc-wdm.ko.cil.i[318490,318503] [2021-11-06 22:01:47,120 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--usb--class--cdc-wdm.ko.cil.i[318640,318653] [2021-11-06 22:01:47,120 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--usb--class--cdc-wdm.ko.cil.i[318787,318800] [2021-11-06 22:01:47,120 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--usb--class--cdc-wdm.ko.cil.i[318938,318951] [2021-11-06 22:01:47,121 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--usb--class--cdc-wdm.ko.cil.i[319089,319102] [2021-11-06 22:01:47,122 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--usb--class--cdc-wdm.ko.cil.i[319237,319250] [2021-11-06 22:01:47,122 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--usb--class--cdc-wdm.ko.cil.i[319403,319416] [2021-11-06 22:01:47,123 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--usb--class--cdc-wdm.ko.cil.i[319572,319585] [2021-11-06 22:01:47,123 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--usb--class--cdc-wdm.ko.cil.i[319739,319752] [2021-11-06 22:01:47,124 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--usb--class--cdc-wdm.ko.cil.i[319907,319920] [2021-11-06 22:01:47,124 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--usb--class--cdc-wdm.ko.cil.i[320057,320070] [2021-11-06 22:01:47,124 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--usb--class--cdc-wdm.ko.cil.i[320204,320217] [2021-11-06 22:01:47,125 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--usb--class--cdc-wdm.ko.cil.i[320365,320378] [2021-11-06 22:01:47,125 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--usb--class--cdc-wdm.ko.cil.i[320535,320548] [2021-11-06 22:01:47,125 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--usb--class--cdc-wdm.ko.cil.i[320697,320710] [2021-11-06 22:01:47,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 22:01:47,251 INFO L208 MainTranslator]: Completed translation [2021-11-06 22:01:47,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:47 WrapperNode [2021-11-06 22:01:47,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 22:01:47,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 22:01:47,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 22:01:47,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 22:01:47,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:47" (1/1) ... [2021-11-06 22:01:47,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:47" (1/1) ... [2021-11-06 22:01:47,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 22:01:47,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 22:01:47,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 22:01:47,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 22:01:47,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:47" (1/1) ... [2021-11-06 22:01:47,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:47" (1/1) ... [2021-11-06 22:01:47,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:47" (1/1) ... [2021-11-06 22:01:47,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:47" (1/1) ... [2021-11-06 22:01:47,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:47" (1/1) ... [2021-11-06 22:01:47,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:47" (1/1) ... [2021-11-06 22:01:47,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:47" (1/1) ... [2021-11-06 22:01:47,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 22:01:47,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 22:01:47,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 22:01:47,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 22:01:47,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:47" (1/1) ... [2021-11-06 22:01:47,719 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 22:01:47,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:01:47,735 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 22:01:47,752 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 22:01:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 22:01:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 22:01:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 22:01:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 22:01:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 22:01:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 22:01:47,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 22:01:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 22:01:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 22:01:47,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 22:01:47,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 22:01:47,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 22:01:57,931 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_5_returnLabel: main_#res := 0; [2021-11-06 22:01:57,933 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L6765: #t~ret822 := main_#res; [2021-11-06 22:01:57,934 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 22:01:57,949 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 22:01:57,949 INFO L299 CfgBuilder]: Removed 2091 assume(true) statements. [2021-11-06 22:01:57,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:57 BoogieIcfgContainer [2021-11-06 22:01:57,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 22:01:57,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 22:01:57,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 22:01:57,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 22:01:57,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:01:44" (1/3) ... [2021-11-06 22:01:57,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3785ac14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:01:57, skipping insertion in model container [2021-11-06 22:01:57,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:47" (2/3) ... [2021-11-06 22:01:57,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3785ac14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:01:57, skipping insertion in model container [2021-11-06 22:01:57,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:57" (3/3) ... [2021-11-06 22:01:57,960 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2021-11-06 22:01:57,963 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 22:01:57,964 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 160 error locations. [2021-11-06 22:01:58,006 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 22:01:58,010 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 22:01:58,010 INFO L340 AbstractCegarLoop]: Starting to check reachability of 160 error locations. [2021-11-06 22:01:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 1824 states, 1664 states have (on average 1.3972355769230769) internal successors, (2325), 1823 states have internal predecessors, (2325), 0 states have call successors, (0), 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 22:01:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-06 22:01:58,051 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:01:58,052 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] [2021-11-06 22:01:58,052 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:01:58,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:01:58,057 INFO L85 PathProgramCache]: Analyzing trace with hash -927681528, now seen corresponding path program 1 times [2021-11-06 22:01:58,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:01:58,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422159093] [2021-11-06 22:01:58,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:01:58,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:01:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:01:58,512 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 22:01:58,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:01:58,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422159093] [2021-11-06 22:01:58,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422159093] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:01:58,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:01:58,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:01:58,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140327889] [2021-11-06 22:01:58,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:01:58,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:01:58,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:01:58,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:01:58,531 INFO L87 Difference]: Start difference. First operand has 1824 states, 1664 states have (on average 1.3972355769230769) internal successors, (2325), 1823 states have internal predecessors, (2325), 0 states have call successors, (0), 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 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 22:01:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:01:58,687 INFO L93 Difference]: Finished difference Result 3563 states and 4539 transitions. [2021-11-06 22:01:58,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:01:58,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-11-06 22:01:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:01:58,709 INFO L225 Difference]: With dead ends: 3563 [2021-11-06 22:01:58,709 INFO L226 Difference]: Without dead ends: 1706 [2021-11-06 22:01:58,717 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 22:01:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2021-11-06 22:01:58,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1706. [2021-11-06 22:01:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1548 states have (on average 1.2487080103359174) internal successors, (1933), 1705 states have internal predecessors, (1933), 0 states have call successors, (0), 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 22:01:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 1933 transitions. [2021-11-06 22:01:58,820 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 1933 transitions. Word has length 29 [2021-11-06 22:01:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:01:58,821 INFO L470 AbstractCegarLoop]: Abstraction has 1706 states and 1933 transitions. [2021-11-06 22:01:58,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 22:01:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 1933 transitions. [2021-11-06 22:01:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-06 22:01:58,825 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:01:58,825 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] [2021-11-06 22:01:58,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 22:01:58,826 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:01:58,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:01:58,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1851460012, now seen corresponding path program 1 times [2021-11-06 22:01:58,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:01:58,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351364406] [2021-11-06 22:01:58,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:01:58,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:01:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:01:59,001 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 22:01:59,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:01:59,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351364406] [2021-11-06 22:01:59,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351364406] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:01:59,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:01:59,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:01:59,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698082202] [2021-11-06 22:01:59,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:01:59,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:01:59,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:01:59,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:01:59,004 INFO L87 Difference]: Start difference. First operand 1706 states and 1933 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 22:01:59,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:01:59,055 INFO L93 Difference]: Finished difference Result 1706 states and 1933 transitions. [2021-11-06 22:01:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:01:59,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-11-06 22:01:59,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:01:59,061 INFO L225 Difference]: With dead ends: 1706 [2021-11-06 22:01:59,061 INFO L226 Difference]: Without dead ends: 1702 [2021-11-06 22:01:59,062 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 22:01:59,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2021-11-06 22:01:59,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2021-11-06 22:01:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1546 states have (on average 1.2477360931435963) internal successors, (1929), 1701 states have internal predecessors, (1929), 0 states have call successors, (0), 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 22:01:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 1929 transitions. [2021-11-06 22:01:59,165 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 1929 transitions. Word has length 31 [2021-11-06 22:01:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:01:59,165 INFO L470 AbstractCegarLoop]: Abstraction has 1702 states and 1929 transitions. [2021-11-06 22:01:59,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 22:01:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 1929 transitions. [2021-11-06 22:01:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-06 22:01:59,167 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:01:59,167 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] [2021-11-06 22:01:59,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 22:01:59,167 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:01:59,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:01:59,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1136822192, now seen corresponding path program 1 times [2021-11-06 22:01:59,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:01:59,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930394276] [2021-11-06 22:01:59,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:01:59,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:01:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:01:59,293 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 22:01:59,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:01:59,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930394276] [2021-11-06 22:01:59,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930394276] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:01:59,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:01:59,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:01:59,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789076322] [2021-11-06 22:01:59,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:01:59,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:01:59,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:01:59,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:01:59,295 INFO L87 Difference]: Start difference. First operand 1702 states and 1929 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 22:01:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:01:59,339 INFO L93 Difference]: Finished difference Result 1702 states and 1929 transitions. [2021-11-06 22:01:59,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:01:59,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-11-06 22:01:59,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:01:59,345 INFO L225 Difference]: With dead ends: 1702 [2021-11-06 22:01:59,345 INFO L226 Difference]: Without dead ends: 1698 [2021-11-06 22:01:59,346 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 22:01:59,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2021-11-06 22:01:59,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1698. [2021-11-06 22:01:59,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1544 states have (on average 1.246761658031088) internal successors, (1925), 1697 states have internal predecessors, (1925), 0 states have call successors, (0), 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 22:01:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 1925 transitions. [2021-11-06 22:01:59,387 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 1925 transitions. Word has length 33 [2021-11-06 22:01:59,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:01:59,387 INFO L470 AbstractCegarLoop]: Abstraction has 1698 states and 1925 transitions. [2021-11-06 22:01:59,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 22:01:59,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 1925 transitions. [2021-11-06 22:01:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-06 22:01:59,388 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:01:59,389 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] [2021-11-06 22:01:59,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 22:01:59,391 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:01:59,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:01:59,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1564644884, now seen corresponding path program 1 times [2021-11-06 22:01:59,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:01:59,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205639499] [2021-11-06 22:01:59,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:01:59,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:01:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:01:59,534 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 22:01:59,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:01:59,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205639499] [2021-11-06 22:01:59,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205639499] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:01:59,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:01:59,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:01:59,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846494883] [2021-11-06 22:01:59,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:01:59,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:01:59,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:01:59,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:01:59,536 INFO L87 Difference]: Start difference. First operand 1698 states and 1925 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 22:01:59,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:01:59,579 INFO L93 Difference]: Finished difference Result 1698 states and 1925 transitions. [2021-11-06 22:01:59,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:01:59,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2021-11-06 22:01:59,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:01:59,584 INFO L225 Difference]: With dead ends: 1698 [2021-11-06 22:01:59,584 INFO L226 Difference]: Without dead ends: 1694 [2021-11-06 22:01:59,585 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 22:01:59,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2021-11-06 22:01:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1694. [2021-11-06 22:01:59,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1542 states have (on average 1.2457846952010376) internal successors, (1921), 1693 states have internal predecessors, (1921), 0 states have call successors, (0), 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 22:01:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 1921 transitions. [2021-11-06 22:01:59,622 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 1921 transitions. Word has length 35 [2021-11-06 22:01:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:01:59,623 INFO L470 AbstractCegarLoop]: Abstraction has 1694 states and 1921 transitions. [2021-11-06 22:01:59,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 22:01:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 1921 transitions. [2021-11-06 22:01:59,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-06 22:01:59,624 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:01:59,624 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 22:01:59,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 22:01:59,624 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:01:59,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:01:59,625 INFO L85 PathProgramCache]: Analyzing trace with hash 385391832, now seen corresponding path program 1 times [2021-11-06 22:01:59,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:01:59,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494540556] [2021-11-06 22:01:59,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:01:59,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:01:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:01:59,745 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 22:01:59,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:01:59,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494540556] [2021-11-06 22:01:59,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494540556] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:01:59,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:01:59,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:01:59,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101472746] [2021-11-06 22:01:59,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:01:59,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:01:59,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:01:59,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:01:59,748 INFO L87 Difference]: Start difference. First operand 1694 states and 1921 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 22:01:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:01:59,802 INFO L93 Difference]: Finished difference Result 1694 states and 1921 transitions. [2021-11-06 22:01:59,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:01:59,803 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 22:01:59,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:01:59,809 INFO L225 Difference]: With dead ends: 1694 [2021-11-06 22:01:59,809 INFO L226 Difference]: Without dead ends: 1690 [2021-11-06 22:01:59,809 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 22:01:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2021-11-06 22:01:59,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1690. [2021-11-06 22:01:59,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1540 states have (on average 1.2448051948051948) internal successors, (1917), 1689 states have internal predecessors, (1917), 0 states have call successors, (0), 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 22:01:59,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 1917 transitions. [2021-11-06 22:01:59,849 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 1917 transitions. Word has length 37 [2021-11-06 22:01:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:01:59,850 INFO L470 AbstractCegarLoop]: Abstraction has 1690 states and 1917 transitions. [2021-11-06 22:01:59,850 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 22:01:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 1917 transitions. [2021-11-06 22:01:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 22:01:59,852 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:01:59,852 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 22:01:59,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 22:01:59,852 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:01:59,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:01:59,853 INFO L85 PathProgramCache]: Analyzing trace with hash 994575356, now seen corresponding path program 1 times [2021-11-06 22:01:59,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:01:59,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683099681] [2021-11-06 22:01:59,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:01:59,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:01:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:01:59,963 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 22:01:59,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:01:59,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683099681] [2021-11-06 22:01:59,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683099681] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:01:59,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:01:59,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:01:59,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872636471] [2021-11-06 22:01:59,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:01:59,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:01:59,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:01:59,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:01:59,966 INFO L87 Difference]: Start difference. First operand 1690 states and 1917 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 22:02:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:00,035 INFO L93 Difference]: Finished difference Result 1690 states and 1917 transitions. [2021-11-06 22:02:00,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:00,036 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 22:02:00,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:00,040 INFO L225 Difference]: With dead ends: 1690 [2021-11-06 22:02:00,041 INFO L226 Difference]: Without dead ends: 1686 [2021-11-06 22:02:00,041 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 22:02:00,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2021-11-06 22:02:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1686. [2021-11-06 22:02:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1538 states have (on average 1.2438231469440832) internal successors, (1913), 1685 states have internal predecessors, (1913), 0 states have call successors, (0), 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 22:02:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 1913 transitions. [2021-11-06 22:02:00,083 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 1913 transitions. Word has length 39 [2021-11-06 22:02:00,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:00,084 INFO L470 AbstractCegarLoop]: Abstraction has 1686 states and 1913 transitions. [2021-11-06 22:02:00,084 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 22:02:00,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 1913 transitions. [2021-11-06 22:02:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 22:02:00,087 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:00,087 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 22:02:00,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 22:02:00,087 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:00,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:00,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1990577280, now seen corresponding path program 1 times [2021-11-06 22:02:00,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:00,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849125049] [2021-11-06 22:02:00,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:00,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:00,202 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 22:02:00,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:00,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849125049] [2021-11-06 22:02:00,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849125049] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:00,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:00,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:00,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495433988] [2021-11-06 22:02:00,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:00,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:00,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:00,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:00,204 INFO L87 Difference]: Start difference. First operand 1686 states and 1913 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 22:02:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:00,255 INFO L93 Difference]: Finished difference Result 1686 states and 1913 transitions. [2021-11-06 22:02:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:00,255 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 22:02:00,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:00,260 INFO L225 Difference]: With dead ends: 1686 [2021-11-06 22:02:00,260 INFO L226 Difference]: Without dead ends: 1682 [2021-11-06 22:02:00,261 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 22:02:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2021-11-06 22:02:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1682. [2021-11-06 22:02:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1536 states have (on average 1.2428385416666667) internal successors, (1909), 1681 states have internal predecessors, (1909), 0 states have call successors, (0), 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 22:02:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 1909 transitions. [2021-11-06 22:02:00,306 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 1909 transitions. Word has length 41 [2021-11-06 22:02:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:00,306 INFO L470 AbstractCegarLoop]: Abstraction has 1682 states and 1909 transitions. [2021-11-06 22:02:00,307 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 22:02:00,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 1909 transitions. [2021-11-06 22:02:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 22:02:00,307 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:00,308 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 22:02:00,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 22:02:00,308 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:00,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1684106396, now seen corresponding path program 1 times [2021-11-06 22:02:00,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:00,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515977620] [2021-11-06 22:02:00,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:00,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:00,425 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 22:02:00,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:00,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515977620] [2021-11-06 22:02:00,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515977620] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:00,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:00,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:00,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634405057] [2021-11-06 22:02:00,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:00,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:00,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:00,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:00,428 INFO L87 Difference]: Start difference. First operand 1682 states and 1909 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 22:02:00,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:00,488 INFO L93 Difference]: Finished difference Result 1682 states and 1909 transitions. [2021-11-06 22:02:00,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:00,488 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 22:02:00,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:00,493 INFO L225 Difference]: With dead ends: 1682 [2021-11-06 22:02:00,493 INFO L226 Difference]: Without dead ends: 1678 [2021-11-06 22:02:00,494 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 22:02:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2021-11-06 22:02:00,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1678. [2021-11-06 22:02:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1534 states have (on average 1.241851368970013) internal successors, (1905), 1677 states have internal predecessors, (1905), 0 states have call successors, (0), 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 22:02:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 1905 transitions. [2021-11-06 22:02:00,539 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 1905 transitions. Word has length 43 [2021-11-06 22:02:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:00,539 INFO L470 AbstractCegarLoop]: Abstraction has 1678 states and 1905 transitions. [2021-11-06 22:02:00,539 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 22:02:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 1905 transitions. [2021-11-06 22:02:00,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-06 22:02:00,540 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:00,540 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 22:02:00,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 22:02:00,540 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:00,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:00,541 INFO L85 PathProgramCache]: Analyzing trace with hash 776636359, now seen corresponding path program 1 times [2021-11-06 22:02:00,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:00,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236393524] [2021-11-06 22:02:00,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:00,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:00,644 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 22:02:00,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:00,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236393524] [2021-11-06 22:02:00,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236393524] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:00,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:00,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:00,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809370513] [2021-11-06 22:02:00,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:00,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:00,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:00,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:00,647 INFO L87 Difference]: Start difference. First operand 1678 states and 1905 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 22:02:00,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:00,722 INFO L93 Difference]: Finished difference Result 1678 states and 1905 transitions. [2021-11-06 22:02:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:00,723 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 22:02:00,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:00,727 INFO L225 Difference]: With dead ends: 1678 [2021-11-06 22:02:00,727 INFO L226 Difference]: Without dead ends: 1674 [2021-11-06 22:02:00,728 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 22:02:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2021-11-06 22:02:00,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1674. [2021-11-06 22:02:00,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1532 states have (on average 1.2408616187989556) internal successors, (1901), 1673 states have internal predecessors, (1901), 0 states have call successors, (0), 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 22:02:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 1901 transitions. [2021-11-06 22:02:00,775 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 1901 transitions. Word has length 45 [2021-11-06 22:02:00,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:00,775 INFO L470 AbstractCegarLoop]: Abstraction has 1674 states and 1901 transitions. [2021-11-06 22:02:00,775 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 22:02:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 1901 transitions. [2021-11-06 22:02:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 22:02:00,776 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:00,776 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 22:02:00,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 22:02:00,776 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:00,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:00,776 INFO L85 PathProgramCache]: Analyzing trace with hash -976554869, now seen corresponding path program 1 times [2021-11-06 22:02:00,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:00,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528264499] [2021-11-06 22:02:00,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:00,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:00,888 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 22:02:00,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:00,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528264499] [2021-11-06 22:02:00,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528264499] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:00,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:00,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:00,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871018936] [2021-11-06 22:02:00,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:00,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:00,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:00,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:00,890 INFO L87 Difference]: Start difference. First operand 1674 states and 1901 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 22:02:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:00,947 INFO L93 Difference]: Finished difference Result 1674 states and 1901 transitions. [2021-11-06 22:02:00,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:00,948 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 22:02:00,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:00,952 INFO L225 Difference]: With dead ends: 1674 [2021-11-06 22:02:00,953 INFO L226 Difference]: Without dead ends: 1670 [2021-11-06 22:02:00,954 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 22:02:00,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2021-11-06 22:02:00,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2021-11-06 22:02:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1530 states have (on average 1.2398692810457517) internal successors, (1897), 1669 states have internal predecessors, (1897), 0 states have call successors, (0), 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 22:02:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 1897 transitions. [2021-11-06 22:02:01,001 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 1897 transitions. Word has length 47 [2021-11-06 22:02:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:01,001 INFO L470 AbstractCegarLoop]: Abstraction has 1670 states and 1897 transitions. [2021-11-06 22:02:01,002 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 22:02:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 1897 transitions. [2021-11-06 22:02:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 22:02:01,002 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:01,002 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 22:02:01,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 22:02:01,003 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:01,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:01,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2128822703, now seen corresponding path program 1 times [2021-11-06 22:02:01,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:01,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226295714] [2021-11-06 22:02:01,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:01,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:01,121 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 22:02:01,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:01,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226295714] [2021-11-06 22:02:01,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226295714] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:01,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:01,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:01,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611912884] [2021-11-06 22:02:01,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:01,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:01,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:01,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:01,124 INFO L87 Difference]: Start difference. First operand 1670 states and 1897 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 22:02:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:01,183 INFO L93 Difference]: Finished difference Result 1670 states and 1897 transitions. [2021-11-06 22:02:01,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:01,183 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 22:02:01,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:01,188 INFO L225 Difference]: With dead ends: 1670 [2021-11-06 22:02:01,189 INFO L226 Difference]: Without dead ends: 1666 [2021-11-06 22:02:01,189 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 22:02:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2021-11-06 22:02:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2021-11-06 22:02:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1528 states have (on average 1.2388743455497382) internal successors, (1893), 1665 states have internal predecessors, (1893), 0 states have call successors, (0), 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 22:02:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 1893 transitions. [2021-11-06 22:02:01,240 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 1893 transitions. Word has length 49 [2021-11-06 22:02:01,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:01,240 INFO L470 AbstractCegarLoop]: Abstraction has 1666 states and 1893 transitions. [2021-11-06 22:02:01,240 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 22:02:01,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 1893 transitions. [2021-11-06 22:02:01,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 22:02:01,241 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:01,241 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 22:02:01,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 22:02:01,241 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:01,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:01,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1394399027, now seen corresponding path program 1 times [2021-11-06 22:02:01,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:01,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485296630] [2021-11-06 22:02:01,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:01,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:01,395 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 22:02:01,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:01,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485296630] [2021-11-06 22:02:01,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485296630] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:01,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:01,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:01,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566400288] [2021-11-06 22:02:01,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:01,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:01,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:01,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:01,397 INFO L87 Difference]: Start difference. First operand 1666 states and 1893 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 22:02:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:01,460 INFO L93 Difference]: Finished difference Result 1666 states and 1893 transitions. [2021-11-06 22:02:01,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:01,460 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 22:02:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:01,465 INFO L225 Difference]: With dead ends: 1666 [2021-11-06 22:02:01,465 INFO L226 Difference]: Without dead ends: 1662 [2021-11-06 22:02:01,466 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 22:02:01,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2021-11-06 22:02:01,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1662. [2021-11-06 22:02:01,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1526 states have (on average 1.2378768020969855) internal successors, (1889), 1661 states have internal predecessors, (1889), 0 states have call successors, (0), 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 22:02:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 1889 transitions. [2021-11-06 22:02:01,518 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 1889 transitions. Word has length 51 [2021-11-06 22:02:01,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:01,518 INFO L470 AbstractCegarLoop]: Abstraction has 1662 states and 1889 transitions. [2021-11-06 22:02:01,518 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 22:02:01,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 1889 transitions. [2021-11-06 22:02:01,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 22:02:01,519 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:01,519 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 22:02:01,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 22:02:01,519 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:01,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:01,520 INFO L85 PathProgramCache]: Analyzing trace with hash -12116713, now seen corresponding path program 1 times [2021-11-06 22:02:01,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:01,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461275971] [2021-11-06 22:02:01,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:01,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:01,623 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 22:02:01,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:01,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461275971] [2021-11-06 22:02:01,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461275971] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:01,624 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:01,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:01,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692630613] [2021-11-06 22:02:01,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:01,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:01,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:01,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:01,625 INFO L87 Difference]: Start difference. First operand 1662 states and 1889 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 22:02:01,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:01,686 INFO L93 Difference]: Finished difference Result 1662 states and 1889 transitions. [2021-11-06 22:02:01,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:01,687 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 22:02:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:01,691 INFO L225 Difference]: With dead ends: 1662 [2021-11-06 22:02:01,691 INFO L226 Difference]: Without dead ends: 1658 [2021-11-06 22:02:01,692 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 22:02:01,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2021-11-06 22:02:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1658. [2021-11-06 22:02:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1524 states have (on average 1.2368766404199476) internal successors, (1885), 1657 states have internal predecessors, (1885), 0 states have call successors, (0), 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 22:02:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 1885 transitions. [2021-11-06 22:02:01,747 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 1885 transitions. Word has length 53 [2021-11-06 22:02:01,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:01,748 INFO L470 AbstractCegarLoop]: Abstraction has 1658 states and 1885 transitions. [2021-11-06 22:02:01,748 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 22:02:01,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 1885 transitions. [2021-11-06 22:02:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 22:02:01,749 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:01,749 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] [2021-11-06 22:02:01,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 22:02:01,749 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr94ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:01,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:01,749 INFO L85 PathProgramCache]: Analyzing trace with hash 714458001, now seen corresponding path program 1 times [2021-11-06 22:02:01,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:01,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846143678] [2021-11-06 22:02:01,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:01,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:01,978 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 22:02:01,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:01,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846143678] [2021-11-06 22:02:01,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846143678] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:01,979 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:01,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:01,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052671638] [2021-11-06 22:02:01,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:01,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:01,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:01,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:01,981 INFO L87 Difference]: Start difference. First operand 1658 states and 1885 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 22:02:02,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:02,172 INFO L93 Difference]: Finished difference Result 1962 states and 2203 transitions. [2021-11-06 22:02:02,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:02:02,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-11-06 22:02:02,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:02,178 INFO L225 Difference]: With dead ends: 1962 [2021-11-06 22:02:02,178 INFO L226 Difference]: Without dead ends: 1956 [2021-11-06 22:02:02,179 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 22:02:02,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2021-11-06 22:02:02,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1652. [2021-11-06 22:02:02,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1521 states have (on average 1.235371466140697) internal successors, (1879), 1651 states have internal predecessors, (1879), 0 states have call successors, (0), 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 22:02:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 1879 transitions. [2021-11-06 22:02:02,259 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 1879 transitions. Word has length 54 [2021-11-06 22:02:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:02,259 INFO L470 AbstractCegarLoop]: Abstraction has 1652 states and 1879 transitions. [2021-11-06 22:02:02,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 22:02:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 1879 transitions. [2021-11-06 22:02:02,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 22:02:02,260 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:02,260 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 22:02:02,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 22:02:02,260 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:02,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:02,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1240955739, now seen corresponding path program 1 times [2021-11-06 22:02:02,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:02,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215213501] [2021-11-06 22:02:02,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:02,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:02,417 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 22:02:02,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:02,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215213501] [2021-11-06 22:02:02,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215213501] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:02,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:02,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:02,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564468050] [2021-11-06 22:02:02,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:02,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:02,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:02,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:02,424 INFO L87 Difference]: Start difference. First operand 1652 states and 1879 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 22:02:02,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:02,509 INFO L93 Difference]: Finished difference Result 1652 states and 1879 transitions. [2021-11-06 22:02:02,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:02,509 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 22:02:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:02,514 INFO L225 Difference]: With dead ends: 1652 [2021-11-06 22:02:02,514 INFO L226 Difference]: Without dead ends: 1648 [2021-11-06 22:02:02,515 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 22:02:02,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2021-11-06 22:02:02,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2021-11-06 22:02:02,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1519 states have (on average 1.2343647136273865) internal successors, (1875), 1647 states have internal predecessors, (1875), 0 states have call successors, (0), 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 22:02:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 1875 transitions. [2021-11-06 22:02:02,583 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 1875 transitions. Word has length 55 [2021-11-06 22:02:02,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:02,583 INFO L470 AbstractCegarLoop]: Abstraction has 1648 states and 1875 transitions. [2021-11-06 22:02:02,584 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 22:02:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 1875 transitions. [2021-11-06 22:02:02,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 22:02:02,584 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:02,584 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 22:02:02,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 22:02:02,585 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:02,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:02,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2087886027, now seen corresponding path program 1 times [2021-11-06 22:02:02,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:02,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827668015] [2021-11-06 22:02:02,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:02,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:02,691 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 22:02:02,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:02,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827668015] [2021-11-06 22:02:02,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827668015] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:02,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:02,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:02,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896589805] [2021-11-06 22:02:02,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 22:02:02,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:02,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 22:02:02,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:02:02,695 INFO L87 Difference]: Start difference. First operand 1648 states and 1875 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) 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 22:02:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:02,799 INFO L93 Difference]: Finished difference Result 2905 states and 3296 transitions. [2021-11-06 22:02:02,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 22:02:02,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) 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 22:02:02,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:02,804 INFO L225 Difference]: With dead ends: 2905 [2021-11-06 22:02:02,804 INFO L226 Difference]: Without dead ends: 1645 [2021-11-06 22:02:02,807 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 22:02:02,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2021-11-06 22:02:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1645. [2021-11-06 22:02:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1517 states have (on average 1.2333553065260383) internal successors, (1871), 1644 states have internal predecessors, (1871), 0 states have call successors, (0), 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 22:02:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 1871 transitions. [2021-11-06 22:02:02,904 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 1871 transitions. Word has length 55 [2021-11-06 22:02:02,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:02,905 INFO L470 AbstractCegarLoop]: Abstraction has 1645 states and 1871 transitions. [2021-11-06 22:02:02,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) 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 22:02:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 1871 transitions. [2021-11-06 22:02:02,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-06 22:02:02,909 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:02,910 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] [2021-11-06 22:02:02,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 22:02:02,910 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:02,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:02,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1641931711, now seen corresponding path program 1 times [2021-11-06 22:02:02,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:02,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454024810] [2021-11-06 22:02:02,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:02,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:03,123 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 22:02:03,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:03,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454024810] [2021-11-06 22:02:03,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454024810] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:03,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:03,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:02:03,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040527112] [2021-11-06 22:02:03,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:02:03,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:03,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:02:03,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:02:03,125 INFO L87 Difference]: Start difference. First operand 1645 states and 1871 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:02:03,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:03,479 INFO L93 Difference]: Finished difference Result 4265 states and 4816 transitions. [2021-11-06 22:02:03,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:02:03,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-06 22:02:03,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:03,495 INFO L225 Difference]: With dead ends: 4265 [2021-11-06 22:02:03,499 INFO L226 Difference]: Without dead ends: 2684 [2021-11-06 22:02:03,503 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 22:02:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2021-11-06 22:02:03,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 1645. [2021-11-06 22:02:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1517 states have (on average 1.2221489782465391) internal successors, (1854), 1644 states have internal predecessors, (1854), 0 states have call successors, (0), 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 22:02:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 1854 transitions. [2021-11-06 22:02:03,581 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 1854 transitions. Word has length 56 [2021-11-06 22:02:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:03,582 INFO L470 AbstractCegarLoop]: Abstraction has 1645 states and 1854 transitions. [2021-11-06 22:02:03,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:02:03,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 1854 transitions. [2021-11-06 22:02:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-06 22:02:03,582 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:03,583 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] [2021-11-06 22:02:03,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 22:02:03,583 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:03,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:03,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1641991293, now seen corresponding path program 1 times [2021-11-06 22:02:03,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:03,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813724565] [2021-11-06 22:02:03,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:03,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:03,690 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 22:02:03,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:03,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813724565] [2021-11-06 22:02:03,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813724565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:03,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:03,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:02:03,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552226285] [2021-11-06 22:02:03,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:03,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:03,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:03,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:03,693 INFO L87 Difference]: Start difference. First operand 1645 states and 1854 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:02:04,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:04,038 INFO L93 Difference]: Finished difference Result 2705 states and 3025 transitions. [2021-11-06 22:02:04,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:02:04,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-06 22:02:04,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:04,043 INFO L225 Difference]: With dead ends: 2705 [2021-11-06 22:02:04,044 INFO L226 Difference]: Without dead ends: 2671 [2021-11-06 22:02:04,044 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 22:02:04,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2021-11-06 22:02:04,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 1611. [2021-11-06 22:02:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1500 states have (on average 1.2133333333333334) internal successors, (1820), 1610 states have internal predecessors, (1820), 0 states have call successors, (0), 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 22:02:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 1820 transitions. [2021-11-06 22:02:04,137 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 1820 transitions. Word has length 56 [2021-11-06 22:02:04,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:04,137 INFO L470 AbstractCegarLoop]: Abstraction has 1611 states and 1820 transitions. [2021-11-06 22:02:04,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:02:04,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 1820 transitions. [2021-11-06 22:02:04,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 22:02:04,138 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:04,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] [2021-11-06 22:02:04,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 22:02:04,138 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:04,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:04,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1442227713, now seen corresponding path program 1 times [2021-11-06 22:02:04,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:04,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210952020] [2021-11-06 22:02:04,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:04,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:04,260 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 22:02:04,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:04,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210952020] [2021-11-06 22:02:04,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210952020] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:04,260 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:04,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:04,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385121931] [2021-11-06 22:02:04,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:04,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:04,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:04,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:04,263 INFO L87 Difference]: Start difference. First operand 1611 states and 1820 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 22:02:04,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:04,363 INFO L93 Difference]: Finished difference Result 1611 states and 1820 transitions. [2021-11-06 22:02:04,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:04,364 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 22:02:04,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:04,367 INFO L225 Difference]: With dead ends: 1611 [2021-11-06 22:02:04,367 INFO L226 Difference]: Without dead ends: 1607 [2021-11-06 22:02:04,367 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 22:02:04,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2021-11-06 22:02:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1607. [2021-11-06 22:02:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 1498 states have (on average 1.212283044058745) internal successors, (1816), 1606 states have internal predecessors, (1816), 0 states have call successors, (0), 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 22:02:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 1816 transitions. [2021-11-06 22:02:04,452 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 1816 transitions. Word has length 57 [2021-11-06 22:02:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:04,453 INFO L470 AbstractCegarLoop]: Abstraction has 1607 states and 1816 transitions. [2021-11-06 22:02:04,453 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 22:02:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 1816 transitions. [2021-11-06 22:02:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 22:02:04,453 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:04,453 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 22:02:04,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 22:02:04,454 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:04,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:04,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1432788055, now seen corresponding path program 1 times [2021-11-06 22:02:04,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:04,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636256776] [2021-11-06 22:02:04,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:04,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:04,569 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 22:02:04,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:04,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636256776] [2021-11-06 22:02:04,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636256776] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:04,570 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:04,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:04,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965922260] [2021-11-06 22:02:04,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:04,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:04,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:04,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:04,571 INFO L87 Difference]: Start difference. First operand 1607 states and 1816 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 22:02:04,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:04,909 INFO L93 Difference]: Finished difference Result 1808 states and 2023 transitions. [2021-11-06 22:02:04,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:02:04,909 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 22:02:04,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:04,912 INFO L225 Difference]: With dead ends: 1808 [2021-11-06 22:02:04,913 INFO L226 Difference]: Without dead ends: 1788 [2021-11-06 22:02:04,913 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 22:02:04,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2021-11-06 22:02:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1587. [2021-11-06 22:02:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1488 states have (on average 1.206989247311828) internal successors, (1796), 1586 states have internal predecessors, (1796), 0 states have call successors, (0), 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 22:02:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 1796 transitions. [2021-11-06 22:02:05,005 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 1796 transitions. Word has length 57 [2021-11-06 22:02:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:05,005 INFO L470 AbstractCegarLoop]: Abstraction has 1587 states and 1796 transitions. [2021-11-06 22:02:05,006 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 22:02:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 1796 transitions. [2021-11-06 22:02:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 22:02:05,006 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:05,006 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 22:02:05,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 22:02:05,007 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:05,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:05,007 INFO L85 PathProgramCache]: Analyzing trace with hash -170513842, now seen corresponding path program 1 times [2021-11-06 22:02:05,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:05,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708778419] [2021-11-06 22:02:05,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:05,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:05,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 22:02:05,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:05,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708778419] [2021-11-06 22:02:05,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708778419] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:05,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:05,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 22:02:05,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200517081] [2021-11-06 22:02:05,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:02:05,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:05,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:02:05,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:02:05,148 INFO L87 Difference]: Start difference. First operand 1587 states and 1796 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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 22:02:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:05,331 INFO L93 Difference]: Finished difference Result 2849 states and 3216 transitions. [2021-11-06 22:02:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:05,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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 22:02:05,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:05,334 INFO L225 Difference]: With dead ends: 2849 [2021-11-06 22:02:05,334 INFO L226 Difference]: Without dead ends: 1631 [2021-11-06 22:02:05,336 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 22:02:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2021-11-06 22:02:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1584. [2021-11-06 22:02:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1486 states have (on average 1.205921938088829) internal successors, (1792), 1583 states have internal predecessors, (1792), 0 states have call successors, (0), 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 22:02:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 1792 transitions. [2021-11-06 22:02:05,464 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 1792 transitions. Word has length 58 [2021-11-06 22:02:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:05,465 INFO L470 AbstractCegarLoop]: Abstraction has 1584 states and 1792 transitions. [2021-11-06 22:02:05,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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 22:02:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 1792 transitions. [2021-11-06 22:02:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 22:02:05,466 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:05,466 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 22:02:05,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 22:02:05,466 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:05,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:05,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1293820163, now seen corresponding path program 1 times [2021-11-06 22:02:05,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:05,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435676327] [2021-11-06 22:02:05,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:05,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:05,623 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 22:02:05,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:05,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435676327] [2021-11-06 22:02:05,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435676327] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:05,624 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:05,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:05,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395741527] [2021-11-06 22:02:05,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:05,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:05,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:05,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:05,625 INFO L87 Difference]: Start difference. First operand 1584 states and 1792 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 22:02:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:05,760 INFO L93 Difference]: Finished difference Result 1584 states and 1792 transitions. [2021-11-06 22:02:05,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:05,760 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 22:02:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:05,763 INFO L225 Difference]: With dead ends: 1584 [2021-11-06 22:02:05,763 INFO L226 Difference]: Without dead ends: 1580 [2021-11-06 22:02:05,764 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 22:02:05,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2021-11-06 22:02:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2021-11-06 22:02:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1484 states have (on average 1.2048517520215634) internal successors, (1788), 1579 states have internal predecessors, (1788), 0 states have call successors, (0), 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 22:02:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 1788 transitions. [2021-11-06 22:02:05,856 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 1788 transitions. Word has length 59 [2021-11-06 22:02:05,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:05,856 INFO L470 AbstractCegarLoop]: Abstraction has 1580 states and 1788 transitions. [2021-11-06 22:02:05,856 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 22:02:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 1788 transitions. [2021-11-06 22:02:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 22:02:05,857 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:05,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, 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 22:02:05,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 22:02:05,857 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:05,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:05,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1184205734, now seen corresponding path program 1 times [2021-11-06 22:02:05,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:05,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999090125] [2021-11-06 22:02:05,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:05,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:05,971 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 22:02:05,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:05,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999090125] [2021-11-06 22:02:05,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999090125] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:05,972 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:05,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 22:02:05,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288768272] [2021-11-06 22:02:05,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 22:02:05,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:05,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 22:02:05,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:02:05,974 INFO L87 Difference]: Start difference. First operand 1580 states and 1788 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 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 22:02:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:06,111 INFO L93 Difference]: Finished difference Result 3041 states and 3445 transitions. [2021-11-06 22:02:06,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 22:02:06,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 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 22:02:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:06,114 INFO L225 Difference]: With dead ends: 3041 [2021-11-06 22:02:06,114 INFO L226 Difference]: Without dead ends: 1529 [2021-11-06 22:02:06,116 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 22:02:06,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2021-11-06 22:02:06,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1529. [2021-11-06 22:02:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1450 states have (on average 1.186206896551724) internal successors, (1720), 1528 states have internal predecessors, (1720), 0 states have call successors, (0), 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 22:02:06,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 1720 transitions. [2021-11-06 22:02:06,204 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 1720 transitions. Word has length 59 [2021-11-06 22:02:06,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:06,204 INFO L470 AbstractCegarLoop]: Abstraction has 1529 states and 1720 transitions. [2021-11-06 22:02:06,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 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 22:02:06,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1720 transitions. [2021-11-06 22:02:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 22:02:06,205 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:06,205 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 22:02:06,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 22:02:06,205 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:06,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:06,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2115844199, now seen corresponding path program 1 times [2021-11-06 22:02:06,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:06,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653937490] [2021-11-06 22:02:06,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:06,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:06,325 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 22:02:06,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:06,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653937490] [2021-11-06 22:02:06,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653937490] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:06,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:06,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:06,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664407684] [2021-11-06 22:02:06,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:06,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:06,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:06,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:06,327 INFO L87 Difference]: Start difference. First operand 1529 states and 1720 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 22:02:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:06,432 INFO L93 Difference]: Finished difference Result 1529 states and 1720 transitions. [2021-11-06 22:02:06,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:06,434 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 22:02:06,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:06,436 INFO L225 Difference]: With dead ends: 1529 [2021-11-06 22:02:06,436 INFO L226 Difference]: Without dead ends: 1525 [2021-11-06 22:02:06,437 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 22:02:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2021-11-06 22:02:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1525. [2021-11-06 22:02:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1448 states have (on average 1.1850828729281768) internal successors, (1716), 1524 states have internal predecessors, (1716), 0 states have call successors, (0), 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 22:02:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1716 transitions. [2021-11-06 22:02:06,528 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1716 transitions. Word has length 61 [2021-11-06 22:02:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:06,529 INFO L470 AbstractCegarLoop]: Abstraction has 1525 states and 1716 transitions. [2021-11-06 22:02:06,529 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 22:02:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1716 transitions. [2021-11-06 22:02:06,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 22:02:06,529 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:06,529 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 22:02:06,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 22:02:06,530 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:06,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:06,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1806960683, now seen corresponding path program 1 times [2021-11-06 22:02:06,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:06,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410832885] [2021-11-06 22:02:06,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:06,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:06,633 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 22:02:06,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:06,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410832885] [2021-11-06 22:02:06,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410832885] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:06,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:06,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:06,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746847230] [2021-11-06 22:02:06,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:06,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:06,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:06,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:06,635 INFO L87 Difference]: Start difference. First operand 1525 states and 1716 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 22:02:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:06,739 INFO L93 Difference]: Finished difference Result 1525 states and 1716 transitions. [2021-11-06 22:02:06,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:06,739 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 22:02:06,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:06,742 INFO L225 Difference]: With dead ends: 1525 [2021-11-06 22:02:06,742 INFO L226 Difference]: Without dead ends: 1521 [2021-11-06 22:02:06,743 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 22:02:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2021-11-06 22:02:06,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1521. [2021-11-06 22:02:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1446 states have (on average 1.1839557399723375) internal successors, (1712), 1520 states have internal predecessors, (1712), 0 states have call successors, (0), 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 22:02:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1712 transitions. [2021-11-06 22:02:06,837 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1712 transitions. Word has length 63 [2021-11-06 22:02:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:06,837 INFO L470 AbstractCegarLoop]: Abstraction has 1521 states and 1712 transitions. [2021-11-06 22:02:06,837 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 22:02:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1712 transitions. [2021-11-06 22:02:06,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 22:02:06,838 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:06,838 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 22:02:06,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 22:02:06,839 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr91ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:06,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:06,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1322645583, now seen corresponding path program 1 times [2021-11-06 22:02:06,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:06,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721253155] [2021-11-06 22:02:06,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:06,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:06,979 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 22:02:06,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:06,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721253155] [2021-11-06 22:02:06,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721253155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:06,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:06,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:06,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5186911] [2021-11-06 22:02:06,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:06,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:06,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:06,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:06,982 INFO L87 Difference]: Start difference. First operand 1521 states and 1712 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 22:02:07,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:07,092 INFO L93 Difference]: Finished difference Result 1521 states and 1712 transitions. [2021-11-06 22:02:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:07,092 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 22:02:07,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:07,095 INFO L225 Difference]: With dead ends: 1521 [2021-11-06 22:02:07,095 INFO L226 Difference]: Without dead ends: 1517 [2021-11-06 22:02:07,095 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 22:02:07,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2021-11-06 22:02:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1517. [2021-11-06 22:02:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1444 states have (on average 1.182825484764543) internal successors, (1708), 1516 states have internal predecessors, (1708), 0 states have call successors, (0), 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 22:02:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1708 transitions. [2021-11-06 22:02:07,191 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1708 transitions. Word has length 65 [2021-11-06 22:02:07,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:07,192 INFO L470 AbstractCegarLoop]: Abstraction has 1517 states and 1708 transitions. [2021-11-06 22:02:07,192 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 22:02:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1708 transitions. [2021-11-06 22:02:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 22:02:07,193 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:07,193 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 22:02:07,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-06 22:02:07,193 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:07,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:07,193 INFO L85 PathProgramCache]: Analyzing trace with hash -214087404, now seen corresponding path program 1 times [2021-11-06 22:02:07,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:07,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688395288] [2021-11-06 22:02:07,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:07,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:07,298 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 22:02:07,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:07,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688395288] [2021-11-06 22:02:07,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688395288] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:07,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:07,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:02:07,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563285729] [2021-11-06 22:02:07,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:07,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:07,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:07,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:07,300 INFO L87 Difference]: Start difference. First operand 1517 states and 1708 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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 22:02:09,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:09,792 INFO L93 Difference]: Finished difference Result 1756 states and 1962 transitions. [2021-11-06 22:02:09,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:02:09,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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 22:02:09,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:09,796 INFO L225 Difference]: With dead ends: 1756 [2021-11-06 22:02:09,796 INFO L226 Difference]: Without dead ends: 1736 [2021-11-06 22:02:09,796 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 22:02:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2021-11-06 22:02:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1497. [2021-11-06 22:02:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1434 states have (on average 1.1771269177126917) internal successors, (1688), 1496 states have internal predecessors, (1688), 0 states have call successors, (0), 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 22:02:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1688 transitions. [2021-11-06 22:02:09,940 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1688 transitions. Word has length 65 [2021-11-06 22:02:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:09,940 INFO L470 AbstractCegarLoop]: Abstraction has 1497 states and 1688 transitions. [2021-11-06 22:02:09,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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 22:02:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1688 transitions. [2021-11-06 22:02:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 22:02:09,941 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:09,941 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 22:02:09,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 22:02:09,941 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:09,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:09,942 INFO L85 PathProgramCache]: Analyzing trace with hash -247697197, now seen corresponding path program 1 times [2021-11-06 22:02:09,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:09,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295720820] [2021-11-06 22:02:09,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:09,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:10,050 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 22:02:10,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:10,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295720820] [2021-11-06 22:02:10,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295720820] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:10,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:10,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:10,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114926065] [2021-11-06 22:02:10,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:10,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:10,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:10,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:10,052 INFO L87 Difference]: Start difference. First operand 1497 states and 1688 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 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 22:02:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:10,161 INFO L93 Difference]: Finished difference Result 1497 states and 1688 transitions. [2021-11-06 22:02:10,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:10,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 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 22:02:10,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:10,164 INFO L225 Difference]: With dead ends: 1497 [2021-11-06 22:02:10,164 INFO L226 Difference]: Without dead ends: 1493 [2021-11-06 22:02:10,165 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 22:02:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2021-11-06 22:02:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1493. [2021-11-06 22:02:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1432 states have (on average 1.175977653631285) internal successors, (1684), 1492 states have internal predecessors, (1684), 0 states have call successors, (0), 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 22:02:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1684 transitions. [2021-11-06 22:02:10,263 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1684 transitions. Word has length 67 [2021-11-06 22:02:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:10,264 INFO L470 AbstractCegarLoop]: Abstraction has 1493 states and 1684 transitions. [2021-11-06 22:02:10,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 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 22:02:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1684 transitions. [2021-11-06 22:02:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 22:02:10,264 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:10,265 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] [2021-11-06 22:02:10,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 22:02:10,265 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr93ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:10,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:10,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1813587529, now seen corresponding path program 1 times [2021-11-06 22:02:10,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:10,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692954532] [2021-11-06 22:02:10,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:10,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:10,404 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 22:02:10,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:10,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692954532] [2021-11-06 22:02:10,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692954532] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:10,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:10,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:10,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45474558] [2021-11-06 22:02:10,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:10,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:10,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:10,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:10,406 INFO L87 Difference]: Start difference. First operand 1493 states and 1684 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 22:02:10,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:10,761 INFO L93 Difference]: Finished difference Result 2841 states and 3201 transitions. [2021-11-06 22:02:10,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:10,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2021-11-06 22:02:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:10,766 INFO L225 Difference]: With dead ends: 2841 [2021-11-06 22:02:10,766 INFO L226 Difference]: Without dead ends: 2749 [2021-11-06 22:02:10,768 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 22:02:10,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2749 states. [2021-11-06 22:02:11,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2749 to 2613. [2021-11-06 22:02:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2613 states, 2552 states have (on average 1.1841692789968652) internal successors, (3022), 2612 states have internal predecessors, (3022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:02:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2613 states and 3022 transitions. [2021-11-06 22:02:11,015 INFO L78 Accepts]: Start accepts. Automaton has 2613 states and 3022 transitions. Word has length 69 [2021-11-06 22:02:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:11,015 INFO L470 AbstractCegarLoop]: Abstraction has 2613 states and 3022 transitions. [2021-11-06 22:02:11,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 22:02:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2613 states and 3022 transitions. [2021-11-06 22:02:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-06 22:02:11,016 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:11,016 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] [2021-11-06 22:02:11,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 22:02:11,017 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:11,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:11,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1124005197, now seen corresponding path program 1 times [2021-11-06 22:02:11,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:11,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129904220] [2021-11-06 22:02:11,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:11,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:11,206 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 22:02:11,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:11,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129904220] [2021-11-06 22:02:11,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129904220] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:11,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:11,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:02:11,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703707094] [2021-11-06 22:02:11,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:11,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:11,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:11,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:11,208 INFO L87 Difference]: Start difference. First operand 2613 states and 3022 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:02:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:13,767 INFO L93 Difference]: Finished difference Result 3755 states and 4385 transitions. [2021-11-06 22:02:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:02:13,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-11-06 22:02:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:13,775 INFO L225 Difference]: With dead ends: 3755 [2021-11-06 22:02:13,775 INFO L226 Difference]: Without dead ends: 3749 [2021-11-06 22:02:13,776 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 22:02:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3749 states. [2021-11-06 22:02:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3749 to 2607. [2021-11-06 22:02:14,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2607 states, 2549 states have (on average 1.1820321694782268) internal successors, (3013), 2606 states have internal predecessors, (3013), 0 states have call successors, (0), 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 22:02:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 3013 transitions. [2021-11-06 22:02:14,024 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 3013 transitions. Word has length 74 [2021-11-06 22:02:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:14,024 INFO L470 AbstractCegarLoop]: Abstraction has 2607 states and 3013 transitions. [2021-11-06 22:02:14,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:02:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3013 transitions. [2021-11-06 22:02:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-06 22:02:14,025 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:14,025 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 22:02:14,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 22:02:14,026 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:14,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash 200450828, now seen corresponding path program 1 times [2021-11-06 22:02:14,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:14,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723727014] [2021-11-06 22:02:14,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:14,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:14,203 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 22:02:14,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:14,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723727014] [2021-11-06 22:02:14,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723727014] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:14,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:14,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 22:02:14,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473408950] [2021-11-06 22:02:14,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:02:14,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:14,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:02:14,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:02:14,205 INFO L87 Difference]: Start difference. First operand 2607 states and 3013 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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 22:02:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:14,603 INFO L93 Difference]: Finished difference Result 4915 states and 5791 transitions. [2021-11-06 22:02:14,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:02:14,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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 22:02:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:14,610 INFO L225 Difference]: With dead ends: 4915 [2021-11-06 22:02:14,610 INFO L226 Difference]: Without dead ends: 3714 [2021-11-06 22:02:14,612 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 22:02:14,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3714 states. [2021-11-06 22:02:14,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3714 to 2625. [2021-11-06 22:02:14,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2625 states, 2567 states have (on average 1.1807557460070122) internal successors, (3031), 2624 states have internal predecessors, (3031), 0 states have call successors, (0), 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 22:02:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 3031 transitions. [2021-11-06 22:02:14,899 INFO L78 Accepts]: Start accepts. Automaton has 2625 states and 3031 transitions. Word has length 77 [2021-11-06 22:02:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:14,900 INFO L470 AbstractCegarLoop]: Abstraction has 2625 states and 3031 transitions. [2021-11-06 22:02:14,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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 22:02:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3031 transitions. [2021-11-06 22:02:14,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 22:02:14,901 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:14,901 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 22:02:14,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 22:02:14,901 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:14,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:14,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1670986357, now seen corresponding path program 1 times [2021-11-06 22:02:14,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:14,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989427943] [2021-11-06 22:02:14,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:14,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:15,056 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 22:02:15,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:15,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989427943] [2021-11-06 22:02:15,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989427943] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:15,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:15,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:15,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764612317] [2021-11-06 22:02:15,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:15,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:15,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:15,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:15,058 INFO L87 Difference]: Start difference. First operand 2625 states and 3031 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 22:02:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:15,568 INFO L93 Difference]: Finished difference Result 4095 states and 4748 transitions. [2021-11-06 22:02:15,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:02:15,569 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 22:02:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:15,574 INFO L225 Difference]: With dead ends: 4095 [2021-11-06 22:02:15,574 INFO L226 Difference]: Without dead ends: 4083 [2021-11-06 22:02:15,575 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 22:02:15,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4083 states. [2021-11-06 22:02:15,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4083 to 3589. [2021-11-06 22:02:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3589 states, 3534 states have (on average 1.1901528013582343) internal successors, (4206), 3588 states have internal predecessors, (4206), 0 states have call successors, (0), 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 22:02:15,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 4206 transitions. [2021-11-06 22:02:15,891 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 4206 transitions. Word has length 79 [2021-11-06 22:02:15,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:15,891 INFO L470 AbstractCegarLoop]: Abstraction has 3589 states and 4206 transitions. [2021-11-06 22:02:15,892 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 22:02:15,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 4206 transitions. [2021-11-06 22:02:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-06 22:02:15,892 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:15,893 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] [2021-11-06 22:02:15,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-06 22:02:15,893 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:15,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:15,893 INFO L85 PathProgramCache]: Analyzing trace with hash -675612046, now seen corresponding path program 1 times [2021-11-06 22:02:15,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:15,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347012303] [2021-11-06 22:02:15,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:15,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:16,076 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 22:02:16,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:16,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347012303] [2021-11-06 22:02:16,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347012303] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:16,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:16,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:02:16,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728288816] [2021-11-06 22:02:16,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:16,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:16,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:16,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:16,078 INFO L87 Difference]: Start difference. First operand 3589 states and 4206 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:02:18,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:18,971 INFO L93 Difference]: Finished difference Result 5509 states and 6532 transitions. [2021-11-06 22:02:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:02:18,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-06 22:02:18,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:18,981 INFO L225 Difference]: With dead ends: 5509 [2021-11-06 22:02:18,982 INFO L226 Difference]: Without dead ends: 5497 [2021-11-06 22:02:18,984 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 22:02:18,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5497 states. [2021-11-06 22:02:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5497 to 3707. [2021-11-06 22:02:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3707 states, 3656 states have (on average 1.1920131291028446) internal successors, (4358), 3706 states have internal predecessors, (4358), 0 states have call successors, (0), 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 22:02:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4358 transitions. [2021-11-06 22:02:19,323 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4358 transitions. Word has length 84 [2021-11-06 22:02:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:19,324 INFO L470 AbstractCegarLoop]: Abstraction has 3707 states and 4358 transitions. [2021-11-06 22:02:19,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:02:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4358 transitions. [2021-11-06 22:02:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-06 22:02:19,325 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:19,325 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] [2021-11-06 22:02:19,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-06 22:02:19,325 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:19,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash 419776777, now seen corresponding path program 1 times [2021-11-06 22:02:19,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:19,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508310888] [2021-11-06 22:02:19,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:19,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:19,478 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 22:02:19,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:19,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508310888] [2021-11-06 22:02:19,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508310888] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:19,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:19,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:19,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756043515] [2021-11-06 22:02:19,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:19,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:19,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:19,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:19,480 INFO L87 Difference]: Start difference. First operand 3707 states and 4358 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 22:02:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:20,053 INFO L93 Difference]: Finished difference Result 3794 states and 4449 transitions. [2021-11-06 22:02:20,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:02:20,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2021-11-06 22:02:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:20,063 INFO L225 Difference]: With dead ends: 3794 [2021-11-06 22:02:20,064 INFO L226 Difference]: Without dead ends: 3774 [2021-11-06 22:02:20,065 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 22:02:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3774 states. [2021-11-06 22:02:20,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 3687. [2021-11-06 22:02:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3687 states, 3646 states have (on average 1.1826659352715305) internal successors, (4312), 3686 states have internal predecessors, (4312), 0 states have call successors, (0), 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 22:02:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 4312 transitions. [2021-11-06 22:02:20,376 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 4312 transitions. Word has length 89 [2021-11-06 22:02:20,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:20,376 INFO L470 AbstractCegarLoop]: Abstraction has 3687 states and 4312 transitions. [2021-11-06 22:02:20,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 22:02:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 4312 transitions. [2021-11-06 22:02:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-06 22:02:20,377 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:20,377 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] [2021-11-06 22:02:20,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-06 22:02:20,378 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:20,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:20,378 INFO L85 PathProgramCache]: Analyzing trace with hash 623283657, now seen corresponding path program 1 times [2021-11-06 22:02:20,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:20,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119885414] [2021-11-06 22:02:20,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:20,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:20,535 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 22:02:20,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:20,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119885414] [2021-11-06 22:02:20,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119885414] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:20,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:20,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:02:20,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134247864] [2021-11-06 22:02:20,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:20,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:20,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:20,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:20,538 INFO L87 Difference]: Start difference. First operand 3687 states and 4312 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 22:02:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:21,174 INFO L93 Difference]: Finished difference Result 6032 states and 7107 transitions. [2021-11-06 22:02:21,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:02:21,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-11-06 22:02:21,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:21,186 INFO L225 Difference]: With dead ends: 6032 [2021-11-06 22:02:21,186 INFO L226 Difference]: Without dead ends: 6024 [2021-11-06 22:02:21,189 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 22:02:21,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2021-11-06 22:02:21,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 5017. [2021-11-06 22:02:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5017 states, 4978 states have (on average 1.1944556046605062) internal successors, (5946), 5016 states have internal predecessors, (5946), 0 states have call successors, (0), 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 22:02:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5017 states to 5017 states and 5946 transitions. [2021-11-06 22:02:21,661 INFO L78 Accepts]: Start accepts. Automaton has 5017 states and 5946 transitions. Word has length 98 [2021-11-06 22:02:21,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:21,661 INFO L470 AbstractCegarLoop]: Abstraction has 5017 states and 5946 transitions. [2021-11-06 22:02:21,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 22:02:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 5017 states and 5946 transitions. [2021-11-06 22:02:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-06 22:02:21,663 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:21,663 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] [2021-11-06 22:02:21,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-06 22:02:21,665 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:21,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:21,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1264865268, now seen corresponding path program 1 times [2021-11-06 22:02:21,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:21,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756268700] [2021-11-06 22:02:21,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:21,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:21,785 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 22:02:21,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:21,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756268700] [2021-11-06 22:02:21,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756268700] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:21,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:21,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:02:21,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307812080] [2021-11-06 22:02:21,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:02:21,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:21,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:02:21,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:02:21,787 INFO L87 Difference]: Start difference. First operand 5017 states and 5946 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 22:02:24,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:24,749 INFO L93 Difference]: Finished difference Result 5169 states and 6112 transitions. [2021-11-06 22:02:24,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:02:24,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-11-06 22:02:24,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:24,758 INFO L225 Difference]: With dead ends: 5169 [2021-11-06 22:02:24,759 INFO L226 Difference]: Without dead ends: 5135 [2021-11-06 22:02:24,760 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 22:02:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2021-11-06 22:02:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 4983. [2021-11-06 22:02:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4983 states, 4961 states have (on average 1.1793993146543036) internal successors, (5851), 4982 states have internal predecessors, (5851), 0 states have call successors, (0), 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 22:02:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 5851 transitions. [2021-11-06 22:02:25,239 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 5851 transitions. Word has length 98 [2021-11-06 22:02:25,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:25,240 INFO L470 AbstractCegarLoop]: Abstraction has 4983 states and 5851 transitions. [2021-11-06 22:02:25,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 22:02:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 5851 transitions. [2021-11-06 22:02:25,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-06 22:02:25,241 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:25,241 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] [2021-11-06 22:02:25,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-06 22:02:25,242 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:25,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:25,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1381551625, now seen corresponding path program 1 times [2021-11-06 22:02:25,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:25,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422246454] [2021-11-06 22:02:25,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:25,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:25,514 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 22:02:25,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:25,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422246454] [2021-11-06 22:02:25,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422246454] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:25,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:25,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 22:02:25,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900634871] [2021-11-06 22:02:25,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 22:02:25,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:25,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 22:02:25,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 22:02:25,515 INFO L87 Difference]: Start difference. First operand 4983 states and 5851 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 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 22:02:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:27,000 INFO L93 Difference]: Finished difference Result 13887 states and 16363 transitions. [2021-11-06 22:02:27,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 22:02:27,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2021-11-06 22:02:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:27,014 INFO L225 Difference]: With dead ends: 13887 [2021-11-06 22:02:27,014 INFO L226 Difference]: Without dead ends: 8987 [2021-11-06 22:02:27,022 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-06 22:02:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8987 states. [2021-11-06 22:02:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8987 to 4989. [2021-11-06 22:02:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4989 states, 4967 states have (on average 1.1791826051942822) internal successors, (5857), 4988 states have internal predecessors, (5857), 0 states have call successors, (0), 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 22:02:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 5857 transitions. [2021-11-06 22:02:27,607 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 5857 transitions. Word has length 102 [2021-11-06 22:02:27,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:27,607 INFO L470 AbstractCegarLoop]: Abstraction has 4989 states and 5857 transitions. [2021-11-06 22:02:27,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 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 22:02:27,608 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 5857 transitions. [2021-11-06 22:02:27,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-06 22:02:27,609 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:27,609 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] [2021-11-06 22:02:27,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-06 22:02:27,609 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:27,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:27,610 INFO L85 PathProgramCache]: Analyzing trace with hash -722844341, now seen corresponding path program 1 times [2021-11-06 22:02:27,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:27,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242978477] [2021-11-06 22:02:27,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:27,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:27,664 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 22:02:27,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [961789836] [2021-11-06 22:02:27,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:27,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:02:27,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:02:27,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:02:27,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 22:02:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:02:28,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 2541 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-06 22:02:28,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 22:02:28,710 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 22:02:28,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:02:28,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242978477] [2021-11-06 22:02:28,711 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 22:02:28,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961789836] [2021-11-06 22:02:28,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961789836] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:02:28,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:02:28,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 22:02:28,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692940342] [2021-11-06 22:02:28,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:02:28,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:02:28,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:02:28,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:02:28,712 INFO L87 Difference]: Start difference. First operand 4989 states and 5857 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 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 22:02:30,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:02:30,085 INFO L93 Difference]: Finished difference Result 13350 states and 15788 transitions. [2021-11-06 22:02:30,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:02:30,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2021-11-06 22:02:30,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:02:30,097 INFO L225 Difference]: With dead ends: 13350 [2021-11-06 22:02:30,097 INFO L226 Difference]: Without dead ends: 8373 [2021-11-06 22:02:30,105 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 22:02:30,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8373 states. [2021-11-06 22:02:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8373 to 4992. [2021-11-06 22:02:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4992 states, 4970 states have (on average 1.1790744466800804) internal successors, (5860), 4991 states have internal predecessors, (5860), 0 states have call successors, (0), 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 22:02:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4992 states to 4992 states and 5860 transitions. [2021-11-06 22:02:30,726 INFO L78 Accepts]: Start accepts. Automaton has 4992 states and 5860 transitions. Word has length 108 [2021-11-06 22:02:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:02:30,726 INFO L470 AbstractCegarLoop]: Abstraction has 4992 states and 5860 transitions. [2021-11-06 22:02:30,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 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 22:02:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 4992 states and 5860 transitions. [2021-11-06 22:02:30,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-06 22:02:30,728 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:02:30,728 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] [2021-11-06 22:02:30,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-06 22:02:30,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-11-06 22:02:30,943 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 157 more)] === [2021-11-06 22:02:30,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:02:30,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1705414281, now seen corresponding path program 1 times [2021-11-06 22:02:30,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:02:30,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865811490] [2021-11-06 22:02:30,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:30,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:02:30,996 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 22:02:30,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369878281] [2021-11-06 22:02:30,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:02:30,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:02:30,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:02:30,997 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:02:30,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process Killed by 15